./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-examples/sanfoundry_24-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination 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/AutomizerTermination.xml -i ../sv-benchmarks/c/array-examples/sanfoundry_24-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-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(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0a16588b251f5de7b3febde43795c7086835cc989637b8bd82aa8d6af355c6b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:36:23,382 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:36:23,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:36:23,416 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:36:23,417 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:36:23,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:36:23,419 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:36:23,421 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:36:23,422 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:36:23,423 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:36:23,424 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:36:23,425 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:36:23,426 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:36:23,427 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:36:23,428 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:36:23,429 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:36:23,430 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:36:23,431 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:36:23,432 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:36:23,434 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:36:23,436 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:36:23,437 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:36:23,438 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:36:23,439 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:36:23,441 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:36:23,442 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:36:23,442 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:36:23,443 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:36:23,443 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:36:23,444 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:36:23,445 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:36:23,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:36:23,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:36:23,447 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:36:23,448 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:36:23,448 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:36:23,449 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:36:23,449 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:36:23,450 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:36:23,450 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:36:23,451 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:36:23,452 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 03:36:23,476 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:36:23,477 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:36:23,478 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:36:23,478 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:36:23,480 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:36:23,481 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:36:23,481 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:36:23,481 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:36:23,481 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:36:23,482 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:36:23,482 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:36:23,482 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:36:23,482 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:36:23,483 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:36:23,483 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:36:23,483 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:36:23,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:36:23,484 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:36:23,484 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:36:23,484 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:36:23,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:36:23,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:36:23,485 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:36:23,485 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:36:23,485 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:36:23,485 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:36:23,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:36:23,486 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:36:23,486 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:36:23,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:36:23,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:36:23,488 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:36:23,488 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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(F end) ) 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 -> e0a16588b251f5de7b3febde43795c7086835cc989637b8bd82aa8d6af355c6b [2022-02-21 03:36:23,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:36:23,756 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:36:23,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:36:23,760 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:36:23,760 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:36:23,762 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/sanfoundry_24-1.i [2022-02-21 03:36:23,832 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6170e7269/086cf721ec4f472fa55b8fd7a88bee1a/FLAGaa30bb1bf [2022-02-21 03:36:24,261 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:36:24,262 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/sanfoundry_24-1.i [2022-02-21 03:36:24,267 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6170e7269/086cf721ec4f472fa55b8fd7a88bee1a/FLAGaa30bb1bf [2022-02-21 03:36:24,661 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6170e7269/086cf721ec4f472fa55b8fd7a88bee1a [2022-02-21 03:36:24,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:36:24,665 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:36:24,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:36:24,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:36:24,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:36:24,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:36:24" (1/1) ... [2022-02-21 03:36:24,676 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c7554e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:24, skipping insertion in model container [2022-02-21 03:36:24,676 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:36:24" (1/1) ... [2022-02-21 03:36:24,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:36:24,694 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:36:24,861 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/array-examples/sanfoundry_24-1.i[848,861] [2022-02-21 03:36:24,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:36:24,915 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:36:24,924 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/array-examples/sanfoundry_24-1.i[848,861] [2022-02-21 03:36:24,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:36:24,945 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:36:24,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:24 WrapperNode [2022-02-21 03:36:24,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:36:24,948 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:36:24,948 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:36:24,948 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:36:24,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:24" (1/1) ... [2022-02-21 03:36:24,968 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:24" (1/1) ... [2022-02-21 03:36:24,997 INFO L137 Inliner]: procedures = 18, calls = 18, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 73 [2022-02-21 03:36:24,998 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:36:24,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:36:25,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:36:25,000 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:36:25,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:24" (1/1) ... [2022-02-21 03:36:25,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:24" (1/1) ... [2022-02-21 03:36:25,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:24" (1/1) ... [2022-02-21 03:36:25,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:24" (1/1) ... [2022-02-21 03:36:25,030 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:24" (1/1) ... [2022-02-21 03:36:25,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:24" (1/1) ... [2022-02-21 03:36:25,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:24" (1/1) ... [2022-02-21 03:36:25,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:36:25,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:36:25,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:36:25,046 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:36:25,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:24" (1/1) ... [2022-02-21 03:36:25,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:25,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:25,074 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:25,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:36:25,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:36:25,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:36:25,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:36:25,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:36:25,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:36:25,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:36:25,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:36:25,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:36:25,160 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:36:25,161 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:36:25,318 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:36:25,323 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:36:25,324 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-21 03:36:25,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:36:25 BoogieIcfgContainer [2022-02-21 03:36:25,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:36:25,326 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:36:25,326 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:36:25,336 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:36:25,345 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:25,345 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:36:24" (1/3) ... [2022-02-21 03:36:25,346 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c28681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:36:25, skipping insertion in model container [2022-02-21 03:36:25,347 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:25,347 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:24" (2/3) ... [2022-02-21 03:36:25,347 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6c28681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:36:25, skipping insertion in model container [2022-02-21 03:36:25,347 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:25,347 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:36:25" (3/3) ... [2022-02-21 03:36:25,349 INFO L388 chiAutomizerObserver]: Analyzing ICFG sanfoundry_24-1.i [2022-02-21 03:36:25,394 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:36:25,395 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:36:25,395 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:36:25,395 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:36:25,395 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:36:25,395 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:36:25,395 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:36:25,396 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:36:25,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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-21 03:36:25,427 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2022-02-21 03:36:25,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:25,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:25,432 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:36:25,432 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:36:25,432 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:36:25,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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-21 03:36:25,439 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2022-02-21 03:36:25,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:25,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:25,440 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:36:25,440 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:36:25,447 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue 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); 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; 20#L27-3true [2022-02-21 03:36:25,447 INFO L793 eck$LassoCheckResult]: Loop: 20#L27-3true assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 11#L27-2true main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 20#L27-3true [2022-02-21 03:36:25,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:25,452 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:36:25,461 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:25,461 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581948981] [2022-02-21 03:36:25,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:25,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:25,567 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:25,613 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:25,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:25,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-02-21 03:36:25,618 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:25,620 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796759080] [2022-02-21 03:36:25,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:25,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:25,655 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:25,664 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:25,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:25,665 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-02-21 03:36:25,666 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:25,666 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260545389] [2022-02-21 03:36:25,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:25,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:25,689 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:25,703 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:26,053 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:36:26,054 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:36:26,055 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:36:26,055 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:36:26,055 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:36:26,055 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:26,055 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:36:26,055 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:36:26,056 INFO L133 ssoRankerPreferences]: Filename of dumped script: sanfoundry_24-1.i_Iteration1_Lasso [2022-02-21 03:36:26,056 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:36:26,057 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:36:26,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:26,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:26,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:26,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:26,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:26,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:26,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:26,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:26,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:26,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:26,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:26,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:26,703 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:36:26,706 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:36:26,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:26,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:26,710 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:26,713 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:26,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:26,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:26,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:26,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:26,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:26,724 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:26,724 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:26,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:36:26,735 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:26,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:26,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:26,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:26,764 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:26,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:36:26,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:26,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:26,775 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:26,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:26,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:26,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:26,776 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:26,776 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:26,791 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:26,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:26,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:26,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:26,821 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:26,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:36:26,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:26,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:26,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:26,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:26,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:26,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:26,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:26,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:26,851 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:26,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:26,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:26,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:26,883 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:26,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:36:26,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:26,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:26,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:26,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:26,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:26,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:26,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:26,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:26,908 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:26,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:26,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:26,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:26,937 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:26,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:26,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:36:26,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:26,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:26,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:26,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:26,966 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:26,966 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:26,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:27,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:27,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:27,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:27,005 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:27,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:36:27,021 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:27,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:27,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:27,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:27,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:27,031 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:27,031 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:27,039 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:27,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:27,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:27,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:27,056 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:27,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:36:27,061 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:27,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:27,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:27,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:27,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:27,072 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:27,072 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:27,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:27,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:27,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:27,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:27,121 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:27,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:36:27,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:27,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:27,134 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:27,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:27,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:27,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:27,135 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:27,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:27,167 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:27,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-02-21 03:36:27,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:27,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:27,184 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:27,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:36:27,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:27,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:27,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:27,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:27,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:27,197 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:27,197 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:27,223 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:27,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:27,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:27,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:27,242 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:27,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:36:27,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:27,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:27,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:27,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:27,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:27,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:27,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:27,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:27,282 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:27,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:27,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:27,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:27,302 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:27,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:36:27,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:27,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:27,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:27,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:27,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:27,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:27,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:27,327 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:27,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:27,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:27,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:27,345 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:27,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:36:27,348 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:27,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:27,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:27,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:27,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:27,358 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:27,358 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:27,367 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:27,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:27,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:27,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:27,387 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:27,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:36:27,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:27,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:27,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:27,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:27,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:27,398 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:27,398 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:27,410 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:27,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-02-21 03:36:27,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:27,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:27,432 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:27,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:36:27,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:27,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:27,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:27,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:27,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:27,444 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:27,444 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:27,450 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:27,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:27,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:27,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:27,467 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:27,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:36:27,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:27,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:27,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:27,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:27,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:27,478 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:27,478 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:27,483 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:27,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:27,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:27,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:27,499 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:27,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:36:27,502 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:27,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:27,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:27,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:27,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:27,514 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:27,514 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:27,542 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:36:27,572 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-02-21 03:36:27,573 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-02-21 03:36:27,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:27,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:27,586 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:27,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:36:27,619 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:36:27,644 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:36:27,644 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:36:27,645 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~num~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~num~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-02-21 03:36:27,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-02-21 03:36:27,730 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2022-02-21 03:36:27,735 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1;" "main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" [2022-02-21 03:36:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:27,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:27,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:27,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:36:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:27,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:27,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#unseeded} 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); {34#unseeded} is VALID [2022-02-21 03:36:27,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {34#unseeded} is VALID [2022-02-21 03:36:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:27,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:36:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:27,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:27,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~num~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {80#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~num~0#1|)) (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~num~0#1|))} is VALID [2022-02-21 03:36:27,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {80#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~num~0#1|)) (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~num~0#1|))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {72#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~num~0#1|))) unseeded)} is VALID [2022-02-21 03:36:27,852 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-21 03:36:27,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-21 03:36:27,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:27,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:36:27,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:27,912 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:36:27,914 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-21 03:36:27,976 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Result 47 states and 67 transitions. Complement of second has 8 states. [2022-02-21 03:36:27,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:27,976 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:27,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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-21 03:36:27,979 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2022-02-21 03:36:27,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:27,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:27,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-21 03:36:27,985 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:36:27,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:27,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:27,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 67 transitions. [2022-02-21 03:36:27,987 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2022-02-21 03:36:27,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:27,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:27,989 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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-21 03:36:27,991 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2022-02-21 03:36:27,994 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2022-02-21 03:36:27,994 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-21 03:36:27,996 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:36:27,996 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:36:27,996 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 47 states and 67 transitions. cyclomatic complexity: 25 [2022-02-21 03:36:27,999 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words. [2022-02-21 03:36:27,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:36:27,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:36:28,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:36:28,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:28,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:28,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:28,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:28,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:28,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:28,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 47 letters. Loop has 47 letters. [2022-02-21 03:36:28,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 47 letters. Loop has 47 letters. [2022-02-21 03:36:28,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 47 letters. Loop has 47 letters. [2022-02-21 03:36:28,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 24 letters. Loop has 24 letters. [2022-02-21 03:36:28,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 24 letters. Loop has 24 letters. [2022-02-21 03:36:28,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 24 letters. Loop has 24 letters. [2022-02-21 03:36:28,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:28,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:28,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:28,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:28,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:28,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:28,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:36:28,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:36:28,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:36:28,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:36:28,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:36:28,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:36:28,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:28,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:28,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:28,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:28,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:28,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:28,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:36:28,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:36:28,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:36:28,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 9 letters. Loop has 7 letters. [2022-02-21 03:36:28,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 9 letters. Loop has 7 letters. [2022-02-21 03:36:28,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 9 letters. Loop has 7 letters. [2022-02-21 03:36:28,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:28,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:28,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:28,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:36:28,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:36:28,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:36:28,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:36:28,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:36:28,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:36:28,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:28,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:28,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:28,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:36:28,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:36:28,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:36:28,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:36:28,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:36:28,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:36:28,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:28,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:28,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:28,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:36:28,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:36:28,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:36:28,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:36:28,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:36:28,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:36:28,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:36:28,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:36:28,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:36:28,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:28,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:28,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:28,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:36:28,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:36:28,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 9 letters. Loop has 6 letters. [2022-02-21 03:36:28,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:28,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:28,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:36:28,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 9 letters. Loop has 7 letters. [2022-02-21 03:36:28,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 9 letters. Loop has 7 letters. [2022-02-21 03:36:28,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 9 letters. Loop has 7 letters. [2022-02-21 03:36:28,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:36:28,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:36:28,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:36:28,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:28,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:28,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:36:28,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:36:28,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:36:28,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:36:28,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:28,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:28,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:28,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:36:28,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:36:28,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:36:28,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:36:28,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:36:28,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:36:28,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:36:28,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:36:28,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:36:28,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:28,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:28,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:36:28,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:28,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:28,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:36:28,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:28,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:28,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:36:28,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 24 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 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) Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:36:28,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:36:28,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 67 transitions. cyclomatic complexity: 25 Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:36:28,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,036 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:28,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-21 03:36:28,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-02-21 03:36:28,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:36:28,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:36:28,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:36:28,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:28,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 67 transitions. cyclomatic complexity: 25 [2022-02-21 03:36:28,046 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2022-02-21 03:36:28,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 21 states and 29 transitions. [2022-02-21 03:36:28,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-02-21 03:36:28,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-02-21 03:36:28,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 29 transitions. [2022-02-21 03:36:28,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:28,051 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-02-21 03:36:28,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 29 transitions. [2022-02-21 03:36:28,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-21 03:36:28,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:28,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 29 transitions. Second operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 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-21 03:36:28,069 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 29 transitions. Second operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 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-21 03:36:28,070 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. Second operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 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-21 03:36:28,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:28,079 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2022-02-21 03:36:28,080 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2022-02-21 03:36:28,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:28,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:28,082 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 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 21 states and 29 transitions. [2022-02-21 03:36:28,082 INFO L87 Difference]: Start difference. First operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 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 21 states and 29 transitions. [2022-02-21 03:36:28,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:28,085 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2022-02-21 03:36:28,085 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2022-02-21 03:36:28,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:28,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:28,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:28,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:28,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 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-21 03:36:28,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2022-02-21 03:36:28,093 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-02-21 03:36:28,093 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-02-21 03:36:28,094 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:36:28,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 29 transitions. [2022-02-21 03:36:28,094 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2022-02-21 03:36:28,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:28,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:28,095 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:36:28,095 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:28,095 INFO L791 eck$LassoCheckResult]: Stem: 144#ULTIMATE.startENTRY 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); 145#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; 151#L27-3 assume !(main_~i~0#1 < main_~num~0#1); 157#L27-4 main_~i~0#1 := 0; 158#L32-3 [2022-02-21 03:36:28,095 INFO L793 eck$LassoCheckResult]: Loop: 158#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 161#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 150#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 158#L32-3 [2022-02-21 03:36:28,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:28,096 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2022-02-21 03:36:28,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:28,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039773831] [2022-02-21 03:36:28,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:28,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:28,106 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:28,114 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:28,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:28,114 INFO L85 PathProgramCache]: Analyzing trace with hash 54137, now seen corresponding path program 1 times [2022-02-21 03:36:28,114 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:28,115 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144974993] [2022-02-21 03:36:28,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:28,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:28,146 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:28,153 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:28,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:28,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1807957807, now seen corresponding path program 1 times [2022-02-21 03:36:28,154 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:28,154 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785728882] [2022-02-21 03:36:28,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:28,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:28,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:28,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {212#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); {212#true} is VALID [2022-02-21 03:36:28,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {214#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:28,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {214#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < main_~num~0#1); {215#(<= |ULTIMATE.start_main_~num~0#1| 0)} is VALID [2022-02-21 03:36:28,259 INFO L290 TraceCheckUtils]: 3: Hoare triple {215#(<= |ULTIMATE.start_main_~num~0#1| 0)} main_~i~0#1 := 0; {216#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 0))} is VALID [2022-02-21 03:36:28,260 INFO L290 TraceCheckUtils]: 4: Hoare triple {216#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 0))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {213#false} is VALID [2022-02-21 03:36:28,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {213#false} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {213#false} is VALID [2022-02-21 03:36:28,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {213#false} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {213#false} is VALID [2022-02-21 03:36:28,261 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-21 03:36:28,261 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:28,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785728882] [2022-02-21 03:36:28,262 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785728882] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:36:28,262 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:36:28,262 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:36:28,262 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966820068] [2022-02-21 03:36:28,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:36:28,328 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:28,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:36:28,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:36:28,331 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-21 03:36:28,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:28,429 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-02-21 03:36:28,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:36:28,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-21 03:36:28,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:28,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2022-02-21 03:36:28,440 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:36:28,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 32 states and 38 transitions. [2022-02-21 03:36:28,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-02-21 03:36:28,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-02-21 03:36:28,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 38 transitions. [2022-02-21 03:36:28,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:28,441 INFO L681 BuchiCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-02-21 03:36:28,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 38 transitions. [2022-02-21 03:36:28,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2022-02-21 03:36:28,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:28,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states and 38 transitions. Second operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 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-21 03:36:28,443 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states and 38 transitions. Second operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 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-21 03:36:28,443 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 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-21 03:36:28,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:28,444 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-02-21 03:36:28,444 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-02-21 03:36:28,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:28,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:28,445 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 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 32 states and 38 transitions. [2022-02-21 03:36:28,445 INFO L87 Difference]: Start difference. First operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 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 32 states and 38 transitions. [2022-02-21 03:36:28,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:28,446 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-02-21 03:36:28,446 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-02-21 03:36:28,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:28,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:28,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:28,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:28,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 19 states have internal predecessors, (24), 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-21 03:36:28,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-02-21 03:36:28,448 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-02-21 03:36:28,448 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-02-21 03:36:28,448 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:36:28,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2022-02-21 03:36:28,448 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:36:28,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:28,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:28,449 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:28,449 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:28,449 INFO L791 eck$LassoCheckResult]: Stem: 259#ULTIMATE.startENTRY 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); 260#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; 265#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 268#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 269#L27-3 assume !(main_~i~0#1 < main_~num~0#1); 270#L27-4 main_~i~0#1 := 0; 271#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 275#L34 [2022-02-21 03:36:28,449 INFO L793 eck$LassoCheckResult]: Loop: 275#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 264#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 272#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 275#L34 [2022-02-21 03:36:28,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:28,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1809669547, now seen corresponding path program 1 times [2022-02-21 03:36:28,450 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:28,450 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960801742] [2022-02-21 03:36:28,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:28,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:28,465 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:28,496 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:28,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:28,496 INFO L85 PathProgramCache]: Analyzing trace with hash 69557, now seen corresponding path program 2 times [2022-02-21 03:36:28,496 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:28,497 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722471579] [2022-02-21 03:36:28,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:28,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:28,511 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:28,529 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:28,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:28,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1436015051, now seen corresponding path program 1 times [2022-02-21 03:36:28,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:28,530 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16341838] [2022-02-21 03:36:28,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:28,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:28,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {348#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); {348#true} is VALID [2022-02-21 03:36:28,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {348#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {350#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:28,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {350#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {350#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:28,628 INFO L290 TraceCheckUtils]: 3: Hoare triple {350#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {351#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:28,629 INFO L290 TraceCheckUtils]: 4: Hoare triple {351#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < main_~num~0#1); {352#(<= |ULTIMATE.start_main_~num~0#1| 1)} is VALID [2022-02-21 03:36:28,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {352#(<= |ULTIMATE.start_main_~num~0#1| 1)} main_~i~0#1 := 0; {353#(and (<= |ULTIMATE.start_main_~num~0#1| 1) (= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-21 03:36:28,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {353#(and (<= |ULTIMATE.start_main_~num~0#1| 1) (= |ULTIMATE.start_main_~i~0#1| 0))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {353#(and (<= |ULTIMATE.start_main_~num~0#1| 1) (= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-21 03:36:28,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {353#(and (<= |ULTIMATE.start_main_~num~0#1| 1) (= |ULTIMATE.start_main_~i~0#1| 0))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {353#(and (<= |ULTIMATE.start_main_~num~0#1| 1) (= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-21 03:36:28,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {353#(and (<= |ULTIMATE.start_main_~num~0#1| 1) (= |ULTIMATE.start_main_~i~0#1| 0))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {354#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:36:28,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {354#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {349#false} is VALID [2022-02-21 03:36:28,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:28,632 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:28,632 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16341838] [2022-02-21 03:36:28,632 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16341838] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:28,632 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601057535] [2022-02-21 03:36:28,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:28,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:28,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:28,634 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:28,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-02-21 03:36:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:28,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:36:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:28,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:28,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {348#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); {348#true} is VALID [2022-02-21 03:36:28,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {348#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {361#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:28,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {361#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {361#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:28,799 INFO L290 TraceCheckUtils]: 3: Hoare triple {361#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {351#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:28,799 INFO L290 TraceCheckUtils]: 4: Hoare triple {351#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < main_~num~0#1); {352#(<= |ULTIMATE.start_main_~num~0#1| 1)} is VALID [2022-02-21 03:36:28,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {352#(<= |ULTIMATE.start_main_~num~0#1| 1)} main_~i~0#1 := 0; {374#(and (<= |ULTIMATE.start_main_~num~0#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:28,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {374#(and (<= |ULTIMATE.start_main_~num~0#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {374#(and (<= |ULTIMATE.start_main_~num~0#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:28,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {374#(and (<= |ULTIMATE.start_main_~num~0#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {374#(and (<= |ULTIMATE.start_main_~num~0#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:28,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {374#(and (<= |ULTIMATE.start_main_~num~0#1| 1) (<= 0 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {384#(and (<= |ULTIMATE.start_main_~num~0#1| 1) (<= 1 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:28,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {384#(and (<= |ULTIMATE.start_main_~num~0#1| 1) (<= 1 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {349#false} is VALID [2022-02-21 03:36:28,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:28,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:28,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {354#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {349#false} is VALID [2022-02-21 03:36:28,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {391#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {354#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:36:28,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {391#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {391#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:28,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {391#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {391#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:28,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {352#(<= |ULTIMATE.start_main_~num~0#1| 1)} main_~i~0#1 := 0; {391#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:28,888 INFO L290 TraceCheckUtils]: 4: Hoare triple {351#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < main_~num~0#1); {352#(<= |ULTIMATE.start_main_~num~0#1| 1)} is VALID [2022-02-21 03:36:28,888 INFO L290 TraceCheckUtils]: 3: Hoare triple {361#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {351#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:28,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {361#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {361#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:28,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {348#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {361#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:28,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {348#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); {348#true} is VALID [2022-02-21 03:36:28,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:28,890 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601057535] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:28,890 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:28,890 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-02-21 03:36:28,890 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076347515] [2022-02-21 03:36:28,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:28,937 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:28,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-21 03:36:28,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-02-21 03:36:28,939 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. cyclomatic complexity: 7 Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 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-21 03:36:29,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:29,251 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-02-21 03:36:29,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:36:29,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 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-21 03:36:29,274 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-21 03:36:29,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 74 transitions. [2022-02-21 03:36:29,277 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:36:29,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 46 states and 54 transitions. [2022-02-21 03:36:29,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2022-02-21 03:36:29,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2022-02-21 03:36:29,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 54 transitions. [2022-02-21 03:36:29,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:29,279 INFO L681 BuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-02-21 03:36:29,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 54 transitions. [2022-02-21 03:36:29,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 28. [2022-02-21 03:36:29,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:29,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states and 54 transitions. Second operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 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-21 03:36:29,281 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states and 54 transitions. Second operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 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-21 03:36:29,281 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 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-21 03:36:29,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:29,282 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-02-21 03:36:29,283 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-02-21 03:36:29,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:29,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:29,283 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 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 46 states and 54 transitions. [2022-02-21 03:36:29,283 INFO L87 Difference]: Start difference. First operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 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 46 states and 54 transitions. [2022-02-21 03:36:29,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:29,285 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-02-21 03:36:29,285 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-02-21 03:36:29,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:29,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:29,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:29,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:29,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 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-21 03:36:29,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-02-21 03:36:29,286 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-02-21 03:36:29,286 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-02-21 03:36:29,286 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:36:29,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2022-02-21 03:36:29,287 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:36:29,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:29,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:29,287 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:29,287 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:29,288 INFO L791 eck$LassoCheckResult]: Stem: 482#ULTIMATE.startENTRY 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); 483#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; 488#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 502#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 503#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 491#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 492#L27-3 assume !(main_~i~0#1 < main_~num~0#1); 493#L27-4 main_~i~0#1 := 0; 494#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 499#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 487#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 496#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 501#L34 [2022-02-21 03:36:29,288 INFO L793 eck$LassoCheckResult]: Loop: 501#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 506#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 505#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 501#L34 [2022-02-21 03:36:29,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:29,288 INFO L85 PathProgramCache]: Analyzing trace with hash 780817485, now seen corresponding path program 2 times [2022-02-21 03:36:29,288 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:29,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66750683] [2022-02-21 03:36:29,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:29,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:29,312 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:29,325 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:29,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:29,326 INFO L85 PathProgramCache]: Analyzing trace with hash 69557, now seen corresponding path program 3 times [2022-02-21 03:36:29,326 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:29,326 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718164222] [2022-02-21 03:36:29,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:29,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:29,332 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:29,343 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:29,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:29,344 INFO L85 PathProgramCache]: Analyzing trace with hash -209139735, now seen corresponding path program 3 times [2022-02-21 03:36:29,344 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:29,344 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092425037] [2022-02-21 03:36:29,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:29,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:29,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {607#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); {607#true} is VALID [2022-02-21 03:36:29,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {607#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {609#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:29,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {609#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {609#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:29,448 INFO L290 TraceCheckUtils]: 3: Hoare triple {609#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {610#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:29,449 INFO L290 TraceCheckUtils]: 4: Hoare triple {610#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {610#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:29,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {610#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {611#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:29,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {611#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 < main_~num~0#1); {612#(<= |ULTIMATE.start_main_~num~0#1| 2)} is VALID [2022-02-21 03:36:29,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {612#(<= |ULTIMATE.start_main_~num~0#1| 2)} main_~i~0#1 := 0; {613#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 2))} is VALID [2022-02-21 03:36:29,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {613#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 2))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {613#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 2))} is VALID [2022-02-21 03:36:29,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {613#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 2))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {613#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 2))} is VALID [2022-02-21 03:36:29,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {613#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 2))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {614#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:29,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {614#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {614#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:29,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {614#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {614#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:29,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {614#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {615#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:36:29,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {615#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {608#false} is VALID [2022-02-21 03:36:29,458 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:29,458 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:29,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092425037] [2022-02-21 03:36:29,458 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092425037] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:29,459 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419287221] [2022-02-21 03:36:29,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:36:29,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:29,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:29,460 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:29,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-02-21 03:36:29,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-21 03:36:29,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:36:29,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:36:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:29,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:29,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {607#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); {607#true} is VALID [2022-02-21 03:36:29,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {607#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {622#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:29,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {622#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {622#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:29,732 INFO L290 TraceCheckUtils]: 3: Hoare triple {622#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {610#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:29,733 INFO L290 TraceCheckUtils]: 4: Hoare triple {610#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {610#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:29,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {610#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {611#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:29,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {611#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 < main_~num~0#1); {612#(<= |ULTIMATE.start_main_~num~0#1| 2)} is VALID [2022-02-21 03:36:29,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {612#(<= |ULTIMATE.start_main_~num~0#1| 2)} main_~i~0#1 := 0; {641#(and (<= |ULTIMATE.start_main_~num~0#1| 2) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:29,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {641#(and (<= |ULTIMATE.start_main_~num~0#1| 2) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {641#(and (<= |ULTIMATE.start_main_~num~0#1| 2) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:29,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {641#(and (<= |ULTIMATE.start_main_~num~0#1| 2) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {641#(and (<= |ULTIMATE.start_main_~num~0#1| 2) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:29,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {641#(and (<= |ULTIMATE.start_main_~num~0#1| 2) (<= 0 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {651#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 2))} is VALID [2022-02-21 03:36:29,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {651#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 2))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {651#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 2))} is VALID [2022-02-21 03:36:29,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {651#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 2))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {651#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 2))} is VALID [2022-02-21 03:36:29,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {651#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 2))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {661#(and (<= |ULTIMATE.start_main_~num~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:29,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {661#(and (<= |ULTIMATE.start_main_~num~0#1| 2) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {608#false} is VALID [2022-02-21 03:36:29,739 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:29,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:29,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {615#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {608#false} is VALID [2022-02-21 03:36:29,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {614#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {615#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:36:29,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {614#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {614#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:29,881 INFO L290 TraceCheckUtils]: 11: Hoare triple {614#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {614#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:29,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {677#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {614#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:29,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {677#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {677#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:29,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {677#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {677#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:29,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {612#(<= |ULTIMATE.start_main_~num~0#1| 2)} main_~i~0#1 := 0; {677#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:29,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {611#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 < main_~num~0#1); {612#(<= |ULTIMATE.start_main_~num~0#1| 2)} is VALID [2022-02-21 03:36:29,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {610#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {611#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:29,884 INFO L290 TraceCheckUtils]: 4: Hoare triple {610#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {610#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:29,885 INFO L290 TraceCheckUtils]: 3: Hoare triple {622#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {610#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:29,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {622#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {622#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:29,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {607#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {622#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:29,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {607#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); {607#true} is VALID [2022-02-21 03:36:29,886 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:29,887 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419287221] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:29,887 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:29,887 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-02-21 03:36:29,887 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449118538] [2022-02-21 03:36:29,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:29,932 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:29,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-21 03:36:29,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:36:29,934 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 8 Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 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-21 03:36:30,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:30,305 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2022-02-21 03:36:30,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:36:30,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 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-21 03:36:30,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:30,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 104 transitions. [2022-02-21 03:36:30,332 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:36:30,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 60 states and 70 transitions. [2022-02-21 03:36:30,334 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2022-02-21 03:36:30,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2022-02-21 03:36:30,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 70 transitions. [2022-02-21 03:36:30,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:30,335 INFO L681 BuchiCegarLoop]: Abstraction has 60 states and 70 transitions. [2022-02-21 03:36:30,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 70 transitions. [2022-02-21 03:36:30,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2022-02-21 03:36:30,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:30,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states and 70 transitions. Second operand has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 35 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-21 03:36:30,337 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states and 70 transitions. Second operand has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 35 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-21 03:36:30,337 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 35 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-21 03:36:30,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:30,339 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-02-21 03:36:30,339 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2022-02-21 03:36:30,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:30,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:30,340 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 35 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 60 states and 70 transitions. [2022-02-21 03:36:30,340 INFO L87 Difference]: Start difference. First operand has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 35 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 60 states and 70 transitions. [2022-02-21 03:36:30,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:30,342 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2022-02-21 03:36:30,342 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2022-02-21 03:36:30,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:30,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:30,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:30,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:30,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 35 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-21 03:36:30,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-02-21 03:36:30,344 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-02-21 03:36:30,344 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-02-21 03:36:30,344 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:36:30,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 42 transitions. [2022-02-21 03:36:30,344 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:36:30,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:30,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:30,345 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-02-21 03:36:30,345 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:30,345 INFO L791 eck$LassoCheckResult]: Stem: 802#ULTIMATE.startENTRY 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); 803#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; 808#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 819#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 820#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 811#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 812#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 823#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 822#L27-3 assume !(main_~i~0#1 < main_~num~0#1); 813#L27-4 main_~i~0#1 := 0; 814#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 818#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 807#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 815#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 833#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 831#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 830#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 825#L34 [2022-02-21 03:36:30,345 INFO L793 eck$LassoCheckResult]: Loop: 825#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 826#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 824#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 825#L34 [2022-02-21 03:36:30,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:30,346 INFO L85 PathProgramCache]: Analyzing trace with hash -286749017, now seen corresponding path program 4 times [2022-02-21 03:36:30,346 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:30,346 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82784921] [2022-02-21 03:36:30,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:30,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:30,378 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:30,393 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:30,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:30,394 INFO L85 PathProgramCache]: Analyzing trace with hash 69557, now seen corresponding path program 4 times [2022-02-21 03:36:30,394 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:30,394 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960377098] [2022-02-21 03:36:30,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:30,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:30,399 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:30,405 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:30,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:30,406 INFO L85 PathProgramCache]: Analyzing trace with hash 150026063, now seen corresponding path program 5 times [2022-02-21 03:36:30,406 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:30,406 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250077258] [2022-02-21 03:36:30,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:30,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:30,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {963#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); {963#true} is VALID [2022-02-21 03:36:30,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {963#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {965#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:30,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {965#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {965#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:30,539 INFO L290 TraceCheckUtils]: 3: Hoare triple {965#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {966#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:30,539 INFO L290 TraceCheckUtils]: 4: Hoare triple {966#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {966#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:30,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {966#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {967#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:30,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {967#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {967#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:30,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {967#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {968#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:30,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {968#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(main_~i~0#1 < main_~num~0#1); {969#(<= |ULTIMATE.start_main_~num~0#1| 3)} is VALID [2022-02-21 03:36:30,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {969#(<= |ULTIMATE.start_main_~num~0#1| 3)} main_~i~0#1 := 0; {970#(and (<= |ULTIMATE.start_main_~num~0#1| 3) (= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-21 03:36:30,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {970#(and (<= |ULTIMATE.start_main_~num~0#1| 3) (= |ULTIMATE.start_main_~i~0#1| 0))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {970#(and (<= |ULTIMATE.start_main_~num~0#1| 3) (= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-21 03:36:30,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {970#(and (<= |ULTIMATE.start_main_~num~0#1| 3) (= |ULTIMATE.start_main_~i~0#1| 0))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {970#(and (<= |ULTIMATE.start_main_~num~0#1| 3) (= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-21 03:36:30,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {970#(and (<= |ULTIMATE.start_main_~num~0#1| 3) (= |ULTIMATE.start_main_~i~0#1| 0))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {971#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:30,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {971#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {971#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:30,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {971#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {971#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:30,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {971#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {972#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:30,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {972#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {972#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:30,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {972#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {972#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:30,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {972#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {973#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:36:30,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {973#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {964#false} is VALID [2022-02-21 03:36:30,547 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:30,547 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:30,547 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250077258] [2022-02-21 03:36:30,547 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250077258] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:30,547 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233559072] [2022-02-21 03:36:30,547 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-21 03:36:30,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:30,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:30,600 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:30,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-02-21 03:36:30,671 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-02-21 03:36:30,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:36:30,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:36:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:30,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:30,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {963#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); {963#true} is VALID [2022-02-21 03:36:30,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {963#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {980#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:30,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {980#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {980#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:30,938 INFO L290 TraceCheckUtils]: 3: Hoare triple {980#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {966#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:30,938 INFO L290 TraceCheckUtils]: 4: Hoare triple {966#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {966#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:30,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {966#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {967#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:30,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {967#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {967#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:30,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {967#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {968#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:30,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {968#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(main_~i~0#1 < main_~num~0#1); {969#(<= |ULTIMATE.start_main_~num~0#1| 3)} is VALID [2022-02-21 03:36:30,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {969#(<= |ULTIMATE.start_main_~num~0#1| 3)} main_~i~0#1 := 0; {1005#(and (<= |ULTIMATE.start_main_~num~0#1| 3) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:30,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {1005#(and (<= |ULTIMATE.start_main_~num~0#1| 3) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1005#(and (<= |ULTIMATE.start_main_~num~0#1| 3) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:30,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {1005#(and (<= |ULTIMATE.start_main_~num~0#1| 3) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {1005#(and (<= |ULTIMATE.start_main_~num~0#1| 3) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:30,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {1005#(and (<= |ULTIMATE.start_main_~num~0#1| 3) (<= 0 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1015#(and (<= |ULTIMATE.start_main_~num~0#1| 3) (<= 1 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:30,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {1015#(and (<= |ULTIMATE.start_main_~num~0#1| 3) (<= 1 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1015#(and (<= |ULTIMATE.start_main_~num~0#1| 3) (<= 1 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:30,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {1015#(and (<= |ULTIMATE.start_main_~num~0#1| 3) (<= 1 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {1015#(and (<= |ULTIMATE.start_main_~num~0#1| 3) (<= 1 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:30,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {1015#(and (<= |ULTIMATE.start_main_~num~0#1| 3) (<= 1 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1025#(and (<= |ULTIMATE.start_main_~num~0#1| 3) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:30,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {1025#(and (<= |ULTIMATE.start_main_~num~0#1| 3) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1025#(and (<= |ULTIMATE.start_main_~num~0#1| 3) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:30,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {1025#(and (<= |ULTIMATE.start_main_~num~0#1| 3) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {1025#(and (<= |ULTIMATE.start_main_~num~0#1| 3) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:30,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {1025#(and (<= |ULTIMATE.start_main_~num~0#1| 3) (<= 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1035#(and (<= |ULTIMATE.start_main_~num~0#1| 3) (<= 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:30,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {1035#(and (<= |ULTIMATE.start_main_~num~0#1| 3) (<= 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {964#false} is VALID [2022-02-21 03:36:30,952 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:30,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:31,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {973#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {964#false} is VALID [2022-02-21 03:36:31,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {972#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {973#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:36:31,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {972#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {972#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:31,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {972#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {972#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:31,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {971#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {972#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:31,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {971#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {971#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:31,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {971#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {971#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:31,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {1060#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {971#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:31,138 INFO L290 TraceCheckUtils]: 11: Hoare triple {1060#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {1060#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:31,138 INFO L290 TraceCheckUtils]: 10: Hoare triple {1060#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1060#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:31,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {969#(<= |ULTIMATE.start_main_~num~0#1| 3)} main_~i~0#1 := 0; {1060#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:31,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {968#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(main_~i~0#1 < main_~num~0#1); {969#(<= |ULTIMATE.start_main_~num~0#1| 3)} is VALID [2022-02-21 03:36:31,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {967#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {968#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:31,140 INFO L290 TraceCheckUtils]: 6: Hoare triple {967#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {967#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:31,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {966#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {967#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:31,141 INFO L290 TraceCheckUtils]: 4: Hoare triple {966#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {966#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:31,142 INFO L290 TraceCheckUtils]: 3: Hoare triple {980#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {966#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:31,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {980#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {980#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:31,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {963#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {980#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:31,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {963#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); {963#true} is VALID [2022-02-21 03:36:31,143 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:31,146 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233559072] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:31,146 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:31,146 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2022-02-21 03:36:31,149 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105587874] [2022-02-21 03:36:31,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:31,210 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:31,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-21 03:36:31,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-02-21 03:36:31,211 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. cyclomatic complexity: 9 Second operand has 17 states, 16 states have (on average 2.375) internal successors, (38), 17 states have internal predecessors, (38), 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-21 03:36:31,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:31,756 INFO L93 Difference]: Finished difference Result 115 states and 134 transitions. [2022-02-21 03:36:31,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:36:31,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.375) internal successors, (38), 17 states have internal predecessors, (38), 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-21 03:36:31,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:31,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 134 transitions. [2022-02-21 03:36:31,798 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:36:31,801 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 74 states and 86 transitions. [2022-02-21 03:36:31,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2022-02-21 03:36:31,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2022-02-21 03:36:31,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 86 transitions. [2022-02-21 03:36:31,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:31,802 INFO L681 BuchiCegarLoop]: Abstraction has 74 states and 86 transitions. [2022-02-21 03:36:31,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 86 transitions. [2022-02-21 03:36:31,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 44. [2022-02-21 03:36:31,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:31,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states and 86 transitions. Second operand has 44 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 43 states have internal predecessors, (51), 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-21 03:36:31,810 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states and 86 transitions. Second operand has 44 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 43 states have internal predecessors, (51), 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-21 03:36:31,810 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand has 44 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 43 states have internal predecessors, (51), 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-21 03:36:31,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:31,812 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2022-02-21 03:36:31,812 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2022-02-21 03:36:31,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:31,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:31,816 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 43 states have internal predecessors, (51), 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 74 states and 86 transitions. [2022-02-21 03:36:31,817 INFO L87 Difference]: Start difference. First operand has 44 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 43 states have internal predecessors, (51), 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 74 states and 86 transitions. [2022-02-21 03:36:31,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:31,819 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2022-02-21 03:36:31,819 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2022-02-21 03:36:31,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:31,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:31,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:31,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:31,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 43 states have internal predecessors, (51), 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-21 03:36:31,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-02-21 03:36:31,821 INFO L704 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-02-21 03:36:31,821 INFO L587 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-02-21 03:36:31,821 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:36:31,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 51 transitions. [2022-02-21 03:36:31,821 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:36:31,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:31,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:31,822 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 1, 1, 1, 1] [2022-02-21 03:36:31,823 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:31,823 INFO L791 eck$LassoCheckResult]: Stem: 1219#ULTIMATE.startENTRY 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); 1220#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; 1225#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1239#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1240#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1228#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1229#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1248#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1247#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1243#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1242#L27-3 assume !(main_~i~0#1 < main_~num~0#1); 1230#L27-4 main_~i~0#1 := 0; 1231#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 1259#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 1257#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1256#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 1236#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 1224#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1233#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 1238#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 1253#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1252#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 1245#L34 [2022-02-21 03:36:31,824 INFO L793 eck$LassoCheckResult]: Loop: 1245#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 1246#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1244#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 1245#L34 [2022-02-21 03:36:31,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:31,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1958082385, now seen corresponding path program 6 times [2022-02-21 03:36:31,824 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:31,825 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912278860] [2022-02-21 03:36:31,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:31,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:31,873 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:31,889 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:31,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:31,890 INFO L85 PathProgramCache]: Analyzing trace with hash 69557, now seen corresponding path program 5 times [2022-02-21 03:36:31,890 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:31,890 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465350259] [2022-02-21 03:36:31,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:31,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:31,904 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:31,914 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:31,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:31,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1013442971, now seen corresponding path program 7 times [2022-02-21 03:36:31,914 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:31,914 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620341095] [2022-02-21 03:36:31,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:31,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:32,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {1416#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); {1416#true} is VALID [2022-02-21 03:36:32,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {1416#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {1418#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:32,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {1418#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1418#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:32,049 INFO L290 TraceCheckUtils]: 3: Hoare triple {1418#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1419#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:32,050 INFO L290 TraceCheckUtils]: 4: Hoare triple {1419#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1419#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:32,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {1419#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1420#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:32,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {1420#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1420#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:32,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {1420#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1421#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:32,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {1421#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1421#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:32,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {1421#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1422#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:32,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {1422#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < main_~num~0#1); {1423#(<= |ULTIMATE.start_main_~num~0#1| 4)} is VALID [2022-02-21 03:36:32,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {1423#(<= |ULTIMATE.start_main_~num~0#1| 4)} main_~i~0#1 := 0; {1424#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 4))} is VALID [2022-02-21 03:36:32,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {1424#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 4))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1424#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 4))} is VALID [2022-02-21 03:36:32,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {1424#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 4))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {1424#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 4))} is VALID [2022-02-21 03:36:32,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {1424#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 4))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1425#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:32,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {1425#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1425#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:32,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {1425#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {1425#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:32,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {1425#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1426#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:32,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {1426#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1426#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:32,056 INFO L290 TraceCheckUtils]: 19: Hoare triple {1426#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {1426#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:32,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {1426#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1427#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:32,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {1427#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1427#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:32,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {1427#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {1427#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:32,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {1427#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1428#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:36:32,059 INFO L290 TraceCheckUtils]: 24: Hoare triple {1428#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1417#false} is VALID [2022-02-21 03:36:32,059 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:32,059 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:32,060 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620341095] [2022-02-21 03:36:32,060 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620341095] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:32,060 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912698197] [2022-02-21 03:36:32,060 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-21 03:36:32,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:32,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:32,063 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:32,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-02-21 03:36:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:32,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:36:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:32,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:32,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {1416#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); {1416#true} is VALID [2022-02-21 03:36:32,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {1416#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {1435#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:32,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {1435#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1435#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:32,475 INFO L290 TraceCheckUtils]: 3: Hoare triple {1435#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1419#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:32,475 INFO L290 TraceCheckUtils]: 4: Hoare triple {1419#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1419#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:32,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {1419#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1420#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:32,476 INFO L290 TraceCheckUtils]: 6: Hoare triple {1420#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1420#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:32,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {1420#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1421#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:32,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {1421#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1421#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:32,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {1421#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1422#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:32,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {1422#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < main_~num~0#1); {1423#(<= |ULTIMATE.start_main_~num~0#1| 4)} is VALID [2022-02-21 03:36:32,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {1423#(<= |ULTIMATE.start_main_~num~0#1| 4)} main_~i~0#1 := 0; {1466#(and (<= |ULTIMATE.start_main_~num~0#1| 4) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:32,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {1466#(and (<= |ULTIMATE.start_main_~num~0#1| 4) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1466#(and (<= |ULTIMATE.start_main_~num~0#1| 4) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:32,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {1466#(and (<= |ULTIMATE.start_main_~num~0#1| 4) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {1466#(and (<= |ULTIMATE.start_main_~num~0#1| 4) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:32,480 INFO L290 TraceCheckUtils]: 14: Hoare triple {1466#(and (<= |ULTIMATE.start_main_~num~0#1| 4) (<= 0 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1476#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 4))} is VALID [2022-02-21 03:36:32,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {1476#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 4))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1476#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 4))} is VALID [2022-02-21 03:36:32,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {1476#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 4))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {1476#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 4))} is VALID [2022-02-21 03:36:32,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {1476#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 4))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1486#(and (<= |ULTIMATE.start_main_~num~0#1| 4) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:32,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {1486#(and (<= |ULTIMATE.start_main_~num~0#1| 4) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1486#(and (<= |ULTIMATE.start_main_~num~0#1| 4) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:32,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {1486#(and (<= |ULTIMATE.start_main_~num~0#1| 4) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {1486#(and (<= |ULTIMATE.start_main_~num~0#1| 4) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:32,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {1486#(and (<= |ULTIMATE.start_main_~num~0#1| 4) (<= 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1496#(and (<= |ULTIMATE.start_main_~num~0#1| 4) (<= 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:32,485 INFO L290 TraceCheckUtils]: 21: Hoare triple {1496#(and (<= |ULTIMATE.start_main_~num~0#1| 4) (<= 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1496#(and (<= |ULTIMATE.start_main_~num~0#1| 4) (<= 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:32,485 INFO L290 TraceCheckUtils]: 22: Hoare triple {1496#(and (<= |ULTIMATE.start_main_~num~0#1| 4) (<= 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {1496#(and (<= |ULTIMATE.start_main_~num~0#1| 4) (<= 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:32,486 INFO L290 TraceCheckUtils]: 23: Hoare triple {1496#(and (<= |ULTIMATE.start_main_~num~0#1| 4) (<= 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1506#(and (<= |ULTIMATE.start_main_~num~0#1| 4) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:32,486 INFO L290 TraceCheckUtils]: 24: Hoare triple {1506#(and (<= |ULTIMATE.start_main_~num~0#1| 4) (<= 4 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1417#false} is VALID [2022-02-21 03:36:32,487 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:32,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:32,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {1428#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1417#false} is VALID [2022-02-21 03:36:32,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {1427#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1428#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:36:32,688 INFO L290 TraceCheckUtils]: 22: Hoare triple {1427#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {1427#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:32,688 INFO L290 TraceCheckUtils]: 21: Hoare triple {1427#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1427#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:32,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {1426#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1427#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:32,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {1426#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {1426#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:32,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {1426#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1426#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:32,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {1425#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1426#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:32,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {1425#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {1425#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:32,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {1425#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1425#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:32,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {1540#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1425#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:32,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {1540#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {1540#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:32,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {1540#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1540#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:32,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {1423#(<= |ULTIMATE.start_main_~num~0#1| 4)} main_~i~0#1 := 0; {1540#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:32,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {1422#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < main_~num~0#1); {1423#(<= |ULTIMATE.start_main_~num~0#1| 4)} is VALID [2022-02-21 03:36:32,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {1421#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1422#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:32,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {1421#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1421#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:32,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {1420#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1421#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:32,699 INFO L290 TraceCheckUtils]: 6: Hoare triple {1420#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1420#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:32,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {1419#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1420#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:32,700 INFO L290 TraceCheckUtils]: 4: Hoare triple {1419#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1419#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:32,700 INFO L290 TraceCheckUtils]: 3: Hoare triple {1435#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1419#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:32,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {1435#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1435#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:32,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {1416#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {1435#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:32,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {1416#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); {1416#true} is VALID [2022-02-21 03:36:32,702 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:32,702 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912698197] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:32,702 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:32,702 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2022-02-21 03:36:32,702 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135202658] [2022-02-21 03:36:32,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:32,745 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:32,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-21 03:36:32,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-02-21 03:36:32,753 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. cyclomatic complexity: 10 Second operand has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 20 states have internal predecessors, (46), 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-21 03:36:33,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:33,475 INFO L93 Difference]: Finished difference Result 141 states and 164 transitions. [2022-02-21 03:36:33,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-21 03:36:33,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 20 states have internal predecessors, (46), 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-21 03:36:33,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:33,517 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 164 transitions. [2022-02-21 03:36:33,520 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:36:33,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 88 states and 102 transitions. [2022-02-21 03:36:33,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2022-02-21 03:36:33,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2022-02-21 03:36:33,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 102 transitions. [2022-02-21 03:36:33,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:33,523 INFO L681 BuchiCegarLoop]: Abstraction has 88 states and 102 transitions. [2022-02-21 03:36:33,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 102 transitions. [2022-02-21 03:36:33,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 52. [2022-02-21 03:36:33,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:33,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states and 102 transitions. Second operand has 52 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 51 states have internal predecessors, (60), 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-21 03:36:33,526 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states and 102 transitions. Second operand has 52 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 51 states have internal predecessors, (60), 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-21 03:36:33,526 INFO L87 Difference]: Start difference. First operand 88 states and 102 transitions. Second operand has 52 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 51 states have internal predecessors, (60), 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-21 03:36:33,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:33,528 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2022-02-21 03:36:33,528 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2022-02-21 03:36:33,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:33,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:33,528 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 51 states have internal predecessors, (60), 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 88 states and 102 transitions. [2022-02-21 03:36:33,528 INFO L87 Difference]: Start difference. First operand has 52 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 51 states have internal predecessors, (60), 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 88 states and 102 transitions. [2022-02-21 03:36:33,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:33,530 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2022-02-21 03:36:33,530 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2022-02-21 03:36:33,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:33,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:33,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:33,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:33,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 51 states have internal predecessors, (60), 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-21 03:36:33,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-02-21 03:36:33,532 INFO L704 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-02-21 03:36:33,532 INFO L587 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-02-21 03:36:33,532 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:36:33,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 60 transitions. [2022-02-21 03:36:33,533 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:36:33,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:33,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:33,533 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 4, 1, 1, 1, 1] [2022-02-21 03:36:33,533 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:33,533 INFO L791 eck$LassoCheckResult]: Stem: 1733#ULTIMATE.startENTRY 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); 1734#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; 1739#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1753#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1754#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1742#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1743#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1764#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1763#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1762#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1761#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 1757#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1756#L27-3 assume !(main_~i~0#1 < main_~num~0#1); 1744#L27-4 main_~i~0#1 := 0; 1745#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 1777#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 1774#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1772#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 1773#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 1781#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1780#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 1750#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 1738#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1747#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 1752#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 1769#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1768#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 1759#L34 [2022-02-21 03:36:33,533 INFO L793 eck$LassoCheckResult]: Loop: 1759#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 1760#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1758#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 1759#L34 [2022-02-21 03:36:33,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:33,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1204484189, now seen corresponding path program 8 times [2022-02-21 03:36:33,534 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:33,534 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008500869] [2022-02-21 03:36:33,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:33,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:33,575 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:33,626 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:33,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:33,627 INFO L85 PathProgramCache]: Analyzing trace with hash 69557, now seen corresponding path program 6 times [2022-02-21 03:36:33,627 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:33,627 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221620847] [2022-02-21 03:36:33,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:33,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:33,638 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:33,642 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:33,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:33,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1663323347, now seen corresponding path program 9 times [2022-02-21 03:36:33,642 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:33,643 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471382532] [2022-02-21 03:36:33,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:33,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:33,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {1966#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); {1966#true} is VALID [2022-02-21 03:36:33,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {1966#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {1968#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:33,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {1968#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1968#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:33,799 INFO L290 TraceCheckUtils]: 3: Hoare triple {1968#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1969#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:33,799 INFO L290 TraceCheckUtils]: 4: Hoare triple {1969#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1969#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:33,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {1969#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1970#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:33,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {1970#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1970#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:33,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {1970#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1971#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:33,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {1971#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1971#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:33,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {1971#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1972#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:33,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {1972#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1972#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:33,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {1972#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1973#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:33,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {1973#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !(main_~i~0#1 < main_~num~0#1); {1974#(<= |ULTIMATE.start_main_~num~0#1| 5)} is VALID [2022-02-21 03:36:33,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {1974#(<= |ULTIMATE.start_main_~num~0#1| 5)} main_~i~0#1 := 0; {1975#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-21 03:36:33,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {1975#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (= |ULTIMATE.start_main_~i~0#1| 0))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1975#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-21 03:36:33,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {1975#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (= |ULTIMATE.start_main_~i~0#1| 0))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {1975#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (= |ULTIMATE.start_main_~i~0#1| 0))} is VALID [2022-02-21 03:36:33,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {1975#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (= |ULTIMATE.start_main_~i~0#1| 0))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1976#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:33,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {1976#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1976#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:33,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {1976#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {1976#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:33,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {1976#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1977#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:33,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {1977#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1977#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:33,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {1977#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {1977#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:33,812 INFO L290 TraceCheckUtils]: 22: Hoare triple {1977#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1978#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:33,813 INFO L290 TraceCheckUtils]: 23: Hoare triple {1978#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1978#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:33,813 INFO L290 TraceCheckUtils]: 24: Hoare triple {1978#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {1978#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:33,814 INFO L290 TraceCheckUtils]: 25: Hoare triple {1978#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1979#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:33,814 INFO L290 TraceCheckUtils]: 26: Hoare triple {1979#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1979#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:33,815 INFO L290 TraceCheckUtils]: 27: Hoare triple {1979#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {1979#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:33,816 INFO L290 TraceCheckUtils]: 28: Hoare triple {1979#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1980#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:36:33,816 INFO L290 TraceCheckUtils]: 29: Hoare triple {1980#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1967#false} is VALID [2022-02-21 03:36:33,817 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 22 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:33,817 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:33,817 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471382532] [2022-02-21 03:36:33,817 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471382532] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:33,817 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221035904] [2022-02-21 03:36:33,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:36:33,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:33,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:33,819 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:33,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-02-21 03:36:33,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-02-21 03:36:33,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:36:33,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 03:36:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:33,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:34,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {1966#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); {1966#true} is VALID [2022-02-21 03:36:34,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {1966#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {1987#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:34,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {1987#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1987#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:34,285 INFO L290 TraceCheckUtils]: 3: Hoare triple {1987#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1969#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:34,288 INFO L290 TraceCheckUtils]: 4: Hoare triple {1969#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1969#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:34,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {1969#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1970#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:34,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {1970#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1970#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:34,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {1970#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1971#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:34,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {1971#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1971#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:34,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {1971#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1972#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:34,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {1972#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1972#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:34,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {1972#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1973#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:34,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {1973#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !(main_~i~0#1 < main_~num~0#1); {1974#(<= |ULTIMATE.start_main_~num~0#1| 5)} is VALID [2022-02-21 03:36:34,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {1974#(<= |ULTIMATE.start_main_~num~0#1| 5)} main_~i~0#1 := 0; {2024#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:34,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {2024#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {2024#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:34,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {2024#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {2024#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:34,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {2024#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 0 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2034#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 1 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:34,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {2034#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 1 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {2034#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 1 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:34,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {2034#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 1 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {2034#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 1 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:34,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {2034#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 1 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2044#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:34,298 INFO L290 TraceCheckUtils]: 20: Hoare triple {2044#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {2044#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:34,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {2044#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {2044#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:34,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {2044#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2054#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:34,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {2054#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {2054#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:34,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {2054#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {2054#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:34,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {2054#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2064#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:34,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {2064#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 4 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {2064#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:34,303 INFO L290 TraceCheckUtils]: 27: Hoare triple {2064#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 4 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {2064#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:34,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {2064#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 4 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2074#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:34,305 INFO L290 TraceCheckUtils]: 29: Hoare triple {2074#(and (<= |ULTIMATE.start_main_~num~0#1| 5) (<= 5 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1967#false} is VALID [2022-02-21 03:36:34,305 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 35 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:34,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:34,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {1980#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1967#false} is VALID [2022-02-21 03:36:34,562 INFO L290 TraceCheckUtils]: 28: Hoare triple {1979#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1980#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:36:34,563 INFO L290 TraceCheckUtils]: 27: Hoare triple {1979#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {1979#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:34,563 INFO L290 TraceCheckUtils]: 26: Hoare triple {1979#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1979#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:34,564 INFO L290 TraceCheckUtils]: 25: Hoare triple {1978#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1979#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:34,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {1978#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {1978#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:34,564 INFO L290 TraceCheckUtils]: 23: Hoare triple {1978#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1978#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:34,565 INFO L290 TraceCheckUtils]: 22: Hoare triple {1977#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1978#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:34,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {1977#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {1977#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:34,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {1977#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1977#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:34,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {1976#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1977#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:34,567 INFO L290 TraceCheckUtils]: 18: Hoare triple {1976#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {1976#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:34,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {1976#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {1976#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:34,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {2117#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {1976#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:34,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {2117#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {2117#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:34,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {2117#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {2117#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:34,569 INFO L290 TraceCheckUtils]: 13: Hoare triple {1974#(<= |ULTIMATE.start_main_~num~0#1| 5)} main_~i~0#1 := 0; {2117#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:34,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {1973#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !(main_~i~0#1 < main_~num~0#1); {1974#(<= |ULTIMATE.start_main_~num~0#1| 5)} is VALID [2022-02-21 03:36:34,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {1972#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1973#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:34,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {1972#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1972#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:34,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {1971#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1972#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:34,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {1971#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1971#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:34,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {1970#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1971#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:34,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {1970#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1970#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:34,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {1969#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1970#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:34,574 INFO L290 TraceCheckUtils]: 4: Hoare triple {1969#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1969#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:34,575 INFO L290 TraceCheckUtils]: 3: Hoare triple {1987#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1969#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:34,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {1987#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {1987#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:34,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {1966#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {1987#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:34,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {1966#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); {1966#true} is VALID [2022-02-21 03:36:34,576 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 35 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:34,576 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221035904] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:34,576 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:34,577 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 22 [2022-02-21 03:36:34,577 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341216402] [2022-02-21 03:36:34,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:34,633 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:34,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-21 03:36:34,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2022-02-21 03:36:34,634 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. cyclomatic complexity: 11 Second operand has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 23 states have internal predecessors, (54), 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-21 03:36:35,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:35,415 INFO L93 Difference]: Finished difference Result 167 states and 194 transitions. [2022-02-21 03:36:35,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-21 03:36:35,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 23 states have internal predecessors, (54), 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-21 03:36:35,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:35,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 194 transitions. [2022-02-21 03:36:35,477 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:36:35,479 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 102 states and 118 transitions. [2022-02-21 03:36:35,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2022-02-21 03:36:35,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2022-02-21 03:36:35,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 118 transitions. [2022-02-21 03:36:35,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:35,480 INFO L681 BuchiCegarLoop]: Abstraction has 102 states and 118 transitions. [2022-02-21 03:36:35,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 118 transitions. [2022-02-21 03:36:35,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 60. [2022-02-21 03:36:35,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:35,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states and 118 transitions. Second operand has 60 states, 60 states have (on average 1.15) internal successors, (69), 59 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-21 03:36:35,482 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states and 118 transitions. Second operand has 60 states, 60 states have (on average 1.15) internal successors, (69), 59 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-21 03:36:35,483 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand has 60 states, 60 states have (on average 1.15) internal successors, (69), 59 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-21 03:36:35,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:35,486 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2022-02-21 03:36:35,486 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2022-02-21 03:36:35,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:35,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:35,487 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 60 states have (on average 1.15) internal successors, (69), 59 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) Second operand 102 states and 118 transitions. [2022-02-21 03:36:35,487 INFO L87 Difference]: Start difference. First operand has 60 states, 60 states have (on average 1.15) internal successors, (69), 59 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) Second operand 102 states and 118 transitions. [2022-02-21 03:36:35,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:35,490 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2022-02-21 03:36:35,490 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2022-02-21 03:36:35,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:35,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:35,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:35,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:35,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.15) internal successors, (69), 59 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-21 03:36:35,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2022-02-21 03:36:35,492 INFO L704 BuchiCegarLoop]: Abstraction has 60 states and 69 transitions. [2022-02-21 03:36:35,492 INFO L587 BuchiCegarLoop]: Abstraction has 60 states and 69 transitions. [2022-02-21 03:36:35,492 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:36:35,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 69 transitions. [2022-02-21 03:36:35,493 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:36:35,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:35,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:35,493 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 5, 5, 1, 1, 1, 1] [2022-02-21 03:36:35,493 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:35,493 INFO L791 eck$LassoCheckResult]: Stem: 2344#ULTIMATE.startENTRY 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); 2345#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; 2350#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2364#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2365#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2353#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2354#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2377#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2376#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2375#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2374#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2373#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2372#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 2368#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 2367#L27-3 assume !(main_~i~0#1 < main_~num~0#1); 2355#L27-4 main_~i~0#1 := 0; 2356#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 2398#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 2387#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2385#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 2386#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 2390#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2396#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 2395#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 2394#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2393#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 2361#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 2349#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2358#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 2363#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 2382#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2381#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 2370#L34 [2022-02-21 03:36:35,494 INFO L793 eck$LassoCheckResult]: Loop: 2370#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 2371#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2369#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 2370#L34 [2022-02-21 03:36:35,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:35,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1715309995, now seen corresponding path program 10 times [2022-02-21 03:36:35,494 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:35,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581416877] [2022-02-21 03:36:35,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:35,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:35,534 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:35,559 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:35,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:35,560 INFO L85 PathProgramCache]: Analyzing trace with hash 69557, now seen corresponding path program 7 times [2022-02-21 03:36:35,560 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:35,560 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756649190] [2022-02-21 03:36:35,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:35,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:35,565 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:35,569 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:35,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:35,570 INFO L85 PathProgramCache]: Analyzing trace with hash 720866529, now seen corresponding path program 11 times [2022-02-21 03:36:35,570 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:35,570 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60014145] [2022-02-21 03:36:35,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:35,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:35,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:35,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {2613#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); {2613#true} is VALID [2022-02-21 03:36:35,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {2613#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {2615#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:35,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {2615#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2615#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:35,743 INFO L290 TraceCheckUtils]: 3: Hoare triple {2615#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2616#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:35,744 INFO L290 TraceCheckUtils]: 4: Hoare triple {2616#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2616#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:35,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {2616#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2617#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:35,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {2617#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2617#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:35,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {2617#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2618#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:35,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {2618#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2618#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:35,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {2618#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2619#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:35,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {2619#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2619#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:35,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {2619#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2620#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:35,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {2620#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2620#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:35,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {2620#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2621#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:35,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {2621#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !(main_~i~0#1 < main_~num~0#1); {2622#(<= |ULTIMATE.start_main_~num~0#1| 6)} is VALID [2022-02-21 03:36:35,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {2622#(<= |ULTIMATE.start_main_~num~0#1| 6)} main_~i~0#1 := 0; {2623#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 6))} is VALID [2022-02-21 03:36:35,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {2623#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 6))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {2623#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 6))} is VALID [2022-02-21 03:36:35,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {2623#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 6))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {2623#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 6))} is VALID [2022-02-21 03:36:35,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {2623#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 6))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2624#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:35,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {2624#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {2624#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:35,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {2624#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {2624#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:35,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {2624#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2625#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:35,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {2625#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {2625#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:35,750 INFO L290 TraceCheckUtils]: 23: Hoare triple {2625#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {2625#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:35,751 INFO L290 TraceCheckUtils]: 24: Hoare triple {2625#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2626#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:35,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {2626#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {2626#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:35,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {2626#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {2626#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:35,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {2626#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2627#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:35,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {2627#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {2627#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:35,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {2627#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {2627#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:35,755 INFO L290 TraceCheckUtils]: 30: Hoare triple {2627#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2628#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:35,756 INFO L290 TraceCheckUtils]: 31: Hoare triple {2628#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {2628#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:35,756 INFO L290 TraceCheckUtils]: 32: Hoare triple {2628#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {2628#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:35,757 INFO L290 TraceCheckUtils]: 33: Hoare triple {2628#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2629#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:36:35,757 INFO L290 TraceCheckUtils]: 34: Hoare triple {2629#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {2614#false} is VALID [2022-02-21 03:36:35,758 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 35 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:35,758 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:35,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60014145] [2022-02-21 03:36:35,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60014145] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:35,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929223598] [2022-02-21 03:36:35,758 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-21 03:36:35,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:35,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:35,762 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:35,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-02-21 03:36:35,853 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-02-21 03:36:35,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:36:35,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 03:36:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:35,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:36,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {2613#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); {2613#true} is VALID [2022-02-21 03:36:36,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {2613#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {2636#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:36,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {2636#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2636#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:36,355 INFO L290 TraceCheckUtils]: 3: Hoare triple {2636#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2616#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:36,355 INFO L290 TraceCheckUtils]: 4: Hoare triple {2616#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2616#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:36,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {2616#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2617#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:36,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {2617#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2617#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:36,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {2617#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2618#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:36,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {2618#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2618#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:36,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {2618#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2619#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:36,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {2619#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2619#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:36,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {2619#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2620#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:36,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {2620#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2620#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:36,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {2620#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2621#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:36,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {2621#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !(main_~i~0#1 < main_~num~0#1); {2622#(<= |ULTIMATE.start_main_~num~0#1| 6)} is VALID [2022-02-21 03:36:36,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {2622#(<= |ULTIMATE.start_main_~num~0#1| 6)} main_~i~0#1 := 0; {2679#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 6))} is VALID [2022-02-21 03:36:36,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {2679#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 6))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {2679#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 6))} is VALID [2022-02-21 03:36:36,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {2679#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 6))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {2679#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 6))} is VALID [2022-02-21 03:36:36,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {2679#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 6))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2689#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 6))} is VALID [2022-02-21 03:36:36,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {2689#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 6))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {2689#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 6))} is VALID [2022-02-21 03:36:36,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {2689#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 6))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {2689#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 6))} is VALID [2022-02-21 03:36:36,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {2689#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 6))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2699#(and (<= |ULTIMATE.start_main_~num~0#1| 6) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:36,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {2699#(and (<= |ULTIMATE.start_main_~num~0#1| 6) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {2699#(and (<= |ULTIMATE.start_main_~num~0#1| 6) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:36,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {2699#(and (<= |ULTIMATE.start_main_~num~0#1| 6) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {2699#(and (<= |ULTIMATE.start_main_~num~0#1| 6) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:36,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {2699#(and (<= |ULTIMATE.start_main_~num~0#1| 6) (<= 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2709#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 6))} is VALID [2022-02-21 03:36:36,365 INFO L290 TraceCheckUtils]: 25: Hoare triple {2709#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 6))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {2709#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 6))} is VALID [2022-02-21 03:36:36,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {2709#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 6))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {2709#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 6))} is VALID [2022-02-21 03:36:36,374 INFO L290 TraceCheckUtils]: 27: Hoare triple {2709#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 6))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2719#(and (<= |ULTIMATE.start_main_~num~0#1| 6) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:36,375 INFO L290 TraceCheckUtils]: 28: Hoare triple {2719#(and (<= |ULTIMATE.start_main_~num~0#1| 6) (<= 4 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {2719#(and (<= |ULTIMATE.start_main_~num~0#1| 6) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:36,375 INFO L290 TraceCheckUtils]: 29: Hoare triple {2719#(and (<= |ULTIMATE.start_main_~num~0#1| 6) (<= 4 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {2719#(and (<= |ULTIMATE.start_main_~num~0#1| 6) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:36,376 INFO L290 TraceCheckUtils]: 30: Hoare triple {2719#(and (<= |ULTIMATE.start_main_~num~0#1| 6) (<= 4 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2729#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 6))} is VALID [2022-02-21 03:36:36,376 INFO L290 TraceCheckUtils]: 31: Hoare triple {2729#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 6))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {2729#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 6))} is VALID [2022-02-21 03:36:36,377 INFO L290 TraceCheckUtils]: 32: Hoare triple {2729#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 6))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {2729#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 6))} is VALID [2022-02-21 03:36:36,377 INFO L290 TraceCheckUtils]: 33: Hoare triple {2729#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 6))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2739#(and (<= |ULTIMATE.start_main_~num~0#1| 6) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:36,378 INFO L290 TraceCheckUtils]: 34: Hoare triple {2739#(and (<= |ULTIMATE.start_main_~num~0#1| 6) (<= 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {2614#false} is VALID [2022-02-21 03:36:36,378 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 51 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:36,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:36,634 INFO L290 TraceCheckUtils]: 34: Hoare triple {2629#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {2614#false} is VALID [2022-02-21 03:36:36,634 INFO L290 TraceCheckUtils]: 33: Hoare triple {2628#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2629#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:36:36,635 INFO L290 TraceCheckUtils]: 32: Hoare triple {2628#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {2628#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:36,635 INFO L290 TraceCheckUtils]: 31: Hoare triple {2628#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {2628#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:36,635 INFO L290 TraceCheckUtils]: 30: Hoare triple {2627#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2628#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:36,636 INFO L290 TraceCheckUtils]: 29: Hoare triple {2627#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {2627#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:36,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {2627#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {2627#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:36,636 INFO L290 TraceCheckUtils]: 27: Hoare triple {2626#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2627#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:36,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {2626#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {2626#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:36,637 INFO L290 TraceCheckUtils]: 25: Hoare triple {2626#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {2626#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:36,637 INFO L290 TraceCheckUtils]: 24: Hoare triple {2625#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2626#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:36,638 INFO L290 TraceCheckUtils]: 23: Hoare triple {2625#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {2625#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:36,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {2625#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {2625#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:36,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {2624#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2625#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:36,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {2624#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {2624#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:36,639 INFO L290 TraceCheckUtils]: 19: Hoare triple {2624#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {2624#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:36,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {2791#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {2624#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:36,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {2791#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {2791#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:36,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {2791#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {2791#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:36,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {2622#(<= |ULTIMATE.start_main_~num~0#1| 6)} main_~i~0#1 := 0; {2791#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:36,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {2621#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !(main_~i~0#1 < main_~num~0#1); {2622#(<= |ULTIMATE.start_main_~num~0#1| 6)} is VALID [2022-02-21 03:36:36,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {2620#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2621#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:36,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {2620#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2620#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:36,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {2619#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2620#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:36,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {2619#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2619#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:36,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {2618#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2619#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:36,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {2618#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2618#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:36,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {2617#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2618#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:36,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {2617#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2617#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:36,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {2616#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2617#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:36,647 INFO L290 TraceCheckUtils]: 4: Hoare triple {2616#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2616#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:36,647 INFO L290 TraceCheckUtils]: 3: Hoare triple {2636#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2616#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:36,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {2636#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {2636#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:36,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {2613#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {2636#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:36,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {2613#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); {2613#true} is VALID [2022-02-21 03:36:36,648 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 51 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:36,648 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929223598] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:36,649 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:36,649 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 25 [2022-02-21 03:36:36,649 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990770071] [2022-02-21 03:36:36,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:36,699 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:36,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-21 03:36:36,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2022-02-21 03:36:36,700 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. cyclomatic complexity: 12 Second operand has 26 states, 25 states have (on average 2.48) internal successors, (62), 26 states have internal predecessors, (62), 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-21 03:36:37,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:37,528 INFO L93 Difference]: Finished difference Result 193 states and 224 transitions. [2022-02-21 03:36:37,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-21 03:36:37,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 26 states, 25 states have (on average 2.48) internal successors, (62), 26 states have internal predecessors, (62), 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-21 03:36:37,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:37,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 193 states and 224 transitions. [2022-02-21 03:36:37,601 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:36:37,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 193 states to 116 states and 134 transitions. [2022-02-21 03:36:37,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2022-02-21 03:36:37,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2022-02-21 03:36:37,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 134 transitions. [2022-02-21 03:36:37,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:37,604 INFO L681 BuchiCegarLoop]: Abstraction has 116 states and 134 transitions. [2022-02-21 03:36:37,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 134 transitions. [2022-02-21 03:36:37,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 68. [2022-02-21 03:36:37,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:37,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states and 134 transitions. Second operand has 68 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 67 states have internal predecessors, (78), 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-21 03:36:37,607 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states and 134 transitions. Second operand has 68 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 67 states have internal predecessors, (78), 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-21 03:36:37,607 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand has 68 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 67 states have internal predecessors, (78), 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-21 03:36:37,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:37,609 INFO L93 Difference]: Finished difference Result 116 states and 134 transitions. [2022-02-21 03:36:37,609 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2022-02-21 03:36:37,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:37,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:37,609 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 67 states have internal predecessors, (78), 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 116 states and 134 transitions. [2022-02-21 03:36:37,610 INFO L87 Difference]: Start difference. First operand has 68 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 67 states have internal predecessors, (78), 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 116 states and 134 transitions. [2022-02-21 03:36:37,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:37,611 INFO L93 Difference]: Finished difference Result 116 states and 134 transitions. [2022-02-21 03:36:37,611 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2022-02-21 03:36:37,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:37,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:37,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:37,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:37,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 67 states have internal predecessors, (78), 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-21 03:36:37,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2022-02-21 03:36:37,615 INFO L704 BuchiCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-02-21 03:36:37,615 INFO L587 BuchiCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-02-21 03:36:37,615 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 03:36:37,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 78 transitions. [2022-02-21 03:36:37,616 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:36:37,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:37,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:37,616 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 7, 6, 6, 1, 1, 1, 1] [2022-02-21 03:36:37,617 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:37,617 INFO L791 eck$LassoCheckResult]: Stem: 3052#ULTIMATE.startENTRY 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); 3053#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; 3058#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 3073#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 3074#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 3061#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 3062#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 3088#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 3087#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 3086#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 3085#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 3084#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 3083#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 3082#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 3081#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 3077#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 3076#L27-3 assume !(main_~i~0#1 < main_~num~0#1); 3063#L27-4 main_~i~0#1 := 0; 3064#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 3096#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 3097#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3098#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 3102#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 3101#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3114#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 3111#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 3109#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3108#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 3106#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 3105#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3104#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 3070#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 3057#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3067#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 3072#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 3093#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3092#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 3079#L34 [2022-02-21 03:36:37,617 INFO L793 eck$LassoCheckResult]: Loop: 3079#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 3080#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3078#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 3079#L34 [2022-02-21 03:36:37,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:37,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1748928671, now seen corresponding path program 12 times [2022-02-21 03:36:37,618 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:37,618 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907351621] [2022-02-21 03:36:37,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:37,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:37,660 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:37,708 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:37,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:37,711 INFO L85 PathProgramCache]: Analyzing trace with hash 69557, now seen corresponding path program 8 times [2022-02-21 03:36:37,711 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:37,711 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633951394] [2022-02-21 03:36:37,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:37,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:37,716 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:37,721 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:37,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:37,721 INFO L85 PathProgramCache]: Analyzing trace with hash 85809751, now seen corresponding path program 13 times [2022-02-21 03:36:37,722 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:37,722 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68422791] [2022-02-21 03:36:37,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:37,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:37,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {3357#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); {3357#true} is VALID [2022-02-21 03:36:37,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {3357#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {3359#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:37,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {3359#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {3359#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:37,943 INFO L290 TraceCheckUtils]: 3: Hoare triple {3359#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:37,944 INFO L290 TraceCheckUtils]: 4: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:37,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3361#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:37,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {3361#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {3361#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:37,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {3361#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3362#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:37,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {3362#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {3362#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:37,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {3362#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3363#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:37,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {3363#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {3363#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:37,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {3363#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3364#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:37,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {3364#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {3364#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:37,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {3364#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3365#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:37,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {3365#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {3365#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:37,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {3365#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3366#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:37,949 INFO L290 TraceCheckUtils]: 16: Hoare triple {3366#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !(main_~i~0#1 < main_~num~0#1); {3367#(<= |ULTIMATE.start_main_~num~0#1| 7)} is VALID [2022-02-21 03:36:37,949 INFO L290 TraceCheckUtils]: 17: Hoare triple {3367#(<= |ULTIMATE.start_main_~num~0#1| 7)} main_~i~0#1 := 0; {3368#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 7))} is VALID [2022-02-21 03:36:37,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {3368#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 7))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {3368#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 7))} is VALID [2022-02-21 03:36:37,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {3368#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 7))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {3368#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 7))} is VALID [2022-02-21 03:36:37,951 INFO L290 TraceCheckUtils]: 20: Hoare triple {3368#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 7))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3369#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:37,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {3369#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {3369#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:37,951 INFO L290 TraceCheckUtils]: 22: Hoare triple {3369#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {3369#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:37,952 INFO L290 TraceCheckUtils]: 23: Hoare triple {3369#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3370#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:37,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {3370#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {3370#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:37,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {3370#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {3370#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:37,953 INFO L290 TraceCheckUtils]: 26: Hoare triple {3370#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3371#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:37,953 INFO L290 TraceCheckUtils]: 27: Hoare triple {3371#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {3371#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:37,954 INFO L290 TraceCheckUtils]: 28: Hoare triple {3371#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {3371#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:37,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {3371#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3372#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:37,954 INFO L290 TraceCheckUtils]: 30: Hoare triple {3372#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {3372#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:37,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {3372#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {3372#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:37,955 INFO L290 TraceCheckUtils]: 32: Hoare triple {3372#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3373#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:37,956 INFO L290 TraceCheckUtils]: 33: Hoare triple {3373#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {3373#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:37,956 INFO L290 TraceCheckUtils]: 34: Hoare triple {3373#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {3373#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:37,957 INFO L290 TraceCheckUtils]: 35: Hoare triple {3373#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3374#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:37,957 INFO L290 TraceCheckUtils]: 36: Hoare triple {3374#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {3374#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:37,957 INFO L290 TraceCheckUtils]: 37: Hoare triple {3374#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {3374#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:37,958 INFO L290 TraceCheckUtils]: 38: Hoare triple {3374#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3375#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:36:37,958 INFO L290 TraceCheckUtils]: 39: Hoare triple {3375#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {3358#false} is VALID [2022-02-21 03:36:37,958 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 51 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:37,959 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:37,959 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68422791] [2022-02-21 03:36:37,959 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68422791] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:37,959 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693321838] [2022-02-21 03:36:37,959 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-21 03:36:37,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:37,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:37,976 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:37,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-02-21 03:36:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:38,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-21 03:36:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:38,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:38,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {3357#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); {3357#true} is VALID [2022-02-21 03:36:38,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {3357#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {3382#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:38,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {3382#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {3382#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:38,591 INFO L290 TraceCheckUtils]: 3: Hoare triple {3382#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:38,591 INFO L290 TraceCheckUtils]: 4: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:38,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3361#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:38,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {3361#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {3361#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:38,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {3361#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3362#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:38,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {3362#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {3362#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:38,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {3362#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3363#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:38,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {3363#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {3363#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:38,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {3363#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3364#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:38,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {3364#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {3364#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:38,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {3364#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3365#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:38,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {3365#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {3365#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:38,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {3365#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3366#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:38,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {3366#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !(main_~i~0#1 < main_~num~0#1); {3367#(<= |ULTIMATE.start_main_~num~0#1| 7)} is VALID [2022-02-21 03:36:38,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {3367#(<= |ULTIMATE.start_main_~num~0#1| 7)} main_~i~0#1 := 0; {3431#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} is VALID [2022-02-21 03:36:38,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {3431#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {3431#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} is VALID [2022-02-21 03:36:38,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {3431#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {3431#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} is VALID [2022-02-21 03:36:38,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {3431#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3441#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} is VALID [2022-02-21 03:36:38,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {3441#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {3441#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} is VALID [2022-02-21 03:36:38,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {3441#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {3441#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} is VALID [2022-02-21 03:36:38,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {3441#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3451#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} is VALID [2022-02-21 03:36:38,599 INFO L290 TraceCheckUtils]: 24: Hoare triple {3451#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {3451#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} is VALID [2022-02-21 03:36:38,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {3451#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {3451#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} is VALID [2022-02-21 03:36:38,599 INFO L290 TraceCheckUtils]: 26: Hoare triple {3451#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3461#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} is VALID [2022-02-21 03:36:38,600 INFO L290 TraceCheckUtils]: 27: Hoare triple {3461#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {3461#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} is VALID [2022-02-21 03:36:38,600 INFO L290 TraceCheckUtils]: 28: Hoare triple {3461#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {3461#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} is VALID [2022-02-21 03:36:38,601 INFO L290 TraceCheckUtils]: 29: Hoare triple {3461#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3471#(and (<= |ULTIMATE.start_main_~num~0#1| 7) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:38,601 INFO L290 TraceCheckUtils]: 30: Hoare triple {3471#(and (<= |ULTIMATE.start_main_~num~0#1| 7) (<= 4 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {3471#(and (<= |ULTIMATE.start_main_~num~0#1| 7) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:38,602 INFO L290 TraceCheckUtils]: 31: Hoare triple {3471#(and (<= |ULTIMATE.start_main_~num~0#1| 7) (<= 4 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {3471#(and (<= |ULTIMATE.start_main_~num~0#1| 7) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:38,602 INFO L290 TraceCheckUtils]: 32: Hoare triple {3471#(and (<= |ULTIMATE.start_main_~num~0#1| 7) (<= 4 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3481#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} is VALID [2022-02-21 03:36:38,602 INFO L290 TraceCheckUtils]: 33: Hoare triple {3481#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {3481#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} is VALID [2022-02-21 03:36:38,603 INFO L290 TraceCheckUtils]: 34: Hoare triple {3481#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {3481#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} is VALID [2022-02-21 03:36:38,603 INFO L290 TraceCheckUtils]: 35: Hoare triple {3481#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3491#(and (<= |ULTIMATE.start_main_~num~0#1| 7) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:38,604 INFO L290 TraceCheckUtils]: 36: Hoare triple {3491#(and (<= |ULTIMATE.start_main_~num~0#1| 7) (<= 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {3491#(and (<= |ULTIMATE.start_main_~num~0#1| 7) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:38,604 INFO L290 TraceCheckUtils]: 37: Hoare triple {3491#(and (<= |ULTIMATE.start_main_~num~0#1| 7) (<= 6 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {3491#(and (<= |ULTIMATE.start_main_~num~0#1| 7) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:38,605 INFO L290 TraceCheckUtils]: 38: Hoare triple {3491#(and (<= |ULTIMATE.start_main_~num~0#1| 7) (<= 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3501#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} is VALID [2022-02-21 03:36:38,605 INFO L290 TraceCheckUtils]: 39: Hoare triple {3501#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 7))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {3358#false} is VALID [2022-02-21 03:36:38,605 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 70 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:38,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:38,946 INFO L290 TraceCheckUtils]: 39: Hoare triple {3375#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {3358#false} is VALID [2022-02-21 03:36:38,946 INFO L290 TraceCheckUtils]: 38: Hoare triple {3374#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3375#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:36:38,947 INFO L290 TraceCheckUtils]: 37: Hoare triple {3374#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {3374#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:38,947 INFO L290 TraceCheckUtils]: 36: Hoare triple {3374#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {3374#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:38,947 INFO L290 TraceCheckUtils]: 35: Hoare triple {3373#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3374#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:38,950 INFO L290 TraceCheckUtils]: 34: Hoare triple {3373#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {3373#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:38,950 INFO L290 TraceCheckUtils]: 33: Hoare triple {3373#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {3373#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:38,950 INFO L290 TraceCheckUtils]: 32: Hoare triple {3372#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3373#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:38,951 INFO L290 TraceCheckUtils]: 31: Hoare triple {3372#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {3372#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:38,955 INFO L290 TraceCheckUtils]: 30: Hoare triple {3372#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {3372#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:38,956 INFO L290 TraceCheckUtils]: 29: Hoare triple {3371#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3372#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:38,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {3371#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {3371#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:38,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {3371#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {3371#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:38,957 INFO L290 TraceCheckUtils]: 26: Hoare triple {3370#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3371#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:38,959 INFO L290 TraceCheckUtils]: 25: Hoare triple {3370#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {3370#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:38,959 INFO L290 TraceCheckUtils]: 24: Hoare triple {3370#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {3370#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:38,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {3369#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3370#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:38,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {3369#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {3369#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:38,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {3369#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {3369#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:38,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {3562#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {3369#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:38,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {3562#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {3562#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:38,962 INFO L290 TraceCheckUtils]: 18: Hoare triple {3562#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {3562#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:38,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {3367#(<= |ULTIMATE.start_main_~num~0#1| 7)} main_~i~0#1 := 0; {3562#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:38,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {3366#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !(main_~i~0#1 < main_~num~0#1); {3367#(<= |ULTIMATE.start_main_~num~0#1| 7)} is VALID [2022-02-21 03:36:38,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {3365#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3366#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:38,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {3365#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {3365#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:38,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {3364#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3365#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:38,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {3364#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {3364#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:38,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {3363#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3364#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:38,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {3363#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {3363#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:38,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {3362#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3363#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:38,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {3362#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {3362#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:38,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {3361#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3362#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:38,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {3361#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {3361#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:38,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3361#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:38,968 INFO L290 TraceCheckUtils]: 4: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:38,969 INFO L290 TraceCheckUtils]: 3: Hoare triple {3382#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {3360#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:38,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {3382#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {3382#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:38,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {3357#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {3382#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:38,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {3357#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); {3357#true} is VALID [2022-02-21 03:36:38,970 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 70 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:38,970 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693321838] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:38,970 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:38,971 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 28 [2022-02-21 03:36:38,971 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549196823] [2022-02-21 03:36:38,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:39,019 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:39,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-02-21 03:36:39,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2022-02-21 03:36:39,021 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. cyclomatic complexity: 13 Second operand has 29 states, 28 states have (on average 2.5) internal successors, (70), 29 states have internal predecessors, (70), 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-21 03:36:40,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:40,188 INFO L93 Difference]: Finished difference Result 219 states and 254 transitions. [2022-02-21 03:36:40,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-21 03:36:40,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 29 states, 28 states have (on average 2.5) internal successors, (70), 29 states have internal predecessors, (70), 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-21 03:36:40,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:40,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 219 states and 254 transitions. [2022-02-21 03:36:40,248 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:36:40,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 219 states to 130 states and 150 transitions. [2022-02-21 03:36:40,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2022-02-21 03:36:40,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2022-02-21 03:36:40,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 130 states and 150 transitions. [2022-02-21 03:36:40,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:40,250 INFO L681 BuchiCegarLoop]: Abstraction has 130 states and 150 transitions. [2022-02-21 03:36:40,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states and 150 transitions. [2022-02-21 03:36:40,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 76. [2022-02-21 03:36:40,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:40,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states and 150 transitions. Second operand has 76 states, 76 states have (on average 1.144736842105263) internal successors, (87), 75 states have internal predecessors, (87), 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-21 03:36:40,253 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states and 150 transitions. Second operand has 76 states, 76 states have (on average 1.144736842105263) internal successors, (87), 75 states have internal predecessors, (87), 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-21 03:36:40,253 INFO L87 Difference]: Start difference. First operand 130 states and 150 transitions. Second operand has 76 states, 76 states have (on average 1.144736842105263) internal successors, (87), 75 states have internal predecessors, (87), 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-21 03:36:40,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:40,255 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2022-02-21 03:36:40,255 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2022-02-21 03:36:40,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:40,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:40,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 76 states have (on average 1.144736842105263) internal successors, (87), 75 states have internal predecessors, (87), 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 130 states and 150 transitions. [2022-02-21 03:36:40,256 INFO L87 Difference]: Start difference. First operand has 76 states, 76 states have (on average 1.144736842105263) internal successors, (87), 75 states have internal predecessors, (87), 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 130 states and 150 transitions. [2022-02-21 03:36:40,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:40,258 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2022-02-21 03:36:40,258 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2022-02-21 03:36:40,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:40,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:40,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:40,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:40,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.144736842105263) internal successors, (87), 75 states have internal predecessors, (87), 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-21 03:36:40,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2022-02-21 03:36:40,260 INFO L704 BuchiCegarLoop]: Abstraction has 76 states and 87 transitions. [2022-02-21 03:36:40,260 INFO L587 BuchiCegarLoop]: Abstraction has 76 states and 87 transitions. [2022-02-21 03:36:40,260 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2022-02-21 03:36:40,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 87 transitions. [2022-02-21 03:36:40,261 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:36:40,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:40,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:40,261 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 8, 7, 7, 1, 1, 1, 1] [2022-02-21 03:36:40,262 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:40,262 INFO L791 eck$LassoCheckResult]: Stem: 3857#ULTIMATE.startENTRY 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); 3858#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; 3863#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 3877#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 3878#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 3866#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 3867#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 3894#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 3893#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 3892#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 3891#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 3890#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 3889#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 3888#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 3887#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 3886#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 3885#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 3881#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 3880#L27-3 assume !(main_~i~0#1 < main_~num~0#1); 3868#L27-4 main_~i~0#1 := 0; 3869#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 3928#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 3904#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3902#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 3903#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 3907#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3927#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 3924#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 3922#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3921#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 3918#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 3916#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3915#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 3913#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 3911#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3910#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 3874#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 3862#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3871#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 3876#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 3899#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3898#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 3883#L34 [2022-02-21 03:36:40,262 INFO L793 eck$LassoCheckResult]: Loop: 3883#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 3884#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 3882#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 3883#L34 [2022-02-21 03:36:40,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:40,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1204550311, now seen corresponding path program 14 times [2022-02-21 03:36:40,263 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:40,263 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633472388] [2022-02-21 03:36:40,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:40,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:40,332 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:40,375 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:40,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:40,376 INFO L85 PathProgramCache]: Analyzing trace with hash 69557, now seen corresponding path program 9 times [2022-02-21 03:36:40,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:40,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114489555] [2022-02-21 03:36:40,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:40,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:40,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:40,381 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:40,384 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:40,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:40,385 INFO L85 PathProgramCache]: Analyzing trace with hash -306517155, now seen corresponding path program 15 times [2022-02-21 03:36:40,385 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:40,385 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183383683] [2022-02-21 03:36:40,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:40,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:40,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {4198#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); {4198#true} is VALID [2022-02-21 03:36:40,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {4198#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {4200#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:40,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {4200#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {4200#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:40,596 INFO L290 TraceCheckUtils]: 3: Hoare triple {4200#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4201#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:40,596 INFO L290 TraceCheckUtils]: 4: Hoare triple {4201#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {4201#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:40,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {4201#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4202#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:40,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {4202#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {4202#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:40,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {4202#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4203#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:40,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {4203#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {4203#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:40,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {4203#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4204#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:40,598 INFO L290 TraceCheckUtils]: 10: Hoare triple {4204#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {4204#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:40,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {4204#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4205#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:40,599 INFO L290 TraceCheckUtils]: 12: Hoare triple {4205#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {4205#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:40,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {4205#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4206#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:40,600 INFO L290 TraceCheckUtils]: 14: Hoare triple {4206#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {4206#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:40,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {4206#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4207#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:40,600 INFO L290 TraceCheckUtils]: 16: Hoare triple {4207#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {4207#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:40,601 INFO L290 TraceCheckUtils]: 17: Hoare triple {4207#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4208#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:40,601 INFO L290 TraceCheckUtils]: 18: Hoare triple {4208#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !(main_~i~0#1 < main_~num~0#1); {4209#(<= |ULTIMATE.start_main_~num~0#1| 8)} is VALID [2022-02-21 03:36:40,601 INFO L290 TraceCheckUtils]: 19: Hoare triple {4209#(<= |ULTIMATE.start_main_~num~0#1| 8)} main_~i~0#1 := 0; {4210#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 8))} is VALID [2022-02-21 03:36:40,602 INFO L290 TraceCheckUtils]: 20: Hoare triple {4210#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 8))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {4210#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 8))} is VALID [2022-02-21 03:36:40,602 INFO L290 TraceCheckUtils]: 21: Hoare triple {4210#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 8))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {4210#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 8))} is VALID [2022-02-21 03:36:40,603 INFO L290 TraceCheckUtils]: 22: Hoare triple {4210#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 8))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4211#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:40,603 INFO L290 TraceCheckUtils]: 23: Hoare triple {4211#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {4211#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:40,603 INFO L290 TraceCheckUtils]: 24: Hoare triple {4211#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {4211#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:40,604 INFO L290 TraceCheckUtils]: 25: Hoare triple {4211#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4212#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:40,604 INFO L290 TraceCheckUtils]: 26: Hoare triple {4212#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {4212#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:40,604 INFO L290 TraceCheckUtils]: 27: Hoare triple {4212#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {4212#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:40,604 INFO L290 TraceCheckUtils]: 28: Hoare triple {4212#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4213#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:40,605 INFO L290 TraceCheckUtils]: 29: Hoare triple {4213#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {4213#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:40,605 INFO L290 TraceCheckUtils]: 30: Hoare triple {4213#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {4213#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:40,605 INFO L290 TraceCheckUtils]: 31: Hoare triple {4213#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4214#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:40,606 INFO L290 TraceCheckUtils]: 32: Hoare triple {4214#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {4214#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:40,606 INFO L290 TraceCheckUtils]: 33: Hoare triple {4214#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {4214#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:40,606 INFO L290 TraceCheckUtils]: 34: Hoare triple {4214#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4215#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:40,607 INFO L290 TraceCheckUtils]: 35: Hoare triple {4215#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {4215#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:40,607 INFO L290 TraceCheckUtils]: 36: Hoare triple {4215#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {4215#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:40,607 INFO L290 TraceCheckUtils]: 37: Hoare triple {4215#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4216#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:40,608 INFO L290 TraceCheckUtils]: 38: Hoare triple {4216#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {4216#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:40,608 INFO L290 TraceCheckUtils]: 39: Hoare triple {4216#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {4216#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:40,608 INFO L290 TraceCheckUtils]: 40: Hoare triple {4216#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4217#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:40,611 INFO L290 TraceCheckUtils]: 41: Hoare triple {4217#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {4217#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:40,612 INFO L290 TraceCheckUtils]: 42: Hoare triple {4217#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {4217#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:40,612 INFO L290 TraceCheckUtils]: 43: Hoare triple {4217#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4218#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:36:40,613 INFO L290 TraceCheckUtils]: 44: Hoare triple {4218#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {4199#false} is VALID [2022-02-21 03:36:40,613 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 70 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:40,614 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:40,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183383683] [2022-02-21 03:36:40,614 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183383683] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:40,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173509567] [2022-02-21 03:36:40,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:36:40,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:40,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:40,620 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:40,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-02-21 03:36:40,755 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-02-21 03:36:40,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:36:40,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-21 03:36:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:40,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:41,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {4198#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); {4198#true} is VALID [2022-02-21 03:36:41,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {4198#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {4225#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:41,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {4225#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {4225#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:41,335 INFO L290 TraceCheckUtils]: 3: Hoare triple {4225#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4201#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:41,336 INFO L290 TraceCheckUtils]: 4: Hoare triple {4201#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {4201#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:41,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {4201#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4202#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:41,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {4202#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {4202#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:41,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {4202#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4203#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:41,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {4203#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {4203#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:41,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {4203#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4204#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:41,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {4204#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {4204#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:41,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {4204#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4205#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:41,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {4205#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {4205#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:41,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {4205#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4206#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:41,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {4206#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {4206#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:41,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {4206#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4207#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:41,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {4207#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {4207#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:41,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {4207#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4208#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:41,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {4208#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !(main_~i~0#1 < main_~num~0#1); {4209#(<= |ULTIMATE.start_main_~num~0#1| 8)} is VALID [2022-02-21 03:36:41,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {4209#(<= |ULTIMATE.start_main_~num~0#1| 8)} main_~i~0#1 := 0; {4280#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,343 INFO L290 TraceCheckUtils]: 20: Hoare triple {4280#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {4280#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,344 INFO L290 TraceCheckUtils]: 21: Hoare triple {4280#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {4280#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {4280#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 0 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4290#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 8))} is VALID [2022-02-21 03:36:41,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {4290#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 8))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {4290#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 8))} is VALID [2022-02-21 03:36:41,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {4290#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 8))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {4290#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 8))} is VALID [2022-02-21 03:36:41,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {4290#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 8))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4300#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {4300#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {4300#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {4300#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {4300#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,346 INFO L290 TraceCheckUtils]: 28: Hoare triple {4300#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4310#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,347 INFO L290 TraceCheckUtils]: 29: Hoare triple {4310#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {4310#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,347 INFO L290 TraceCheckUtils]: 30: Hoare triple {4310#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {4310#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,348 INFO L290 TraceCheckUtils]: 31: Hoare triple {4310#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4320#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,348 INFO L290 TraceCheckUtils]: 32: Hoare triple {4320#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 4 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {4320#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,349 INFO L290 TraceCheckUtils]: 33: Hoare triple {4320#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 4 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {4320#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,349 INFO L290 TraceCheckUtils]: 34: Hoare triple {4320#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 4 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4330#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,349 INFO L290 TraceCheckUtils]: 35: Hoare triple {4330#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 5 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {4330#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,350 INFO L290 TraceCheckUtils]: 36: Hoare triple {4330#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 5 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {4330#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,350 INFO L290 TraceCheckUtils]: 37: Hoare triple {4330#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 5 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4340#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,351 INFO L290 TraceCheckUtils]: 38: Hoare triple {4340#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {4340#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,351 INFO L290 TraceCheckUtils]: 39: Hoare triple {4340#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 6 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {4340#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,351 INFO L290 TraceCheckUtils]: 40: Hoare triple {4340#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4350#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 8))} is VALID [2022-02-21 03:36:41,352 INFO L290 TraceCheckUtils]: 41: Hoare triple {4350#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 8))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {4350#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 8))} is VALID [2022-02-21 03:36:41,352 INFO L290 TraceCheckUtils]: 42: Hoare triple {4350#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 8))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {4350#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 8))} is VALID [2022-02-21 03:36:41,353 INFO L290 TraceCheckUtils]: 43: Hoare triple {4350#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 8))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4360#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 8 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,353 INFO L290 TraceCheckUtils]: 44: Hoare triple {4360#(and (<= |ULTIMATE.start_main_~num~0#1| 8) (<= 8 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {4199#false} is VALID [2022-02-21 03:36:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 92 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:41,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:41,676 INFO L290 TraceCheckUtils]: 44: Hoare triple {4218#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {4199#false} is VALID [2022-02-21 03:36:41,676 INFO L290 TraceCheckUtils]: 43: Hoare triple {4217#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4218#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:36:41,683 INFO L290 TraceCheckUtils]: 42: Hoare triple {4217#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {4217#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:41,684 INFO L290 TraceCheckUtils]: 41: Hoare triple {4217#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {4217#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:41,684 INFO L290 TraceCheckUtils]: 40: Hoare triple {4216#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4217#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:41,685 INFO L290 TraceCheckUtils]: 39: Hoare triple {4216#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {4216#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,685 INFO L290 TraceCheckUtils]: 38: Hoare triple {4216#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {4216#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,685 INFO L290 TraceCheckUtils]: 37: Hoare triple {4215#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4216#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,686 INFO L290 TraceCheckUtils]: 36: Hoare triple {4215#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {4215#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,686 INFO L290 TraceCheckUtils]: 35: Hoare triple {4215#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {4215#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,687 INFO L290 TraceCheckUtils]: 34: Hoare triple {4214#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4215#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,687 INFO L290 TraceCheckUtils]: 33: Hoare triple {4214#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {4214#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:41,687 INFO L290 TraceCheckUtils]: 32: Hoare triple {4214#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {4214#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:41,688 INFO L290 TraceCheckUtils]: 31: Hoare triple {4213#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4214#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:41,688 INFO L290 TraceCheckUtils]: 30: Hoare triple {4213#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {4213#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,688 INFO L290 TraceCheckUtils]: 29: Hoare triple {4213#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {4213#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,689 INFO L290 TraceCheckUtils]: 28: Hoare triple {4212#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4213#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,689 INFO L290 TraceCheckUtils]: 27: Hoare triple {4212#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {4212#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,690 INFO L290 TraceCheckUtils]: 26: Hoare triple {4212#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {4212#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,690 INFO L290 TraceCheckUtils]: 25: Hoare triple {4211#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4212#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,690 INFO L290 TraceCheckUtils]: 24: Hoare triple {4211#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {4211#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,691 INFO L290 TraceCheckUtils]: 23: Hoare triple {4211#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {4211#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {4430#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {4211#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:41,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {4430#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {4430#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:41,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {4430#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {4430#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:41,692 INFO L290 TraceCheckUtils]: 19: Hoare triple {4209#(<= |ULTIMATE.start_main_~num~0#1| 8)} main_~i~0#1 := 0; {4430#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:41,692 INFO L290 TraceCheckUtils]: 18: Hoare triple {4208#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !(main_~i~0#1 < main_~num~0#1); {4209#(<= |ULTIMATE.start_main_~num~0#1| 8)} is VALID [2022-02-21 03:36:41,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {4207#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4208#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:41,693 INFO L290 TraceCheckUtils]: 16: Hoare triple {4207#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {4207#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:41,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {4206#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4207#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:41,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {4206#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {4206#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:41,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {4205#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4206#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:41,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {4205#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {4205#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:41,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {4204#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4205#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:41,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {4204#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {4204#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:41,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {4203#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4204#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:41,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {4203#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {4203#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:41,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {4202#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4203#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:41,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {4202#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {4202#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:41,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {4201#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4202#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:41,697 INFO L290 TraceCheckUtils]: 4: Hoare triple {4201#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {4201#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:41,697 INFO L290 TraceCheckUtils]: 3: Hoare triple {4225#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {4201#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:41,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {4225#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {4225#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:41,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {4198#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {4225#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:41,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {4198#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); {4198#true} is VALID [2022-02-21 03:36:41,699 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 92 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:41,699 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173509567] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:41,699 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:41,699 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 31 [2022-02-21 03:36:41,699 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502268857] [2022-02-21 03:36:41,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:41,741 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:41,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-02-21 03:36:41,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=747, Unknown=0, NotChecked=0, Total=992 [2022-02-21 03:36:41,743 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. cyclomatic complexity: 14 Second operand has 32 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 32 states have internal predecessors, (78), 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-21 03:36:43,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:43,112 INFO L93 Difference]: Finished difference Result 245 states and 284 transitions. [2022-02-21 03:36:43,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-02-21 03:36:43,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 32 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 32 states have internal predecessors, (78), 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-21 03:36:43,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:43,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 245 states and 284 transitions. [2022-02-21 03:36:43,188 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:36:43,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 245 states to 144 states and 166 transitions. [2022-02-21 03:36:43,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2022-02-21 03:36:43,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2022-02-21 03:36:43,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 166 transitions. [2022-02-21 03:36:43,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:43,191 INFO L681 BuchiCegarLoop]: Abstraction has 144 states and 166 transitions. [2022-02-21 03:36:43,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 166 transitions. [2022-02-21 03:36:43,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 84. [2022-02-21 03:36:43,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:43,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states and 166 transitions. Second operand has 84 states, 84 states have (on average 1.1428571428571428) internal successors, (96), 83 states have internal predecessors, (96), 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-21 03:36:43,194 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states and 166 transitions. Second operand has 84 states, 84 states have (on average 1.1428571428571428) internal successors, (96), 83 states have internal predecessors, (96), 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-21 03:36:43,194 INFO L87 Difference]: Start difference. First operand 144 states and 166 transitions. Second operand has 84 states, 84 states have (on average 1.1428571428571428) internal successors, (96), 83 states have internal predecessors, (96), 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-21 03:36:43,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:43,196 INFO L93 Difference]: Finished difference Result 144 states and 166 transitions. [2022-02-21 03:36:43,196 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 166 transitions. [2022-02-21 03:36:43,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:43,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:43,196 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 84 states have (on average 1.1428571428571428) internal successors, (96), 83 states have internal predecessors, (96), 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 144 states and 166 transitions. [2022-02-21 03:36:43,197 INFO L87 Difference]: Start difference. First operand has 84 states, 84 states have (on average 1.1428571428571428) internal successors, (96), 83 states have internal predecessors, (96), 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 144 states and 166 transitions. [2022-02-21 03:36:43,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:43,199 INFO L93 Difference]: Finished difference Result 144 states and 166 transitions. [2022-02-21 03:36:43,199 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 166 transitions. [2022-02-21 03:36:43,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:43,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:43,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:43,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:43,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 1.1428571428571428) internal successors, (96), 83 states have internal predecessors, (96), 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-21 03:36:43,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2022-02-21 03:36:43,201 INFO L704 BuchiCegarLoop]: Abstraction has 84 states and 96 transitions. [2022-02-21 03:36:43,201 INFO L587 BuchiCegarLoop]: Abstraction has 84 states and 96 transitions. [2022-02-21 03:36:43,201 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2022-02-21 03:36:43,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 96 transitions. [2022-02-21 03:36:43,201 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:36:43,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:43,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:43,202 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 9, 8, 8, 1, 1, 1, 1] [2022-02-21 03:36:43,202 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:43,202 INFO L791 eck$LassoCheckResult]: Stem: 4759#ULTIMATE.startENTRY 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); 4760#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; 4765#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 4780#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4781#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 4768#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4769#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 4799#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4798#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 4797#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4796#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 4795#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4794#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 4793#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4792#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 4791#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4790#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 4789#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4788#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 4784#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 4783#L27-3 assume !(main_~i~0#1 < main_~num~0#1); 4770#L27-4 main_~i~0#1 := 0; 4771#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 4807#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 4808#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4809#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 4813#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 4812#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4837#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 4834#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 4832#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4831#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 4828#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 4826#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4825#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 4822#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 4820#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4819#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 4817#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 4816#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4815#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 4777#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 4764#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4774#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 4779#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 4804#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4803#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 4786#L34 [2022-02-21 03:36:43,202 INFO L793 eck$LassoCheckResult]: Loop: 4786#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 4787#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 4785#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 4786#L34 [2022-02-21 03:36:43,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:43,203 INFO L85 PathProgramCache]: Analyzing trace with hash -2004823653, now seen corresponding path program 16 times [2022-02-21 03:36:43,203 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:43,203 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327906142] [2022-02-21 03:36:43,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:43,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:43,256 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:43,304 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:43,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:43,306 INFO L85 PathProgramCache]: Analyzing trace with hash 69557, now seen corresponding path program 10 times [2022-02-21 03:36:43,306 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:43,307 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929424029] [2022-02-21 03:36:43,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:43,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:43,312 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:43,316 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:43,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:43,316 INFO L85 PathProgramCache]: Analyzing trace with hash 113811419, now seen corresponding path program 17 times [2022-02-21 03:36:43,316 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:43,316 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607242082] [2022-02-21 03:36:43,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:43,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:43,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {5136#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); {5136#true} is VALID [2022-02-21 03:36:43,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {5136#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {5138#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:43,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {5138#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {5138#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:43,580 INFO L290 TraceCheckUtils]: 3: Hoare triple {5138#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5139#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:43,580 INFO L290 TraceCheckUtils]: 4: Hoare triple {5139#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {5139#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:43,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {5139#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5140#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:43,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {5140#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {5140#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:43,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {5140#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5141#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:43,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {5141#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {5141#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:43,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {5141#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5142#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:43,582 INFO L290 TraceCheckUtils]: 10: Hoare triple {5142#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {5142#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:43,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {5142#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5143#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:43,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {5143#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {5143#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:43,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {5143#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5144#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:43,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {5144#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {5144#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:43,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {5144#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5145#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:43,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {5145#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {5145#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:43,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {5145#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5146#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:43,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {5146#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {5146#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:43,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {5146#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5147#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:43,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {5147#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !(main_~i~0#1 < main_~num~0#1); {5148#(<= |ULTIMATE.start_main_~num~0#1| 9)} is VALID [2022-02-21 03:36:43,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {5148#(<= |ULTIMATE.start_main_~num~0#1| 9)} main_~i~0#1 := 0; {5149#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:43,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {5149#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 9))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {5149#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:43,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {5149#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 9))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {5149#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:43,588 INFO L290 TraceCheckUtils]: 24: Hoare triple {5149#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 9))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5150#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:43,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {5150#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {5150#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:43,589 INFO L290 TraceCheckUtils]: 26: Hoare triple {5150#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {5150#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:43,590 INFO L290 TraceCheckUtils]: 27: Hoare triple {5150#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5151#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:43,590 INFO L290 TraceCheckUtils]: 28: Hoare triple {5151#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {5151#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:43,590 INFO L290 TraceCheckUtils]: 29: Hoare triple {5151#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {5151#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:43,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {5151#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5152#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:43,591 INFO L290 TraceCheckUtils]: 31: Hoare triple {5152#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {5152#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:43,591 INFO L290 TraceCheckUtils]: 32: Hoare triple {5152#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {5152#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:43,592 INFO L290 TraceCheckUtils]: 33: Hoare triple {5152#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5153#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:43,592 INFO L290 TraceCheckUtils]: 34: Hoare triple {5153#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {5153#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:43,592 INFO L290 TraceCheckUtils]: 35: Hoare triple {5153#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {5153#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:43,593 INFO L290 TraceCheckUtils]: 36: Hoare triple {5153#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5154#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:43,606 INFO L290 TraceCheckUtils]: 37: Hoare triple {5154#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {5154#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:43,607 INFO L290 TraceCheckUtils]: 38: Hoare triple {5154#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {5154#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:43,608 INFO L290 TraceCheckUtils]: 39: Hoare triple {5154#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5155#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:43,608 INFO L290 TraceCheckUtils]: 40: Hoare triple {5155#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {5155#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:43,608 INFO L290 TraceCheckUtils]: 41: Hoare triple {5155#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {5155#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:43,611 INFO L290 TraceCheckUtils]: 42: Hoare triple {5155#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5156#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:43,612 INFO L290 TraceCheckUtils]: 43: Hoare triple {5156#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {5156#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:43,612 INFO L290 TraceCheckUtils]: 44: Hoare triple {5156#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {5156#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:43,612 INFO L290 TraceCheckUtils]: 45: Hoare triple {5156#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5157#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:43,613 INFO L290 TraceCheckUtils]: 46: Hoare triple {5157#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {5157#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:43,613 INFO L290 TraceCheckUtils]: 47: Hoare triple {5157#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {5157#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:43,614 INFO L290 TraceCheckUtils]: 48: Hoare triple {5157#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5158#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:36:43,614 INFO L290 TraceCheckUtils]: 49: Hoare triple {5158#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {5137#false} is VALID [2022-02-21 03:36:43,614 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 92 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:43,615 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:43,615 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607242082] [2022-02-21 03:36:43,615 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607242082] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:43,615 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588806965] [2022-02-21 03:36:43,615 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-21 03:36:43,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:43,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:43,617 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:43,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-02-21 03:36:43,786 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-02-21 03:36:43,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:36:43,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-21 03:36:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:43,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:44,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {5136#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); {5136#true} is VALID [2022-02-21 03:36:44,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {5136#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {5165#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:44,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {5165#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {5165#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:44,435 INFO L290 TraceCheckUtils]: 3: Hoare triple {5165#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5139#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:44,435 INFO L290 TraceCheckUtils]: 4: Hoare triple {5139#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {5139#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:44,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {5139#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5140#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:44,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {5140#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {5140#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:44,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {5140#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5141#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:44,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {5141#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {5141#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:44,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {5141#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5142#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:44,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {5142#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {5142#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:44,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {5142#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5143#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:44,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {5143#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {5143#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:44,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {5143#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5144#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:44,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {5144#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {5144#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:44,438 INFO L290 TraceCheckUtils]: 15: Hoare triple {5144#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5145#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:44,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {5145#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {5145#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:44,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {5145#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5146#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:44,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {5146#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {5146#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:44,440 INFO L290 TraceCheckUtils]: 19: Hoare triple {5146#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5147#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:44,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {5147#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !(main_~i~0#1 < main_~num~0#1); {5148#(<= |ULTIMATE.start_main_~num~0#1| 9)} is VALID [2022-02-21 03:36:44,440 INFO L290 TraceCheckUtils]: 21: Hoare triple {5148#(<= |ULTIMATE.start_main_~num~0#1| 9)} main_~i~0#1 := 0; {5226#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:44,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {5226#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {5226#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:44,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {5226#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {5226#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:44,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {5226#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5236#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:44,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {5236#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {5236#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:44,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {5236#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {5236#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:44,443 INFO L290 TraceCheckUtils]: 27: Hoare triple {5236#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5246#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:44,443 INFO L290 TraceCheckUtils]: 28: Hoare triple {5246#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {5246#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:44,444 INFO L290 TraceCheckUtils]: 29: Hoare triple {5246#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {5246#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:44,444 INFO L290 TraceCheckUtils]: 30: Hoare triple {5246#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5256#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:44,445 INFO L290 TraceCheckUtils]: 31: Hoare triple {5256#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {5256#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:44,445 INFO L290 TraceCheckUtils]: 32: Hoare triple {5256#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {5256#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:44,445 INFO L290 TraceCheckUtils]: 33: Hoare triple {5256#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5266#(and (<= 4 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:44,446 INFO L290 TraceCheckUtils]: 34: Hoare triple {5266#(and (<= 4 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {5266#(and (<= 4 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:44,446 INFO L290 TraceCheckUtils]: 35: Hoare triple {5266#(and (<= 4 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {5266#(and (<= 4 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:44,447 INFO L290 TraceCheckUtils]: 36: Hoare triple {5266#(and (<= 4 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5276#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:44,447 INFO L290 TraceCheckUtils]: 37: Hoare triple {5276#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {5276#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:44,447 INFO L290 TraceCheckUtils]: 38: Hoare triple {5276#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {5276#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:44,448 INFO L290 TraceCheckUtils]: 39: Hoare triple {5276#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5286#(and (<= 6 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:44,448 INFO L290 TraceCheckUtils]: 40: Hoare triple {5286#(and (<= 6 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {5286#(and (<= 6 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:44,449 INFO L290 TraceCheckUtils]: 41: Hoare triple {5286#(and (<= 6 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {5286#(and (<= 6 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:44,449 INFO L290 TraceCheckUtils]: 42: Hoare triple {5286#(and (<= 6 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5296#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:44,449 INFO L290 TraceCheckUtils]: 43: Hoare triple {5296#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {5296#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:44,450 INFO L290 TraceCheckUtils]: 44: Hoare triple {5296#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {5296#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:44,450 INFO L290 TraceCheckUtils]: 45: Hoare triple {5296#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5306#(and (<= 8 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:44,451 INFO L290 TraceCheckUtils]: 46: Hoare triple {5306#(and (<= 8 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {5306#(and (<= 8 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:44,451 INFO L290 TraceCheckUtils]: 47: Hoare triple {5306#(and (<= 8 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {5306#(and (<= 8 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:44,451 INFO L290 TraceCheckUtils]: 48: Hoare triple {5306#(and (<= 8 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5316#(and (<= 9 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} is VALID [2022-02-21 03:36:44,452 INFO L290 TraceCheckUtils]: 49: Hoare triple {5316#(and (<= 9 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 9))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {5137#false} is VALID [2022-02-21 03:36:44,452 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 117 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:44,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:44,789 INFO L290 TraceCheckUtils]: 49: Hoare triple {5158#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {5137#false} is VALID [2022-02-21 03:36:44,790 INFO L290 TraceCheckUtils]: 48: Hoare triple {5157#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5158#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:36:44,790 INFO L290 TraceCheckUtils]: 47: Hoare triple {5157#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {5157#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:44,791 INFO L290 TraceCheckUtils]: 46: Hoare triple {5157#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {5157#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:44,791 INFO L290 TraceCheckUtils]: 45: Hoare triple {5156#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5157#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:44,791 INFO L290 TraceCheckUtils]: 44: Hoare triple {5156#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {5156#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:44,792 INFO L290 TraceCheckUtils]: 43: Hoare triple {5156#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {5156#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:44,792 INFO L290 TraceCheckUtils]: 42: Hoare triple {5155#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5156#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:44,792 INFO L290 TraceCheckUtils]: 41: Hoare triple {5155#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {5155#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:44,793 INFO L290 TraceCheckUtils]: 40: Hoare triple {5155#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {5155#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:44,793 INFO L290 TraceCheckUtils]: 39: Hoare triple {5154#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5155#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:44,793 INFO L290 TraceCheckUtils]: 38: Hoare triple {5154#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {5154#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:44,794 INFO L290 TraceCheckUtils]: 37: Hoare triple {5154#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {5154#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:44,794 INFO L290 TraceCheckUtils]: 36: Hoare triple {5153#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5154#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:44,794 INFO L290 TraceCheckUtils]: 35: Hoare triple {5153#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {5153#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:44,795 INFO L290 TraceCheckUtils]: 34: Hoare triple {5153#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {5153#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:44,795 INFO L290 TraceCheckUtils]: 33: Hoare triple {5152#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5153#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:44,795 INFO L290 TraceCheckUtils]: 32: Hoare triple {5152#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {5152#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:44,807 INFO L290 TraceCheckUtils]: 31: Hoare triple {5152#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {5152#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:44,808 INFO L290 TraceCheckUtils]: 30: Hoare triple {5151#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5152#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:44,809 INFO L290 TraceCheckUtils]: 29: Hoare triple {5151#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {5151#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:44,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {5151#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {5151#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:44,810 INFO L290 TraceCheckUtils]: 27: Hoare triple {5150#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5151#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:44,811 INFO L290 TraceCheckUtils]: 26: Hoare triple {5150#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {5150#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:44,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {5150#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {5150#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:44,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {5395#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {5150#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:44,813 INFO L290 TraceCheckUtils]: 23: Hoare triple {5395#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {5395#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:44,813 INFO L290 TraceCheckUtils]: 22: Hoare triple {5395#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {5395#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:44,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {5148#(<= |ULTIMATE.start_main_~num~0#1| 9)} main_~i~0#1 := 0; {5395#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:44,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {5147#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !(main_~i~0#1 < main_~num~0#1); {5148#(<= |ULTIMATE.start_main_~num~0#1| 9)} is VALID [2022-02-21 03:36:44,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {5146#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5147#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:44,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {5146#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {5146#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:44,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {5145#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5146#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:44,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {5145#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {5145#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:44,818 INFO L290 TraceCheckUtils]: 15: Hoare triple {5144#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5145#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:44,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {5144#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {5144#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:44,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {5143#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5144#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:44,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {5143#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {5143#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:44,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {5142#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5143#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:44,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {5142#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {5142#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:44,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {5141#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5142#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:44,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {5141#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {5141#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:44,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {5140#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5141#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:44,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {5140#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {5140#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:44,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {5139#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5140#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:44,823 INFO L290 TraceCheckUtils]: 4: Hoare triple {5139#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {5139#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:44,824 INFO L290 TraceCheckUtils]: 3: Hoare triple {5165#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {5139#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:44,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {5165#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {5165#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:44,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {5136#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {5165#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:44,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {5136#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); {5136#true} is VALID [2022-02-21 03:36:44,825 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 117 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:44,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588806965] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:44,825 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:44,826 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 34 [2022-02-21 03:36:44,826 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848230993] [2022-02-21 03:36:44,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:44,867 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:44,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-02-21 03:36:44,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=899, Unknown=0, NotChecked=0, Total=1190 [2022-02-21 03:36:44,868 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. cyclomatic complexity: 15 Second operand has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 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-21 03:36:46,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:46,256 INFO L93 Difference]: Finished difference Result 271 states and 314 transitions. [2022-02-21 03:36:46,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-21 03:36:46,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 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-21 03:36:46,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:46,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 314 transitions. [2022-02-21 03:36:46,323 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:36:46,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 158 states and 182 transitions. [2022-02-21 03:36:46,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2022-02-21 03:36:46,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2022-02-21 03:36:46,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 158 states and 182 transitions. [2022-02-21 03:36:46,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:46,325 INFO L681 BuchiCegarLoop]: Abstraction has 158 states and 182 transitions. [2022-02-21 03:36:46,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 182 transitions. [2022-02-21 03:36:46,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 92. [2022-02-21 03:36:46,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:46,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states and 182 transitions. Second operand has 92 states, 92 states have (on average 1.141304347826087) internal successors, (105), 91 states have internal predecessors, (105), 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-21 03:36:46,328 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states and 182 transitions. Second operand has 92 states, 92 states have (on average 1.141304347826087) internal successors, (105), 91 states have internal predecessors, (105), 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-21 03:36:46,329 INFO L87 Difference]: Start difference. First operand 158 states and 182 transitions. Second operand has 92 states, 92 states have (on average 1.141304347826087) internal successors, (105), 91 states have internal predecessors, (105), 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-21 03:36:46,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:46,333 INFO L93 Difference]: Finished difference Result 158 states and 182 transitions. [2022-02-21 03:36:46,333 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 182 transitions. [2022-02-21 03:36:46,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:46,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:46,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 92 states have (on average 1.141304347826087) internal successors, (105), 91 states have internal predecessors, (105), 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 158 states and 182 transitions. [2022-02-21 03:36:46,335 INFO L87 Difference]: Start difference. First operand has 92 states, 92 states have (on average 1.141304347826087) internal successors, (105), 91 states have internal predecessors, (105), 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 158 states and 182 transitions. [2022-02-21 03:36:46,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:46,337 INFO L93 Difference]: Finished difference Result 158 states and 182 transitions. [2022-02-21 03:36:46,337 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 182 transitions. [2022-02-21 03:36:46,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:46,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:46,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:46,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:46,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.141304347826087) internal successors, (105), 91 states have internal predecessors, (105), 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-21 03:36:46,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2022-02-21 03:36:46,339 INFO L704 BuchiCegarLoop]: Abstraction has 92 states and 105 transitions. [2022-02-21 03:36:46,340 INFO L587 BuchiCegarLoop]: Abstraction has 92 states and 105 transitions. [2022-02-21 03:36:46,340 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2022-02-21 03:36:46,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 105 transitions. [2022-02-21 03:36:46,340 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:36:46,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:46,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:46,341 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 9, 9, 1, 1, 1, 1] [2022-02-21 03:36:46,341 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:46,342 INFO L791 eck$LassoCheckResult]: Stem: 5758#ULTIMATE.startENTRY 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); 5759#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; 5764#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 5778#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5779#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 5767#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5768#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 5799#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5798#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 5797#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5796#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 5795#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5794#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 5793#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5792#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 5791#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5790#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 5789#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5788#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 5787#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5786#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 5782#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 5781#L27-3 assume !(main_~i~0#1 < main_~num~0#1); 5769#L27-4 main_~i~0#1 := 0; 5770#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 5844#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 5809#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5807#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 5808#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 5812#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5842#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 5839#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 5837#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5836#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 5833#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 5831#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5830#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 5827#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 5825#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5824#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 5821#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 5819#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5818#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 5817#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 5816#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5815#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 5775#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 5763#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5772#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 5777#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 5804#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5803#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 5784#L34 [2022-02-21 03:36:46,342 INFO L793 eck$LassoCheckResult]: Loop: 5784#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 5785#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 5783#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 5784#L34 [2022-02-21 03:36:46,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:46,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1133441117, now seen corresponding path program 18 times [2022-02-21 03:36:46,343 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:46,343 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060013130] [2022-02-21 03:36:46,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:46,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:46,401 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:46,441 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:46,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:46,441 INFO L85 PathProgramCache]: Analyzing trace with hash 69557, now seen corresponding path program 11 times [2022-02-21 03:36:46,442 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:46,442 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691699522] [2022-02-21 03:36:46,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:46,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:46,446 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:46,449 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:46,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:46,449 INFO L85 PathProgramCache]: Analyzing trace with hash -688524839, now seen corresponding path program 19 times [2022-02-21 03:36:46,449 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:46,450 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186108488] [2022-02-21 03:36:46,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:46,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:46,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {6171#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); {6171#true} is VALID [2022-02-21 03:36:46,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {6171#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {6173#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:46,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {6173#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {6173#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:46,733 INFO L290 TraceCheckUtils]: 3: Hoare triple {6173#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6174#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:46,733 INFO L290 TraceCheckUtils]: 4: Hoare triple {6174#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {6174#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:46,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {6174#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6175#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:46,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {6175#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {6175#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:46,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {6175#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6176#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:46,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {6176#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {6176#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:46,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {6176#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6177#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:46,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {6177#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {6177#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:46,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {6177#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6178#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:46,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {6178#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {6178#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:46,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {6178#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6179#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:46,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {6179#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {6179#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:46,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {6179#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6180#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:46,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {6180#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {6180#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:46,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {6180#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6181#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:46,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {6181#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {6181#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:46,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {6181#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6182#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:46,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {6182#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {6182#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:46,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {6182#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6183#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:46,740 INFO L290 TraceCheckUtils]: 22: Hoare triple {6183#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < main_~num~0#1); {6184#(<= |ULTIMATE.start_main_~num~0#1| 10)} is VALID [2022-02-21 03:36:46,740 INFO L290 TraceCheckUtils]: 23: Hoare triple {6184#(<= |ULTIMATE.start_main_~num~0#1| 10)} main_~i~0#1 := 0; {6185#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 10))} is VALID [2022-02-21 03:36:46,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {6185#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 10))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6185#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 10))} is VALID [2022-02-21 03:36:46,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {6185#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 10))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {6185#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 10))} is VALID [2022-02-21 03:36:46,742 INFO L290 TraceCheckUtils]: 26: Hoare triple {6185#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 10))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6186#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:46,742 INFO L290 TraceCheckUtils]: 27: Hoare triple {6186#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6186#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:46,742 INFO L290 TraceCheckUtils]: 28: Hoare triple {6186#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {6186#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:46,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {6186#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6187#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:46,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {6187#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6187#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:46,744 INFO L290 TraceCheckUtils]: 31: Hoare triple {6187#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {6187#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:46,744 INFO L290 TraceCheckUtils]: 32: Hoare triple {6187#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6188#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:46,744 INFO L290 TraceCheckUtils]: 33: Hoare triple {6188#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6188#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:46,745 INFO L290 TraceCheckUtils]: 34: Hoare triple {6188#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {6188#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:46,745 INFO L290 TraceCheckUtils]: 35: Hoare triple {6188#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6189#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:46,745 INFO L290 TraceCheckUtils]: 36: Hoare triple {6189#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6189#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:46,746 INFO L290 TraceCheckUtils]: 37: Hoare triple {6189#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {6189#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:46,746 INFO L290 TraceCheckUtils]: 38: Hoare triple {6189#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6190#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:46,746 INFO L290 TraceCheckUtils]: 39: Hoare triple {6190#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6190#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:46,747 INFO L290 TraceCheckUtils]: 40: Hoare triple {6190#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {6190#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:46,747 INFO L290 TraceCheckUtils]: 41: Hoare triple {6190#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6191#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:46,747 INFO L290 TraceCheckUtils]: 42: Hoare triple {6191#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6191#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:46,748 INFO L290 TraceCheckUtils]: 43: Hoare triple {6191#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {6191#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:46,748 INFO L290 TraceCheckUtils]: 44: Hoare triple {6191#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6192#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:46,749 INFO L290 TraceCheckUtils]: 45: Hoare triple {6192#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6192#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:46,749 INFO L290 TraceCheckUtils]: 46: Hoare triple {6192#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {6192#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:46,749 INFO L290 TraceCheckUtils]: 47: Hoare triple {6192#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6193#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:46,750 INFO L290 TraceCheckUtils]: 48: Hoare triple {6193#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6193#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:46,750 INFO L290 TraceCheckUtils]: 49: Hoare triple {6193#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {6193#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:46,750 INFO L290 TraceCheckUtils]: 50: Hoare triple {6193#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6194#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:46,750 INFO L290 TraceCheckUtils]: 51: Hoare triple {6194#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6194#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:46,760 INFO L290 TraceCheckUtils]: 52: Hoare triple {6194#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {6194#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:46,766 INFO L290 TraceCheckUtils]: 53: Hoare triple {6194#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6195#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:36:46,766 INFO L290 TraceCheckUtils]: 54: Hoare triple {6195#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6172#false} is VALID [2022-02-21 03:36:46,767 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 117 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:46,767 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:46,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186108488] [2022-02-21 03:36:46,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186108488] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:46,767 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039411205] [2022-02-21 03:36:46,768 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-21 03:36:46,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:46,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:46,772 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:46,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-02-21 03:36:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:46,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-21 03:36:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:46,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:47,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {6171#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); {6171#true} is VALID [2022-02-21 03:36:47,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {6171#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {6202#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:47,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {6202#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {6202#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:47,490 INFO L290 TraceCheckUtils]: 3: Hoare triple {6202#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6174#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:47,491 INFO L290 TraceCheckUtils]: 4: Hoare triple {6174#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {6174#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:47,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {6174#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6175#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:47,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {6175#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {6175#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:47,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {6175#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6176#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:47,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {6176#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {6176#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:47,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {6176#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6177#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:47,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {6177#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {6177#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:47,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {6177#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6178#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:47,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {6178#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {6178#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:47,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {6178#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6179#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:47,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {6179#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {6179#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:47,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {6179#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6180#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:47,495 INFO L290 TraceCheckUtils]: 16: Hoare triple {6180#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {6180#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:47,495 INFO L290 TraceCheckUtils]: 17: Hoare triple {6180#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6181#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:47,495 INFO L290 TraceCheckUtils]: 18: Hoare triple {6181#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {6181#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:47,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {6181#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6182#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:47,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {6182#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {6182#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:47,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {6182#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6183#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:47,497 INFO L290 TraceCheckUtils]: 22: Hoare triple {6183#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < main_~num~0#1); {6184#(<= |ULTIMATE.start_main_~num~0#1| 10)} is VALID [2022-02-21 03:36:47,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {6184#(<= |ULTIMATE.start_main_~num~0#1| 10)} main_~i~0#1 := 0; {6269#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} is VALID [2022-02-21 03:36:47,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {6269#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6269#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} is VALID [2022-02-21 03:36:47,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {6269#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {6269#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} is VALID [2022-02-21 03:36:47,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {6269#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6279#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} is VALID [2022-02-21 03:36:47,499 INFO L290 TraceCheckUtils]: 27: Hoare triple {6279#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6279#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} is VALID [2022-02-21 03:36:47,499 INFO L290 TraceCheckUtils]: 28: Hoare triple {6279#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {6279#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} is VALID [2022-02-21 03:36:47,500 INFO L290 TraceCheckUtils]: 29: Hoare triple {6279#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6289#(and (<= |ULTIMATE.start_main_~num~0#1| 10) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,500 INFO L290 TraceCheckUtils]: 30: Hoare triple {6289#(and (<= |ULTIMATE.start_main_~num~0#1| 10) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6289#(and (<= |ULTIMATE.start_main_~num~0#1| 10) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,501 INFO L290 TraceCheckUtils]: 31: Hoare triple {6289#(and (<= |ULTIMATE.start_main_~num~0#1| 10) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {6289#(and (<= |ULTIMATE.start_main_~num~0#1| 10) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,502 INFO L290 TraceCheckUtils]: 32: Hoare triple {6289#(and (<= |ULTIMATE.start_main_~num~0#1| 10) (<= 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6299#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} is VALID [2022-02-21 03:36:47,502 INFO L290 TraceCheckUtils]: 33: Hoare triple {6299#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6299#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} is VALID [2022-02-21 03:36:47,503 INFO L290 TraceCheckUtils]: 34: Hoare triple {6299#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {6299#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} is VALID [2022-02-21 03:36:47,503 INFO L290 TraceCheckUtils]: 35: Hoare triple {6299#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6309#(and (<= |ULTIMATE.start_main_~num~0#1| 10) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,504 INFO L290 TraceCheckUtils]: 36: Hoare triple {6309#(and (<= |ULTIMATE.start_main_~num~0#1| 10) (<= 4 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6309#(and (<= |ULTIMATE.start_main_~num~0#1| 10) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,504 INFO L290 TraceCheckUtils]: 37: Hoare triple {6309#(and (<= |ULTIMATE.start_main_~num~0#1| 10) (<= 4 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {6309#(and (<= |ULTIMATE.start_main_~num~0#1| 10) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,505 INFO L290 TraceCheckUtils]: 38: Hoare triple {6309#(and (<= |ULTIMATE.start_main_~num~0#1| 10) (<= 4 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6319#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} is VALID [2022-02-21 03:36:47,506 INFO L290 TraceCheckUtils]: 39: Hoare triple {6319#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6319#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} is VALID [2022-02-21 03:36:47,506 INFO L290 TraceCheckUtils]: 40: Hoare triple {6319#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {6319#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} is VALID [2022-02-21 03:36:47,507 INFO L290 TraceCheckUtils]: 41: Hoare triple {6319#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6329#(and (<= |ULTIMATE.start_main_~num~0#1| 10) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,508 INFO L290 TraceCheckUtils]: 42: Hoare triple {6329#(and (<= |ULTIMATE.start_main_~num~0#1| 10) (<= 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6329#(and (<= |ULTIMATE.start_main_~num~0#1| 10) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,508 INFO L290 TraceCheckUtils]: 43: Hoare triple {6329#(and (<= |ULTIMATE.start_main_~num~0#1| 10) (<= 6 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {6329#(and (<= |ULTIMATE.start_main_~num~0#1| 10) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,509 INFO L290 TraceCheckUtils]: 44: Hoare triple {6329#(and (<= |ULTIMATE.start_main_~num~0#1| 10) (<= 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6339#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} is VALID [2022-02-21 03:36:47,509 INFO L290 TraceCheckUtils]: 45: Hoare triple {6339#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6339#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} is VALID [2022-02-21 03:36:47,510 INFO L290 TraceCheckUtils]: 46: Hoare triple {6339#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {6339#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} is VALID [2022-02-21 03:36:47,510 INFO L290 TraceCheckUtils]: 47: Hoare triple {6339#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6349#(and (<= |ULTIMATE.start_main_~num~0#1| 10) (<= 8 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,511 INFO L290 TraceCheckUtils]: 48: Hoare triple {6349#(and (<= |ULTIMATE.start_main_~num~0#1| 10) (<= 8 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6349#(and (<= |ULTIMATE.start_main_~num~0#1| 10) (<= 8 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,512 INFO L290 TraceCheckUtils]: 49: Hoare triple {6349#(and (<= |ULTIMATE.start_main_~num~0#1| 10) (<= 8 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {6349#(and (<= |ULTIMATE.start_main_~num~0#1| 10) (<= 8 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,512 INFO L290 TraceCheckUtils]: 50: Hoare triple {6349#(and (<= |ULTIMATE.start_main_~num~0#1| 10) (<= 8 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6359#(and (<= |ULTIMATE.start_main_~num~0#1| 10) (<= 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,513 INFO L290 TraceCheckUtils]: 51: Hoare triple {6359#(and (<= |ULTIMATE.start_main_~num~0#1| 10) (<= 9 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6359#(and (<= |ULTIMATE.start_main_~num~0#1| 10) (<= 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,513 INFO L290 TraceCheckUtils]: 52: Hoare triple {6359#(and (<= |ULTIMATE.start_main_~num~0#1| 10) (<= 9 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {6359#(and (<= |ULTIMATE.start_main_~num~0#1| 10) (<= 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,514 INFO L290 TraceCheckUtils]: 53: Hoare triple {6359#(and (<= |ULTIMATE.start_main_~num~0#1| 10) (<= 9 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6369#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} is VALID [2022-02-21 03:36:47,515 INFO L290 TraceCheckUtils]: 54: Hoare triple {6369#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 10))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6172#false} is VALID [2022-02-21 03:36:47,515 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 145 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:47,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:47,885 INFO L290 TraceCheckUtils]: 54: Hoare triple {6195#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6172#false} is VALID [2022-02-21 03:36:47,886 INFO L290 TraceCheckUtils]: 53: Hoare triple {6194#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6195#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:36:47,886 INFO L290 TraceCheckUtils]: 52: Hoare triple {6194#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {6194#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:47,886 INFO L290 TraceCheckUtils]: 51: Hoare triple {6194#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6194#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:47,887 INFO L290 TraceCheckUtils]: 50: Hoare triple {6193#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6194#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:47,887 INFO L290 TraceCheckUtils]: 49: Hoare triple {6193#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {6193#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,887 INFO L290 TraceCheckUtils]: 48: Hoare triple {6193#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6193#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,888 INFO L290 TraceCheckUtils]: 47: Hoare triple {6192#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6193#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,888 INFO L290 TraceCheckUtils]: 46: Hoare triple {6192#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {6192#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,888 INFO L290 TraceCheckUtils]: 45: Hoare triple {6192#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6192#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,889 INFO L290 TraceCheckUtils]: 44: Hoare triple {6191#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6192#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,889 INFO L290 TraceCheckUtils]: 43: Hoare triple {6191#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {6191#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:47,889 INFO L290 TraceCheckUtils]: 42: Hoare triple {6191#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6191#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:47,890 INFO L290 TraceCheckUtils]: 41: Hoare triple {6190#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6191#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:47,890 INFO L290 TraceCheckUtils]: 40: Hoare triple {6190#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {6190#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,890 INFO L290 TraceCheckUtils]: 39: Hoare triple {6190#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6190#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,891 INFO L290 TraceCheckUtils]: 38: Hoare triple {6189#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6190#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,891 INFO L290 TraceCheckUtils]: 37: Hoare triple {6189#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {6189#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,892 INFO L290 TraceCheckUtils]: 36: Hoare triple {6189#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6189#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,893 INFO L290 TraceCheckUtils]: 35: Hoare triple {6188#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6189#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,893 INFO L290 TraceCheckUtils]: 34: Hoare triple {6188#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {6188#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {6188#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6188#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {6187#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6188#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {6187#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {6187#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:47,895 INFO L290 TraceCheckUtils]: 30: Hoare triple {6187#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6187#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:47,895 INFO L290 TraceCheckUtils]: 29: Hoare triple {6186#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6187#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:47,895 INFO L290 TraceCheckUtils]: 28: Hoare triple {6186#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {6186#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {6186#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6186#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {6457#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {6186#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:47,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {6457#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {6457#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:36:47,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {6457#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {6457#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:36:47,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {6184#(<= |ULTIMATE.start_main_~num~0#1| 10)} main_~i~0#1 := 0; {6457#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:36:47,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {6183#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < main_~num~0#1); {6184#(<= |ULTIMATE.start_main_~num~0#1| 10)} is VALID [2022-02-21 03:36:47,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {6182#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6183#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:47,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {6182#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {6182#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:47,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {6181#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6182#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:47,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {6181#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {6181#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:47,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {6180#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6181#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:47,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {6180#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {6180#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:47,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {6179#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6180#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:47,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {6179#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {6179#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:47,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {6178#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6179#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:47,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {6178#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {6178#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:47,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {6177#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6178#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:47,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {6177#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {6177#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:47,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {6176#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6177#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:47,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {6176#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {6176#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:47,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {6175#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6176#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:47,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {6175#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {6175#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:47,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {6174#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6175#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:47,903 INFO L290 TraceCheckUtils]: 4: Hoare triple {6174#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {6174#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:47,903 INFO L290 TraceCheckUtils]: 3: Hoare triple {6202#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {6174#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:47,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {6202#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {6202#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:47,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {6171#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {6202#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:47,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {6171#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); {6171#true} is VALID [2022-02-21 03:36:47,904 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 145 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:47,905 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039411205] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:47,905 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:47,905 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 37 [2022-02-21 03:36:47,905 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607273461] [2022-02-21 03:36:47,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:47,952 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:47,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-02-21 03:36:47,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=1065, Unknown=0, NotChecked=0, Total=1406 [2022-02-21 03:36:47,953 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. cyclomatic complexity: 16 Second operand has 38 states, 37 states have (on average 2.5405405405405403) internal successors, (94), 38 states have internal predecessors, (94), 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-21 03:36:49,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:49,265 INFO L93 Difference]: Finished difference Result 297 states and 344 transitions. [2022-02-21 03:36:49,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-21 03:36:49,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 38 states, 37 states have (on average 2.5405405405405403) internal successors, (94), 38 states have internal predecessors, (94), 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-21 03:36:49,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:49,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 297 states and 344 transitions. [2022-02-21 03:36:49,357 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:36:49,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 297 states to 172 states and 198 transitions. [2022-02-21 03:36:49,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 149 [2022-02-21 03:36:49,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 149 [2022-02-21 03:36:49,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 172 states and 198 transitions. [2022-02-21 03:36:49,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:49,366 INFO L681 BuchiCegarLoop]: Abstraction has 172 states and 198 transitions. [2022-02-21 03:36:49,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states and 198 transitions. [2022-02-21 03:36:49,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 100. [2022-02-21 03:36:49,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:49,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states and 198 transitions. Second operand has 100 states, 100 states have (on average 1.14) internal successors, (114), 99 states have internal predecessors, (114), 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-21 03:36:49,369 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states and 198 transitions. Second operand has 100 states, 100 states have (on average 1.14) internal successors, (114), 99 states have internal predecessors, (114), 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-21 03:36:49,369 INFO L87 Difference]: Start difference. First operand 172 states and 198 transitions. Second operand has 100 states, 100 states have (on average 1.14) internal successors, (114), 99 states have internal predecessors, (114), 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-21 03:36:49,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:49,378 INFO L93 Difference]: Finished difference Result 172 states and 198 transitions. [2022-02-21 03:36:49,378 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 198 transitions. [2022-02-21 03:36:49,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:49,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:49,381 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 100 states have (on average 1.14) internal successors, (114), 99 states have internal predecessors, (114), 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 172 states and 198 transitions. [2022-02-21 03:36:49,382 INFO L87 Difference]: Start difference. First operand has 100 states, 100 states have (on average 1.14) internal successors, (114), 99 states have internal predecessors, (114), 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 172 states and 198 transitions. [2022-02-21 03:36:49,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:49,387 INFO L93 Difference]: Finished difference Result 172 states and 198 transitions. [2022-02-21 03:36:49,387 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 198 transitions. [2022-02-21 03:36:49,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:49,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:49,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:49,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:49,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 100 states have (on average 1.14) internal successors, (114), 99 states have internal predecessors, (114), 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-21 03:36:49,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2022-02-21 03:36:49,389 INFO L704 BuchiCegarLoop]: Abstraction has 100 states and 114 transitions. [2022-02-21 03:36:49,390 INFO L587 BuchiCegarLoop]: Abstraction has 100 states and 114 transitions. [2022-02-21 03:36:49,390 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2022-02-21 03:36:49,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 100 states and 114 transitions. [2022-02-21 03:36:49,390 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:36:49,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:49,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:49,391 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 11, 10, 10, 1, 1, 1, 1] [2022-02-21 03:36:49,391 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:49,392 INFO L791 eck$LassoCheckResult]: Stem: 6854#ULTIMATE.startENTRY 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); 6855#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; 6860#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 6875#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 6876#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 6863#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 6864#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 6898#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 6897#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 6896#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 6895#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 6894#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 6893#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 6892#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 6891#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 6890#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 6889#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 6888#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 6887#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 6886#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 6885#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 6884#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 6883#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 6879#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 6878#L27-3 assume !(main_~i~0#1 < main_~num~0#1); 6865#L27-4 main_~i~0#1 := 0; 6866#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 6906#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 6907#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6908#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 6912#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 6911#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6948#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 6945#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 6943#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6942#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 6939#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 6937#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6936#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 6933#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 6931#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6930#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 6927#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 6925#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6924#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 6921#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 6919#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6918#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 6916#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 6915#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6914#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 6872#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 6859#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6869#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 6874#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 6903#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6902#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 6881#L34 [2022-02-21 03:36:49,392 INFO L793 eck$LassoCheckResult]: Loop: 6881#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 6882#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 6880#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 6881#L34 [2022-02-21 03:36:49,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:49,392 INFO L85 PathProgramCache]: Analyzing trace with hash 125280919, now seen corresponding path program 20 times [2022-02-21 03:36:49,392 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:49,393 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113101444] [2022-02-21 03:36:49,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:49,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:49,483 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:49,586 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:49,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:49,586 INFO L85 PathProgramCache]: Analyzing trace with hash 69557, now seen corresponding path program 12 times [2022-02-21 03:36:49,586 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:49,587 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690552165] [2022-02-21 03:36:49,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:49,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:49,591 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:49,594 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:49,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:49,594 INFO L85 PathProgramCache]: Analyzing trace with hash -82682529, now seen corresponding path program 21 times [2022-02-21 03:36:49,594 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:49,594 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992707615] [2022-02-21 03:36:49,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:49,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:49,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {7303#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); {7303#true} is VALID [2022-02-21 03:36:49,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {7303#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {7305#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:49,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {7305#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7305#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:49,939 INFO L290 TraceCheckUtils]: 3: Hoare triple {7305#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7306#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:49,939 INFO L290 TraceCheckUtils]: 4: Hoare triple {7306#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7306#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:49,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {7306#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7307#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:49,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {7307#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7307#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:49,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {7307#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7308#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:49,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {7308#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7308#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:49,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {7308#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7309#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:49,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {7309#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7309#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:49,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {7309#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7310#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:49,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {7310#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7310#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:49,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {7310#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7311#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:49,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {7311#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7311#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:49,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {7311#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7312#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:49,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {7312#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7312#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:49,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {7312#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7313#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:49,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {7313#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7313#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:49,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {7313#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7314#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:49,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {7314#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7314#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:49,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {7314#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7315#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:49,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {7315#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7315#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:49,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {7315#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7316#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:36:49,947 INFO L290 TraceCheckUtils]: 24: Hoare triple {7316#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !(main_~i~0#1 < main_~num~0#1); {7317#(<= |ULTIMATE.start_main_~num~0#1| 11)} is VALID [2022-02-21 03:36:49,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {7317#(<= |ULTIMATE.start_main_~num~0#1| 11)} main_~i~0#1 := 0; {7318#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 11))} is VALID [2022-02-21 03:36:49,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {7318#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 11))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7318#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 11))} is VALID [2022-02-21 03:36:49,949 INFO L290 TraceCheckUtils]: 27: Hoare triple {7318#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 11))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7318#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 11))} is VALID [2022-02-21 03:36:49,950 INFO L290 TraceCheckUtils]: 28: Hoare triple {7318#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 11))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7319#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:36:49,950 INFO L290 TraceCheckUtils]: 29: Hoare triple {7319#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7319#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:36:49,950 INFO L290 TraceCheckUtils]: 30: Hoare triple {7319#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7319#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:36:49,950 INFO L290 TraceCheckUtils]: 31: Hoare triple {7319#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7320#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:49,951 INFO L290 TraceCheckUtils]: 32: Hoare triple {7320#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7320#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:49,951 INFO L290 TraceCheckUtils]: 33: Hoare triple {7320#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7320#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:49,952 INFO L290 TraceCheckUtils]: 34: Hoare triple {7320#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7321#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:49,953 INFO L290 TraceCheckUtils]: 35: Hoare triple {7321#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7321#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:49,953 INFO L290 TraceCheckUtils]: 36: Hoare triple {7321#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7321#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:49,954 INFO L290 TraceCheckUtils]: 37: Hoare triple {7321#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7322#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:49,954 INFO L290 TraceCheckUtils]: 38: Hoare triple {7322#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7322#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:49,955 INFO L290 TraceCheckUtils]: 39: Hoare triple {7322#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7322#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:49,955 INFO L290 TraceCheckUtils]: 40: Hoare triple {7322#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7323#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:49,956 INFO L290 TraceCheckUtils]: 41: Hoare triple {7323#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7323#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:49,956 INFO L290 TraceCheckUtils]: 42: Hoare triple {7323#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7323#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:49,957 INFO L290 TraceCheckUtils]: 43: Hoare triple {7323#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7324#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:49,957 INFO L290 TraceCheckUtils]: 44: Hoare triple {7324#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7324#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:49,957 INFO L290 TraceCheckUtils]: 45: Hoare triple {7324#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7324#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:49,958 INFO L290 TraceCheckUtils]: 46: Hoare triple {7324#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7325#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:49,958 INFO L290 TraceCheckUtils]: 47: Hoare triple {7325#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7325#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:49,959 INFO L290 TraceCheckUtils]: 48: Hoare triple {7325#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7325#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:49,959 INFO L290 TraceCheckUtils]: 49: Hoare triple {7325#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7326#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:49,960 INFO L290 TraceCheckUtils]: 50: Hoare triple {7326#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7326#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:49,960 INFO L290 TraceCheckUtils]: 51: Hoare triple {7326#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7326#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:49,961 INFO L290 TraceCheckUtils]: 52: Hoare triple {7326#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7327#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:49,961 INFO L290 TraceCheckUtils]: 53: Hoare triple {7327#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7327#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:49,962 INFO L290 TraceCheckUtils]: 54: Hoare triple {7327#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7327#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:49,962 INFO L290 TraceCheckUtils]: 55: Hoare triple {7327#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7328#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:49,963 INFO L290 TraceCheckUtils]: 56: Hoare triple {7328#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7328#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:49,963 INFO L290 TraceCheckUtils]: 57: Hoare triple {7328#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7328#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:49,964 INFO L290 TraceCheckUtils]: 58: Hoare triple {7328#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7329#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:36:49,964 INFO L290 TraceCheckUtils]: 59: Hoare triple {7329#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7304#false} is VALID [2022-02-21 03:36:49,965 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 145 proven. 152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:49,965 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:49,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992707615] [2022-02-21 03:36:49,965 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992707615] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:49,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099900873] [2022-02-21 03:36:49,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:36:49,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:49,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:49,971 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:49,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-02-21 03:36:50,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-02-21 03:36:50,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:36:50,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-21 03:36:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:50,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:50,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {7303#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); {7303#true} is VALID [2022-02-21 03:36:50,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {7303#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {7336#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:50,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {7336#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7336#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:50,932 INFO L290 TraceCheckUtils]: 3: Hoare triple {7336#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7306#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:50,932 INFO L290 TraceCheckUtils]: 4: Hoare triple {7306#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7306#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:50,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {7306#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7307#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:50,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {7307#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7307#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:50,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {7307#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7308#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:50,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {7308#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7308#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:50,934 INFO L290 TraceCheckUtils]: 9: Hoare triple {7308#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7309#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:50,934 INFO L290 TraceCheckUtils]: 10: Hoare triple {7309#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7309#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:50,935 INFO L290 TraceCheckUtils]: 11: Hoare triple {7309#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7310#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:50,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {7310#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7310#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:50,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {7310#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7311#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:50,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {7311#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7311#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:50,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {7311#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7312#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:50,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {7312#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7312#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:50,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {7312#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7313#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:50,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {7313#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7313#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:50,937 INFO L290 TraceCheckUtils]: 19: Hoare triple {7313#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7314#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:50,937 INFO L290 TraceCheckUtils]: 20: Hoare triple {7314#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7314#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:50,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {7314#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7315#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:50,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {7315#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7315#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:50,938 INFO L290 TraceCheckUtils]: 23: Hoare triple {7315#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7316#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:36:50,939 INFO L290 TraceCheckUtils]: 24: Hoare triple {7316#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !(main_~i~0#1 < main_~num~0#1); {7317#(<= |ULTIMATE.start_main_~num~0#1| 11)} is VALID [2022-02-21 03:36:50,939 INFO L290 TraceCheckUtils]: 25: Hoare triple {7317#(<= |ULTIMATE.start_main_~num~0#1| 11)} main_~i~0#1 := 0; {7409#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} is VALID [2022-02-21 03:36:50,940 INFO L290 TraceCheckUtils]: 26: Hoare triple {7409#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7409#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} is VALID [2022-02-21 03:36:50,940 INFO L290 TraceCheckUtils]: 27: Hoare triple {7409#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7409#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} is VALID [2022-02-21 03:36:50,940 INFO L290 TraceCheckUtils]: 28: Hoare triple {7409#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7419#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} is VALID [2022-02-21 03:36:50,941 INFO L290 TraceCheckUtils]: 29: Hoare triple {7419#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7419#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} is VALID [2022-02-21 03:36:50,941 INFO L290 TraceCheckUtils]: 30: Hoare triple {7419#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7419#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} is VALID [2022-02-21 03:36:50,942 INFO L290 TraceCheckUtils]: 31: Hoare triple {7419#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7429#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} is VALID [2022-02-21 03:36:50,942 INFO L290 TraceCheckUtils]: 32: Hoare triple {7429#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7429#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} is VALID [2022-02-21 03:36:50,942 INFO L290 TraceCheckUtils]: 33: Hoare triple {7429#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7429#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} is VALID [2022-02-21 03:36:50,943 INFO L290 TraceCheckUtils]: 34: Hoare triple {7429#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7439#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} is VALID [2022-02-21 03:36:50,943 INFO L290 TraceCheckUtils]: 35: Hoare triple {7439#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7439#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} is VALID [2022-02-21 03:36:50,944 INFO L290 TraceCheckUtils]: 36: Hoare triple {7439#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7439#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} is VALID [2022-02-21 03:36:50,944 INFO L290 TraceCheckUtils]: 37: Hoare triple {7439#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7449#(and (<= |ULTIMATE.start_main_~num~0#1| 11) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:50,944 INFO L290 TraceCheckUtils]: 38: Hoare triple {7449#(and (<= |ULTIMATE.start_main_~num~0#1| 11) (<= 4 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7449#(and (<= |ULTIMATE.start_main_~num~0#1| 11) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:50,945 INFO L290 TraceCheckUtils]: 39: Hoare triple {7449#(and (<= |ULTIMATE.start_main_~num~0#1| 11) (<= 4 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7449#(and (<= |ULTIMATE.start_main_~num~0#1| 11) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:50,945 INFO L290 TraceCheckUtils]: 40: Hoare triple {7449#(and (<= |ULTIMATE.start_main_~num~0#1| 11) (<= 4 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7459#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} is VALID [2022-02-21 03:36:50,946 INFO L290 TraceCheckUtils]: 41: Hoare triple {7459#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7459#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} is VALID [2022-02-21 03:36:50,946 INFO L290 TraceCheckUtils]: 42: Hoare triple {7459#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7459#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} is VALID [2022-02-21 03:36:50,946 INFO L290 TraceCheckUtils]: 43: Hoare triple {7459#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7469#(and (<= |ULTIMATE.start_main_~num~0#1| 11) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:50,947 INFO L290 TraceCheckUtils]: 44: Hoare triple {7469#(and (<= |ULTIMATE.start_main_~num~0#1| 11) (<= 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7469#(and (<= |ULTIMATE.start_main_~num~0#1| 11) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:50,947 INFO L290 TraceCheckUtils]: 45: Hoare triple {7469#(and (<= |ULTIMATE.start_main_~num~0#1| 11) (<= 6 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7469#(and (<= |ULTIMATE.start_main_~num~0#1| 11) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:50,948 INFO L290 TraceCheckUtils]: 46: Hoare triple {7469#(and (<= |ULTIMATE.start_main_~num~0#1| 11) (<= 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7479#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} is VALID [2022-02-21 03:36:50,948 INFO L290 TraceCheckUtils]: 47: Hoare triple {7479#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7479#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} is VALID [2022-02-21 03:36:50,948 INFO L290 TraceCheckUtils]: 48: Hoare triple {7479#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7479#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} is VALID [2022-02-21 03:36:50,949 INFO L290 TraceCheckUtils]: 49: Hoare triple {7479#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7489#(and (<= |ULTIMATE.start_main_~num~0#1| 11) (<= 8 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:50,949 INFO L290 TraceCheckUtils]: 50: Hoare triple {7489#(and (<= |ULTIMATE.start_main_~num~0#1| 11) (<= 8 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7489#(and (<= |ULTIMATE.start_main_~num~0#1| 11) (<= 8 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:50,950 INFO L290 TraceCheckUtils]: 51: Hoare triple {7489#(and (<= |ULTIMATE.start_main_~num~0#1| 11) (<= 8 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7489#(and (<= |ULTIMATE.start_main_~num~0#1| 11) (<= 8 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:50,950 INFO L290 TraceCheckUtils]: 52: Hoare triple {7489#(and (<= |ULTIMATE.start_main_~num~0#1| 11) (<= 8 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7499#(and (<= 9 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} is VALID [2022-02-21 03:36:50,951 INFO L290 TraceCheckUtils]: 53: Hoare triple {7499#(and (<= 9 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7499#(and (<= 9 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} is VALID [2022-02-21 03:36:50,951 INFO L290 TraceCheckUtils]: 54: Hoare triple {7499#(and (<= 9 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7499#(and (<= 9 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} is VALID [2022-02-21 03:36:50,951 INFO L290 TraceCheckUtils]: 55: Hoare triple {7499#(and (<= 9 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7509#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} is VALID [2022-02-21 03:36:50,952 INFO L290 TraceCheckUtils]: 56: Hoare triple {7509#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7509#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} is VALID [2022-02-21 03:36:50,952 INFO L290 TraceCheckUtils]: 57: Hoare triple {7509#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7509#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} is VALID [2022-02-21 03:36:50,953 INFO L290 TraceCheckUtils]: 58: Hoare triple {7509#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 11))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7519#(and (<= |ULTIMATE.start_main_~num~0#1| 11) (<= 11 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:50,953 INFO L290 TraceCheckUtils]: 59: Hoare triple {7519#(and (<= |ULTIMATE.start_main_~num~0#1| 11) (<= 11 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7304#false} is VALID [2022-02-21 03:36:50,953 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 176 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:50,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:51,374 INFO L290 TraceCheckUtils]: 59: Hoare triple {7329#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7304#false} is VALID [2022-02-21 03:36:51,374 INFO L290 TraceCheckUtils]: 58: Hoare triple {7328#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7329#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:36:51,375 INFO L290 TraceCheckUtils]: 57: Hoare triple {7328#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7328#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:51,375 INFO L290 TraceCheckUtils]: 56: Hoare triple {7328#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7328#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:51,376 INFO L290 TraceCheckUtils]: 55: Hoare triple {7327#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7328#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:51,376 INFO L290 TraceCheckUtils]: 54: Hoare triple {7327#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7327#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:51,376 INFO L290 TraceCheckUtils]: 53: Hoare triple {7327#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7327#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:51,377 INFO L290 TraceCheckUtils]: 52: Hoare triple {7326#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7327#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:51,377 INFO L290 TraceCheckUtils]: 51: Hoare triple {7326#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7326#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:51,377 INFO L290 TraceCheckUtils]: 50: Hoare triple {7326#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7326#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:51,378 INFO L290 TraceCheckUtils]: 49: Hoare triple {7325#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7326#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:51,378 INFO L290 TraceCheckUtils]: 48: Hoare triple {7325#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7325#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:51,379 INFO L290 TraceCheckUtils]: 47: Hoare triple {7325#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7325#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:51,379 INFO L290 TraceCheckUtils]: 46: Hoare triple {7324#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7325#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:51,379 INFO L290 TraceCheckUtils]: 45: Hoare triple {7324#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7324#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:51,380 INFO L290 TraceCheckUtils]: 44: Hoare triple {7324#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7324#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:51,380 INFO L290 TraceCheckUtils]: 43: Hoare triple {7323#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7324#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:51,381 INFO L290 TraceCheckUtils]: 42: Hoare triple {7323#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7323#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:51,381 INFO L290 TraceCheckUtils]: 41: Hoare triple {7323#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7323#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:51,381 INFO L290 TraceCheckUtils]: 40: Hoare triple {7322#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7323#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:51,382 INFO L290 TraceCheckUtils]: 39: Hoare triple {7322#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7322#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:51,382 INFO L290 TraceCheckUtils]: 38: Hoare triple {7322#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7322#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:51,383 INFO L290 TraceCheckUtils]: 37: Hoare triple {7321#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7322#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:51,383 INFO L290 TraceCheckUtils]: 36: Hoare triple {7321#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7321#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:51,383 INFO L290 TraceCheckUtils]: 35: Hoare triple {7321#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7321#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:51,384 INFO L290 TraceCheckUtils]: 34: Hoare triple {7320#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7321#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:51,384 INFO L290 TraceCheckUtils]: 33: Hoare triple {7320#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7320#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:51,385 INFO L290 TraceCheckUtils]: 32: Hoare triple {7320#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7320#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:51,385 INFO L290 TraceCheckUtils]: 31: Hoare triple {7319#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7320#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:51,385 INFO L290 TraceCheckUtils]: 30: Hoare triple {7319#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7319#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:36:51,386 INFO L290 TraceCheckUtils]: 29: Hoare triple {7319#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7319#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:36:51,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {7616#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {7319#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:36:51,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {7616#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {7616#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:36:51,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {7616#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {7616#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:36:51,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {7317#(<= |ULTIMATE.start_main_~num~0#1| 11)} main_~i~0#1 := 0; {7616#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:36:51,388 INFO L290 TraceCheckUtils]: 24: Hoare triple {7316#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !(main_~i~0#1 < main_~num~0#1); {7317#(<= |ULTIMATE.start_main_~num~0#1| 11)} is VALID [2022-02-21 03:36:51,388 INFO L290 TraceCheckUtils]: 23: Hoare triple {7315#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7316#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:36:51,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {7315#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7315#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:51,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {7314#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7315#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:51,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {7314#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7314#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:51,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {7313#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7314#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:51,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {7313#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7313#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:51,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {7312#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7313#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:51,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {7312#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7312#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:51,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {7311#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7312#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:51,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {7311#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7311#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:51,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {7310#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7311#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:51,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {7310#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7310#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:51,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {7309#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7310#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:51,393 INFO L290 TraceCheckUtils]: 10: Hoare triple {7309#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7309#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:51,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {7308#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7309#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:51,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {7308#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7308#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:51,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {7307#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7308#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:51,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {7307#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7307#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:51,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {7306#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7307#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:51,396 INFO L290 TraceCheckUtils]: 4: Hoare triple {7306#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7306#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:51,396 INFO L290 TraceCheckUtils]: 3: Hoare triple {7336#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {7306#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:51,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {7336#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {7336#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:51,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {7303#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {7336#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:51,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {7303#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); {7303#true} is VALID [2022-02-21 03:36:51,398 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 176 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:51,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099900873] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:51,398 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:51,398 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 40 [2022-02-21 03:36:51,398 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343877316] [2022-02-21 03:36:51,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:51,452 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:51,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-02-21 03:36:51,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=1245, Unknown=0, NotChecked=0, Total=1640 [2022-02-21 03:36:51,454 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. cyclomatic complexity: 17 Second operand has 41 states, 40 states have (on average 2.55) internal successors, (102), 41 states have internal predecessors, (102), 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-21 03:36:53,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:53,068 INFO L93 Difference]: Finished difference Result 323 states and 374 transitions. [2022-02-21 03:36:53,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-21 03:36:53,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 41 states, 40 states have (on average 2.55) internal successors, (102), 41 states have internal predecessors, (102), 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-21 03:36:53,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:53,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 323 states and 374 transitions. [2022-02-21 03:36:53,165 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:36:53,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 323 states to 186 states and 214 transitions. [2022-02-21 03:36:53,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 161 [2022-02-21 03:36:53,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 161 [2022-02-21 03:36:53,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 214 transitions. [2022-02-21 03:36:53,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:53,169 INFO L681 BuchiCegarLoop]: Abstraction has 186 states and 214 transitions. [2022-02-21 03:36:53,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 214 transitions. [2022-02-21 03:36:53,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 108. [2022-02-21 03:36:53,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:53,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states and 214 transitions. Second operand has 108 states, 108 states have (on average 1.1388888888888888) internal successors, (123), 107 states have internal predecessors, (123), 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-21 03:36:53,179 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states and 214 transitions. Second operand has 108 states, 108 states have (on average 1.1388888888888888) internal successors, (123), 107 states have internal predecessors, (123), 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-21 03:36:53,179 INFO L87 Difference]: Start difference. First operand 186 states and 214 transitions. Second operand has 108 states, 108 states have (on average 1.1388888888888888) internal successors, (123), 107 states have internal predecessors, (123), 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-21 03:36:53,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:53,182 INFO L93 Difference]: Finished difference Result 186 states and 214 transitions. [2022-02-21 03:36:53,182 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 214 transitions. [2022-02-21 03:36:53,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:53,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:53,182 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 108 states have (on average 1.1388888888888888) internal successors, (123), 107 states have internal predecessors, (123), 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 186 states and 214 transitions. [2022-02-21 03:36:53,183 INFO L87 Difference]: Start difference. First operand has 108 states, 108 states have (on average 1.1388888888888888) internal successors, (123), 107 states have internal predecessors, (123), 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 186 states and 214 transitions. [2022-02-21 03:36:53,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:53,185 INFO L93 Difference]: Finished difference Result 186 states and 214 transitions. [2022-02-21 03:36:53,185 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 214 transitions. [2022-02-21 03:36:53,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:53,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:53,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:53,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:53,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 108 states have (on average 1.1388888888888888) internal successors, (123), 107 states have internal predecessors, (123), 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-21 03:36:53,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 123 transitions. [2022-02-21 03:36:53,188 INFO L704 BuchiCegarLoop]: Abstraction has 108 states and 123 transitions. [2022-02-21 03:36:53,188 INFO L587 BuchiCegarLoop]: Abstraction has 108 states and 123 transitions. [2022-02-21 03:36:53,188 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2022-02-21 03:36:53,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 123 transitions. [2022-02-21 03:36:53,189 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:36:53,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:53,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:53,189 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [12, 12, 12, 11, 11, 1, 1, 1, 1] [2022-02-21 03:36:53,189 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:53,190 INFO L791 eck$LassoCheckResult]: Stem: 8047#ULTIMATE.startENTRY 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); 8048#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; 8053#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 8067#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 8068#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 8056#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 8057#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 8092#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 8091#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 8090#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 8089#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 8088#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 8087#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 8086#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 8085#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 8084#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 8083#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 8082#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 8081#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 8080#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 8079#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 8078#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 8077#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 8076#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 8075#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 8071#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 8070#L27-3 assume !(main_~i~0#1 < main_~num~0#1); 8058#L27-4 main_~i~0#1 := 0; 8059#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 8150#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 8102#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 8100#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 8101#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 8105#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 8149#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 8146#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 8144#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 8143#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 8140#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 8138#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 8137#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 8134#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 8132#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 8131#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 8128#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 8126#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 8125#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 8122#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 8120#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 8119#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 8116#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 8114#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 8113#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 8111#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 8109#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 8108#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 8064#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 8052#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 8061#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 8066#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 8097#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 8096#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 8073#L34 [2022-02-21 03:36:53,190 INFO L793 eck$LassoCheckResult]: Loop: 8073#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 8074#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 8072#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 8073#L34 [2022-02-21 03:36:53,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:53,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1940425887, now seen corresponding path program 22 times [2022-02-21 03:36:53,193 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:53,193 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709986686] [2022-02-21 03:36:53,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:53,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:53,280 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:53,339 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:53,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:53,343 INFO L85 PathProgramCache]: Analyzing trace with hash 69557, now seen corresponding path program 13 times [2022-02-21 03:36:53,343 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:53,344 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720429630] [2022-02-21 03:36:53,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:53,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:53,348 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:53,350 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:53,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:53,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1262722987, now seen corresponding path program 23 times [2022-02-21 03:36:53,352 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:53,352 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747487068] [2022-02-21 03:36:53,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:53,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:53,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {8532#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); {8532#true} is VALID [2022-02-21 03:36:53,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {8532#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {8534#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:53,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {8534#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8534#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:53,729 INFO L290 TraceCheckUtils]: 3: Hoare triple {8534#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8535#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:53,729 INFO L290 TraceCheckUtils]: 4: Hoare triple {8535#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8535#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:53,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {8535#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8536#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:53,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {8536#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8536#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:53,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {8536#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8537#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:53,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {8537#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8537#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:53,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {8537#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8538#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:53,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {8538#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8538#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:53,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {8538#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8539#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:53,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {8539#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8539#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:53,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {8539#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8540#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:53,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {8540#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8540#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:53,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {8540#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8541#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:53,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {8541#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8541#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:53,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {8541#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8542#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:53,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {8542#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8542#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:53,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {8542#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8543#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:53,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {8543#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8543#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:53,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {8543#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8544#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:53,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {8544#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8544#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:53,735 INFO L290 TraceCheckUtils]: 23: Hoare triple {8544#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8545#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:36:53,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {8545#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8545#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:36:53,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {8545#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8546#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:53,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {8546#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !(main_~i~0#1 < main_~num~0#1); {8547#(<= |ULTIMATE.start_main_~num~0#1| 12)} is VALID [2022-02-21 03:36:53,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {8547#(<= |ULTIMATE.start_main_~num~0#1| 12)} main_~i~0#1 := 0; {8548#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 12))} is VALID [2022-02-21 03:36:53,737 INFO L290 TraceCheckUtils]: 28: Hoare triple {8548#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 12))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8548#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 12))} is VALID [2022-02-21 03:36:53,738 INFO L290 TraceCheckUtils]: 29: Hoare triple {8548#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 12))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8548#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 12))} is VALID [2022-02-21 03:36:53,738 INFO L290 TraceCheckUtils]: 30: Hoare triple {8548#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 12))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8549#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:36:53,738 INFO L290 TraceCheckUtils]: 31: Hoare triple {8549#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8549#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:36:53,738 INFO L290 TraceCheckUtils]: 32: Hoare triple {8549#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8549#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:36:53,739 INFO L290 TraceCheckUtils]: 33: Hoare triple {8549#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8550#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:36:53,739 INFO L290 TraceCheckUtils]: 34: Hoare triple {8550#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8550#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:36:53,739 INFO L290 TraceCheckUtils]: 35: Hoare triple {8550#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8550#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:36:53,740 INFO L290 TraceCheckUtils]: 36: Hoare triple {8550#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8551#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:53,740 INFO L290 TraceCheckUtils]: 37: Hoare triple {8551#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8551#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:53,740 INFO L290 TraceCheckUtils]: 38: Hoare triple {8551#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8551#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:53,741 INFO L290 TraceCheckUtils]: 39: Hoare triple {8551#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8552#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:53,741 INFO L290 TraceCheckUtils]: 40: Hoare triple {8552#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8552#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:53,741 INFO L290 TraceCheckUtils]: 41: Hoare triple {8552#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8552#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:53,742 INFO L290 TraceCheckUtils]: 42: Hoare triple {8552#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8553#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:53,742 INFO L290 TraceCheckUtils]: 43: Hoare triple {8553#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8553#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:53,742 INFO L290 TraceCheckUtils]: 44: Hoare triple {8553#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8553#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:53,743 INFO L290 TraceCheckUtils]: 45: Hoare triple {8553#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8554#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:53,743 INFO L290 TraceCheckUtils]: 46: Hoare triple {8554#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8554#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:53,743 INFO L290 TraceCheckUtils]: 47: Hoare triple {8554#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8554#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:53,744 INFO L290 TraceCheckUtils]: 48: Hoare triple {8554#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8555#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:53,744 INFO L290 TraceCheckUtils]: 49: Hoare triple {8555#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8555#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:53,744 INFO L290 TraceCheckUtils]: 50: Hoare triple {8555#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8555#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:53,745 INFO L290 TraceCheckUtils]: 51: Hoare triple {8555#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8556#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:53,745 INFO L290 TraceCheckUtils]: 52: Hoare triple {8556#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8556#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:53,745 INFO L290 TraceCheckUtils]: 53: Hoare triple {8556#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8556#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:53,745 INFO L290 TraceCheckUtils]: 54: Hoare triple {8556#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8557#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:53,746 INFO L290 TraceCheckUtils]: 55: Hoare triple {8557#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8557#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:53,746 INFO L290 TraceCheckUtils]: 56: Hoare triple {8557#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8557#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:53,746 INFO L290 TraceCheckUtils]: 57: Hoare triple {8557#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8558#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:53,747 INFO L290 TraceCheckUtils]: 58: Hoare triple {8558#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8558#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:53,747 INFO L290 TraceCheckUtils]: 59: Hoare triple {8558#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8558#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:53,747 INFO L290 TraceCheckUtils]: 60: Hoare triple {8558#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8559#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:53,748 INFO L290 TraceCheckUtils]: 61: Hoare triple {8559#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8559#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:53,748 INFO L290 TraceCheckUtils]: 62: Hoare triple {8559#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8559#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:53,748 INFO L290 TraceCheckUtils]: 63: Hoare triple {8559#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8560#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:36:53,749 INFO L290 TraceCheckUtils]: 64: Hoare triple {8560#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8533#false} is VALID [2022-02-21 03:36:53,749 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 176 proven. 178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:53,749 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:53,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747487068] [2022-02-21 03:36:53,749 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747487068] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:53,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067589885] [2022-02-21 03:36:53,749 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-21 03:36:53,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:53,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:53,751 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:53,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-02-21 03:36:54,042 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2022-02-21 03:36:54,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:36:54,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-21 03:36:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:54,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:54,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {8532#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); {8532#true} is VALID [2022-02-21 03:36:54,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {8532#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {8567#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:54,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {8567#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8567#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:54,900 INFO L290 TraceCheckUtils]: 3: Hoare triple {8567#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8535#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:54,900 INFO L290 TraceCheckUtils]: 4: Hoare triple {8535#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8535#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:54,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {8535#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8536#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:54,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {8536#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8536#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:54,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {8536#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8537#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:54,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {8537#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8537#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:54,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {8537#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8538#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:54,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {8538#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8538#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:54,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {8538#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8539#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:54,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {8539#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8539#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:54,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {8539#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8540#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:54,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {8540#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8540#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:54,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {8540#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8541#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:54,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {8541#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8541#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:54,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {8541#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8542#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:54,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {8542#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8542#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:54,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {8542#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8543#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:54,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {8543#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8543#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:54,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {8543#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8544#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:54,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {8544#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8544#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:54,906 INFO L290 TraceCheckUtils]: 23: Hoare triple {8544#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8545#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:36:54,907 INFO L290 TraceCheckUtils]: 24: Hoare triple {8545#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8545#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:36:54,907 INFO L290 TraceCheckUtils]: 25: Hoare triple {8545#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8546#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:54,907 INFO L290 TraceCheckUtils]: 26: Hoare triple {8546#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !(main_~i~0#1 < main_~num~0#1); {8547#(<= |ULTIMATE.start_main_~num~0#1| 12)} is VALID [2022-02-21 03:36:54,908 INFO L290 TraceCheckUtils]: 27: Hoare triple {8547#(<= |ULTIMATE.start_main_~num~0#1| 12)} main_~i~0#1 := 0; {8646#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} is VALID [2022-02-21 03:36:54,908 INFO L290 TraceCheckUtils]: 28: Hoare triple {8646#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8646#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} is VALID [2022-02-21 03:36:54,908 INFO L290 TraceCheckUtils]: 29: Hoare triple {8646#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8646#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} is VALID [2022-02-21 03:36:54,909 INFO L290 TraceCheckUtils]: 30: Hoare triple {8646#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8656#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} is VALID [2022-02-21 03:36:54,909 INFO L290 TraceCheckUtils]: 31: Hoare triple {8656#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8656#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} is VALID [2022-02-21 03:36:54,910 INFO L290 TraceCheckUtils]: 32: Hoare triple {8656#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8656#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} is VALID [2022-02-21 03:36:54,910 INFO L290 TraceCheckUtils]: 33: Hoare triple {8656#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8666#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:54,911 INFO L290 TraceCheckUtils]: 34: Hoare triple {8666#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8666#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:54,911 INFO L290 TraceCheckUtils]: 35: Hoare triple {8666#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8666#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:54,911 INFO L290 TraceCheckUtils]: 36: Hoare triple {8666#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8676#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} is VALID [2022-02-21 03:36:54,912 INFO L290 TraceCheckUtils]: 37: Hoare triple {8676#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8676#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} is VALID [2022-02-21 03:36:54,912 INFO L290 TraceCheckUtils]: 38: Hoare triple {8676#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8676#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} is VALID [2022-02-21 03:36:54,913 INFO L290 TraceCheckUtils]: 39: Hoare triple {8676#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8686#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:54,913 INFO L290 TraceCheckUtils]: 40: Hoare triple {8686#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 4 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8686#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:54,913 INFO L290 TraceCheckUtils]: 41: Hoare triple {8686#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 4 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8686#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:54,914 INFO L290 TraceCheckUtils]: 42: Hoare triple {8686#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 4 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8696#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} is VALID [2022-02-21 03:36:54,914 INFO L290 TraceCheckUtils]: 43: Hoare triple {8696#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8696#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} is VALID [2022-02-21 03:36:54,915 INFO L290 TraceCheckUtils]: 44: Hoare triple {8696#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8696#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} is VALID [2022-02-21 03:36:54,915 INFO L290 TraceCheckUtils]: 45: Hoare triple {8696#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8706#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:54,916 INFO L290 TraceCheckUtils]: 46: Hoare triple {8706#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8706#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:54,916 INFO L290 TraceCheckUtils]: 47: Hoare triple {8706#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 6 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8706#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:54,917 INFO L290 TraceCheckUtils]: 48: Hoare triple {8706#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8716#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} is VALID [2022-02-21 03:36:54,917 INFO L290 TraceCheckUtils]: 49: Hoare triple {8716#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8716#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} is VALID [2022-02-21 03:36:54,917 INFO L290 TraceCheckUtils]: 50: Hoare triple {8716#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8716#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} is VALID [2022-02-21 03:36:54,918 INFO L290 TraceCheckUtils]: 51: Hoare triple {8716#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8726#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 8 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:54,918 INFO L290 TraceCheckUtils]: 52: Hoare triple {8726#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 8 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8726#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 8 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:54,919 INFO L290 TraceCheckUtils]: 53: Hoare triple {8726#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 8 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8726#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 8 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:54,919 INFO L290 TraceCheckUtils]: 54: Hoare triple {8726#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 8 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8736#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:54,920 INFO L290 TraceCheckUtils]: 55: Hoare triple {8736#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 9 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8736#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:54,920 INFO L290 TraceCheckUtils]: 56: Hoare triple {8736#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 9 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8736#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:54,920 INFO L290 TraceCheckUtils]: 57: Hoare triple {8736#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 9 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8746#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} is VALID [2022-02-21 03:36:54,921 INFO L290 TraceCheckUtils]: 58: Hoare triple {8746#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8746#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} is VALID [2022-02-21 03:36:54,921 INFO L290 TraceCheckUtils]: 59: Hoare triple {8746#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8746#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} is VALID [2022-02-21 03:36:54,922 INFO L290 TraceCheckUtils]: 60: Hoare triple {8746#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8756#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 11 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:54,922 INFO L290 TraceCheckUtils]: 61: Hoare triple {8756#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 11 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8756#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 11 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:54,922 INFO L290 TraceCheckUtils]: 62: Hoare triple {8756#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 11 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8756#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 11 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:54,923 INFO L290 TraceCheckUtils]: 63: Hoare triple {8756#(and (<= |ULTIMATE.start_main_~num~0#1| 12) (<= 11 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8766#(and (<= 12 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} is VALID [2022-02-21 03:36:54,923 INFO L290 TraceCheckUtils]: 64: Hoare triple {8766#(and (<= 12 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 12))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8533#false} is VALID [2022-02-21 03:36:54,924 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 210 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:54,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:55,386 INFO L290 TraceCheckUtils]: 64: Hoare triple {8560#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8533#false} is VALID [2022-02-21 03:36:55,387 INFO L290 TraceCheckUtils]: 63: Hoare triple {8559#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8560#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:36:55,388 INFO L290 TraceCheckUtils]: 62: Hoare triple {8559#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8559#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:55,388 INFO L290 TraceCheckUtils]: 61: Hoare triple {8559#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8559#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:55,388 INFO L290 TraceCheckUtils]: 60: Hoare triple {8558#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8559#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:55,389 INFO L290 TraceCheckUtils]: 59: Hoare triple {8558#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8558#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:55,389 INFO L290 TraceCheckUtils]: 58: Hoare triple {8558#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8558#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:55,390 INFO L290 TraceCheckUtils]: 57: Hoare triple {8557#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8558#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:55,390 INFO L290 TraceCheckUtils]: 56: Hoare triple {8557#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8557#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:55,390 INFO L290 TraceCheckUtils]: 55: Hoare triple {8557#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8557#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:55,391 INFO L290 TraceCheckUtils]: 54: Hoare triple {8556#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8557#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:55,391 INFO L290 TraceCheckUtils]: 53: Hoare triple {8556#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8556#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:55,392 INFO L290 TraceCheckUtils]: 52: Hoare triple {8556#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8556#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:55,392 INFO L290 TraceCheckUtils]: 51: Hoare triple {8555#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8556#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:55,392 INFO L290 TraceCheckUtils]: 50: Hoare triple {8555#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8555#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:55,393 INFO L290 TraceCheckUtils]: 49: Hoare triple {8555#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8555#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:55,393 INFO L290 TraceCheckUtils]: 48: Hoare triple {8554#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8555#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:55,394 INFO L290 TraceCheckUtils]: 47: Hoare triple {8554#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8554#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:55,394 INFO L290 TraceCheckUtils]: 46: Hoare triple {8554#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8554#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:55,394 INFO L290 TraceCheckUtils]: 45: Hoare triple {8553#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8554#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:55,395 INFO L290 TraceCheckUtils]: 44: Hoare triple {8553#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8553#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:55,399 INFO L290 TraceCheckUtils]: 43: Hoare triple {8553#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8553#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:55,400 INFO L290 TraceCheckUtils]: 42: Hoare triple {8552#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8553#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:55,400 INFO L290 TraceCheckUtils]: 41: Hoare triple {8552#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8552#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:55,401 INFO L290 TraceCheckUtils]: 40: Hoare triple {8552#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8552#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:55,402 INFO L290 TraceCheckUtils]: 39: Hoare triple {8551#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8552#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:55,402 INFO L290 TraceCheckUtils]: 38: Hoare triple {8551#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8551#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:55,402 INFO L290 TraceCheckUtils]: 37: Hoare triple {8551#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8551#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:55,403 INFO L290 TraceCheckUtils]: 36: Hoare triple {8550#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8551#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:55,403 INFO L290 TraceCheckUtils]: 35: Hoare triple {8550#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8550#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:36:55,403 INFO L290 TraceCheckUtils]: 34: Hoare triple {8550#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8550#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:36:55,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {8549#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8550#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:36:55,404 INFO L290 TraceCheckUtils]: 32: Hoare triple {8549#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8549#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:36:55,405 INFO L290 TraceCheckUtils]: 31: Hoare triple {8549#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8549#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:36:55,405 INFO L290 TraceCheckUtils]: 30: Hoare triple {8872#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {8549#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:36:55,406 INFO L290 TraceCheckUtils]: 29: Hoare triple {8872#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {8872#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} is VALID [2022-02-21 03:36:55,406 INFO L290 TraceCheckUtils]: 28: Hoare triple {8872#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {8872#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} is VALID [2022-02-21 03:36:55,407 INFO L290 TraceCheckUtils]: 27: Hoare triple {8547#(<= |ULTIMATE.start_main_~num~0#1| 12)} main_~i~0#1 := 0; {8872#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} is VALID [2022-02-21 03:36:55,407 INFO L290 TraceCheckUtils]: 26: Hoare triple {8546#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !(main_~i~0#1 < main_~num~0#1); {8547#(<= |ULTIMATE.start_main_~num~0#1| 12)} is VALID [2022-02-21 03:36:55,408 INFO L290 TraceCheckUtils]: 25: Hoare triple {8545#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8546#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:55,408 INFO L290 TraceCheckUtils]: 24: Hoare triple {8545#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8545#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:36:55,408 INFO L290 TraceCheckUtils]: 23: Hoare triple {8544#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8545#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:36:55,409 INFO L290 TraceCheckUtils]: 22: Hoare triple {8544#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8544#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:55,409 INFO L290 TraceCheckUtils]: 21: Hoare triple {8543#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8544#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:55,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {8543#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8543#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:55,410 INFO L290 TraceCheckUtils]: 19: Hoare triple {8542#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8543#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:55,410 INFO L290 TraceCheckUtils]: 18: Hoare triple {8542#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8542#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:55,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {8541#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8542#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:55,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {8541#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8541#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:55,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {8540#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8541#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:55,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {8540#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8540#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:55,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {8539#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8540#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:55,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {8539#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8539#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:55,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {8538#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8539#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:55,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {8538#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8538#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:55,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {8537#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8538#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:55,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {8537#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8537#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:55,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {8536#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8537#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:55,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {8536#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8536#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:55,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {8535#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8536#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:55,416 INFO L290 TraceCheckUtils]: 4: Hoare triple {8535#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8535#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:55,417 INFO L290 TraceCheckUtils]: 3: Hoare triple {8567#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {8535#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:55,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {8567#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {8567#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:55,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {8532#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {8567#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:55,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {8532#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); {8532#true} is VALID [2022-02-21 03:36:55,418 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 210 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:55,418 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067589885] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:55,418 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:55,418 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 43 [2022-02-21 03:36:55,418 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329534987] [2022-02-21 03:36:55,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:55,465 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:55,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-02-21 03:36:55,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1439, Unknown=0, NotChecked=0, Total=1892 [2022-02-21 03:36:55,466 INFO L87 Difference]: Start difference. First operand 108 states and 123 transitions. cyclomatic complexity: 18 Second operand has 44 states, 43 states have (on average 2.558139534883721) internal successors, (110), 44 states have internal predecessors, (110), 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-21 03:36:57,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:57,304 INFO L93 Difference]: Finished difference Result 349 states and 404 transitions. [2022-02-21 03:36:57,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-21 03:36:57,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 44 states, 43 states have (on average 2.558139534883721) internal successors, (110), 44 states have internal predecessors, (110), 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-21 03:36:57,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:57,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 349 states and 404 transitions. [2022-02-21 03:36:57,399 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:36:57,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 349 states to 200 states and 230 transitions. [2022-02-21 03:36:57,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 173 [2022-02-21 03:36:57,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 173 [2022-02-21 03:36:57,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 200 states and 230 transitions. [2022-02-21 03:36:57,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:57,403 INFO L681 BuchiCegarLoop]: Abstraction has 200 states and 230 transitions. [2022-02-21 03:36:57,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states and 230 transitions. [2022-02-21 03:36:57,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 116. [2022-02-21 03:36:57,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:57,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states and 230 transitions. Second operand has 116 states, 116 states have (on average 1.1379310344827587) internal successors, (132), 115 states have internal predecessors, (132), 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-21 03:36:57,405 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states and 230 transitions. Second operand has 116 states, 116 states have (on average 1.1379310344827587) internal successors, (132), 115 states have internal predecessors, (132), 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-21 03:36:57,406 INFO L87 Difference]: Start difference. First operand 200 states and 230 transitions. Second operand has 116 states, 116 states have (on average 1.1379310344827587) internal successors, (132), 115 states have internal predecessors, (132), 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-21 03:36:57,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:57,409 INFO L93 Difference]: Finished difference Result 200 states and 230 transitions. [2022-02-21 03:36:57,409 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 230 transitions. [2022-02-21 03:36:57,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:57,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:57,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 116 states have (on average 1.1379310344827587) internal successors, (132), 115 states have internal predecessors, (132), 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 200 states and 230 transitions. [2022-02-21 03:36:57,410 INFO L87 Difference]: Start difference. First operand has 116 states, 116 states have (on average 1.1379310344827587) internal successors, (132), 115 states have internal predecessors, (132), 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 200 states and 230 transitions. [2022-02-21 03:36:57,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:57,413 INFO L93 Difference]: Finished difference Result 200 states and 230 transitions. [2022-02-21 03:36:57,413 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 230 transitions. [2022-02-21 03:36:57,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:57,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:57,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:57,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:57,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 116 states have (on average 1.1379310344827587) internal successors, (132), 115 states have internal predecessors, (132), 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-21 03:36:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 132 transitions. [2022-02-21 03:36:57,415 INFO L704 BuchiCegarLoop]: Abstraction has 116 states and 132 transitions. [2022-02-21 03:36:57,415 INFO L587 BuchiCegarLoop]: Abstraction has 116 states and 132 transitions. [2022-02-21 03:36:57,415 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2022-02-21 03:36:57,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 132 transitions. [2022-02-21 03:36:57,416 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:36:57,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:57,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:57,417 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [13, 13, 13, 12, 12, 1, 1, 1, 1] [2022-02-21 03:36:57,417 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:36:57,417 INFO L791 eck$LassoCheckResult]: Stem: 9337#ULTIMATE.startENTRY 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); 9338#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; 9343#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 9358#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 9359#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 9346#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 9347#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 9385#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 9384#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 9383#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 9382#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 9381#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 9380#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 9379#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 9378#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 9377#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 9376#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 9375#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 9374#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 9373#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 9372#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 9371#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 9370#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 9369#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 9368#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 9367#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 9366#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 9362#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 9361#L27-3 assume !(main_~i~0#1 < main_~num~0#1); 9348#L27-4 main_~i~0#1 := 0; 9349#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 9393#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 9394#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 9395#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 9399#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 9398#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 9447#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 9444#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 9442#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 9441#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 9438#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 9436#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 9435#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 9432#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 9430#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 9429#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 9426#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 9424#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 9423#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 9420#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 9418#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 9417#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 9414#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 9412#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 9411#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 9408#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 9406#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 9405#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 9403#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 9402#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 9401#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 9355#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 9342#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 9352#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 9357#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 9390#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 9389#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 9364#L34 [2022-02-21 03:36:57,417 INFO L793 eck$LassoCheckResult]: Loop: 9364#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 9365#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 9363#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 9364#L34 [2022-02-21 03:36:57,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:57,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1264665709, now seen corresponding path program 24 times [2022-02-21 03:36:57,418 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:57,418 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287465696] [2022-02-21 03:36:57,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:57,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:57,490 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:57,567 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:57,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:57,568 INFO L85 PathProgramCache]: Analyzing trace with hash 69557, now seen corresponding path program 14 times [2022-02-21 03:36:57,568 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:57,569 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679179027] [2022-02-21 03:36:57,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:57,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:57,574 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:57,580 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:57,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:57,581 INFO L85 PathProgramCache]: Analyzing trace with hash -202976541, now seen corresponding path program 25 times [2022-02-21 03:36:57,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:57,581 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779777097] [2022-02-21 03:36:57,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:57,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:58,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {9858#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); {9858#true} is VALID [2022-02-21 03:36:58,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {9858#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {9860#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:58,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {9860#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9860#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:58,005 INFO L290 TraceCheckUtils]: 3: Hoare triple {9860#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9861#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:58,005 INFO L290 TraceCheckUtils]: 4: Hoare triple {9861#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9861#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:58,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {9861#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9862#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:58,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {9862#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9862#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:58,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {9862#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9863#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:58,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {9863#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9863#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:58,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {9863#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9864#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:58,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {9864#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9864#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:58,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {9864#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9865#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:58,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {9865#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9865#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:58,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {9865#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9866#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:58,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {9866#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9866#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:58,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {9866#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9867#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:58,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {9867#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9867#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:58,011 INFO L290 TraceCheckUtils]: 17: Hoare triple {9867#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9868#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:58,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {9868#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9868#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:58,011 INFO L290 TraceCheckUtils]: 19: Hoare triple {9868#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9869#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:58,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {9869#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9869#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:58,012 INFO L290 TraceCheckUtils]: 21: Hoare triple {9869#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9870#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:58,013 INFO L290 TraceCheckUtils]: 22: Hoare triple {9870#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9870#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:58,013 INFO L290 TraceCheckUtils]: 23: Hoare triple {9870#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9871#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:36:58,013 INFO L290 TraceCheckUtils]: 24: Hoare triple {9871#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9871#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:36:58,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {9871#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9872#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:58,014 INFO L290 TraceCheckUtils]: 26: Hoare triple {9872#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9872#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:58,015 INFO L290 TraceCheckUtils]: 27: Hoare triple {9872#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9873#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:36:58,015 INFO L290 TraceCheckUtils]: 28: Hoare triple {9873#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !(main_~i~0#1 < main_~num~0#1); {9874#(<= |ULTIMATE.start_main_~num~0#1| 13)} is VALID [2022-02-21 03:36:58,015 INFO L290 TraceCheckUtils]: 29: Hoare triple {9874#(<= |ULTIMATE.start_main_~num~0#1| 13)} main_~i~0#1 := 0; {9875#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 13))} is VALID [2022-02-21 03:36:58,016 INFO L290 TraceCheckUtils]: 30: Hoare triple {9875#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 13))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {9875#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 13))} is VALID [2022-02-21 03:36:58,016 INFO L290 TraceCheckUtils]: 31: Hoare triple {9875#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 13))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {9875#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 13))} is VALID [2022-02-21 03:36:58,017 INFO L290 TraceCheckUtils]: 32: Hoare triple {9875#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 13))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {9876#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} is VALID [2022-02-21 03:36:58,017 INFO L290 TraceCheckUtils]: 33: Hoare triple {9876#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {9876#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} is VALID [2022-02-21 03:36:58,018 INFO L290 TraceCheckUtils]: 34: Hoare triple {9876#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {9876#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} is VALID [2022-02-21 03:36:58,018 INFO L290 TraceCheckUtils]: 35: Hoare triple {9876#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {9877#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:36:58,019 INFO L290 TraceCheckUtils]: 36: Hoare triple {9877#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {9877#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:36:58,019 INFO L290 TraceCheckUtils]: 37: Hoare triple {9877#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {9877#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:36:58,020 INFO L290 TraceCheckUtils]: 38: Hoare triple {9877#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {9878#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:36:58,020 INFO L290 TraceCheckUtils]: 39: Hoare triple {9878#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {9878#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:36:58,020 INFO L290 TraceCheckUtils]: 40: Hoare triple {9878#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {9878#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:36:58,021 INFO L290 TraceCheckUtils]: 41: Hoare triple {9878#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {9879#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:58,021 INFO L290 TraceCheckUtils]: 42: Hoare triple {9879#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {9879#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:58,022 INFO L290 TraceCheckUtils]: 43: Hoare triple {9879#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {9879#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:58,022 INFO L290 TraceCheckUtils]: 44: Hoare triple {9879#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {9880#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:58,023 INFO L290 TraceCheckUtils]: 45: Hoare triple {9880#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {9880#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:58,023 INFO L290 TraceCheckUtils]: 46: Hoare triple {9880#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {9880#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:58,024 INFO L290 TraceCheckUtils]: 47: Hoare triple {9880#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {9881#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:58,024 INFO L290 TraceCheckUtils]: 48: Hoare triple {9881#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {9881#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:58,024 INFO L290 TraceCheckUtils]: 49: Hoare triple {9881#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {9881#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:58,025 INFO L290 TraceCheckUtils]: 50: Hoare triple {9881#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {9882#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:58,025 INFO L290 TraceCheckUtils]: 51: Hoare triple {9882#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {9882#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:58,026 INFO L290 TraceCheckUtils]: 52: Hoare triple {9882#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {9882#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:58,026 INFO L290 TraceCheckUtils]: 53: Hoare triple {9882#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {9883#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:58,027 INFO L290 TraceCheckUtils]: 54: Hoare triple {9883#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {9883#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:58,027 INFO L290 TraceCheckUtils]: 55: Hoare triple {9883#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {9883#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:58,028 INFO L290 TraceCheckUtils]: 56: Hoare triple {9883#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {9884#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:58,028 INFO L290 TraceCheckUtils]: 57: Hoare triple {9884#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {9884#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:58,028 INFO L290 TraceCheckUtils]: 58: Hoare triple {9884#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {9884#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:58,029 INFO L290 TraceCheckUtils]: 59: Hoare triple {9884#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {9885#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:58,030 INFO L290 TraceCheckUtils]: 60: Hoare triple {9885#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {9885#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:58,030 INFO L290 TraceCheckUtils]: 61: Hoare triple {9885#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {9885#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:58,030 INFO L290 TraceCheckUtils]: 62: Hoare triple {9885#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {9886#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:58,031 INFO L290 TraceCheckUtils]: 63: Hoare triple {9886#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {9886#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:58,031 INFO L290 TraceCheckUtils]: 64: Hoare triple {9886#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {9886#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:58,032 INFO L290 TraceCheckUtils]: 65: Hoare triple {9886#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {9887#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:58,032 INFO L290 TraceCheckUtils]: 66: Hoare triple {9887#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {9887#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:58,033 INFO L290 TraceCheckUtils]: 67: Hoare triple {9887#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {9887#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:58,033 INFO L290 TraceCheckUtils]: 68: Hoare triple {9887#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {9888#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:36:58,034 INFO L290 TraceCheckUtils]: 69: Hoare triple {9888#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {9859#false} is VALID [2022-02-21 03:36:58,034 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 210 proven. 206 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:58,034 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:58,034 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779777097] [2022-02-21 03:36:58,034 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779777097] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:58,034 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000314476] [2022-02-21 03:36:58,035 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-21 03:36:58,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:58,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:58,042 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:58,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-02-21 03:36:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:58,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 30 conjunts are in the unsatisfiable core [2022-02-21 03:36:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:58,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:59,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {9858#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); {9858#true} is VALID [2022-02-21 03:36:59,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {9858#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {9895#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:59,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {9895#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9895#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:59,166 INFO L290 TraceCheckUtils]: 3: Hoare triple {9895#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9861#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:59,166 INFO L290 TraceCheckUtils]: 4: Hoare triple {9861#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9861#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:59,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {9861#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9862#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:59,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {9862#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9862#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:59,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {9862#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9863#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:59,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {9863#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9863#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:59,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {9863#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9864#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:59,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {9864#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9864#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:59,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {9864#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9865#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:59,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {9865#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9865#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:59,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {9865#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9866#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:59,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {9866#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9866#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:59,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {9866#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9867#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:59,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {9867#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9867#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:59,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {9867#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9868#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:59,171 INFO L290 TraceCheckUtils]: 18: Hoare triple {9868#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9868#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:59,171 INFO L290 TraceCheckUtils]: 19: Hoare triple {9868#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9869#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:59,171 INFO L290 TraceCheckUtils]: 20: Hoare triple {9869#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9869#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:59,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {9869#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9870#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:59,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {9870#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9870#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:59,172 INFO L290 TraceCheckUtils]: 23: Hoare triple {9870#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9871#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:36:59,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {9871#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9871#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:36:59,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {9871#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9872#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:59,173 INFO L290 TraceCheckUtils]: 26: Hoare triple {9872#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9872#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:59,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {9872#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9873#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:36:59,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {9873#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !(main_~i~0#1 < main_~num~0#1); {9874#(<= |ULTIMATE.start_main_~num~0#1| 13)} is VALID [2022-02-21 03:36:59,174 INFO L290 TraceCheckUtils]: 29: Hoare triple {9874#(<= |ULTIMATE.start_main_~num~0#1| 13)} main_~i~0#1 := 0; {9980#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,175 INFO L290 TraceCheckUtils]: 30: Hoare triple {9980#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {9980#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,175 INFO L290 TraceCheckUtils]: 31: Hoare triple {9980#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {9980#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,176 INFO L290 TraceCheckUtils]: 32: Hoare triple {9980#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 0 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {9990#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} is VALID [2022-02-21 03:36:59,176 INFO L290 TraceCheckUtils]: 33: Hoare triple {9990#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {9990#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} is VALID [2022-02-21 03:36:59,176 INFO L290 TraceCheckUtils]: 34: Hoare triple {9990#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {9990#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} is VALID [2022-02-21 03:36:59,177 INFO L290 TraceCheckUtils]: 35: Hoare triple {9990#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {10000#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,177 INFO L290 TraceCheckUtils]: 36: Hoare triple {10000#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {10000#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,178 INFO L290 TraceCheckUtils]: 37: Hoare triple {10000#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {10000#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,178 INFO L290 TraceCheckUtils]: 38: Hoare triple {10000#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {10010#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} is VALID [2022-02-21 03:36:59,179 INFO L290 TraceCheckUtils]: 39: Hoare triple {10010#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {10010#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} is VALID [2022-02-21 03:36:59,179 INFO L290 TraceCheckUtils]: 40: Hoare triple {10010#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {10010#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} is VALID [2022-02-21 03:36:59,179 INFO L290 TraceCheckUtils]: 41: Hoare triple {10010#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {10020#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,180 INFO L290 TraceCheckUtils]: 42: Hoare triple {10020#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 4 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {10020#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,180 INFO L290 TraceCheckUtils]: 43: Hoare triple {10020#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 4 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {10020#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,181 INFO L290 TraceCheckUtils]: 44: Hoare triple {10020#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 4 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {10030#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} is VALID [2022-02-21 03:36:59,181 INFO L290 TraceCheckUtils]: 45: Hoare triple {10030#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {10030#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} is VALID [2022-02-21 03:36:59,181 INFO L290 TraceCheckUtils]: 46: Hoare triple {10030#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {10030#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} is VALID [2022-02-21 03:36:59,182 INFO L290 TraceCheckUtils]: 47: Hoare triple {10030#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {10040#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,182 INFO L290 TraceCheckUtils]: 48: Hoare triple {10040#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {10040#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,183 INFO L290 TraceCheckUtils]: 49: Hoare triple {10040#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 6 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {10040#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,183 INFO L290 TraceCheckUtils]: 50: Hoare triple {10040#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {10050#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} is VALID [2022-02-21 03:36:59,184 INFO L290 TraceCheckUtils]: 51: Hoare triple {10050#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {10050#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} is VALID [2022-02-21 03:36:59,184 INFO L290 TraceCheckUtils]: 52: Hoare triple {10050#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {10050#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} is VALID [2022-02-21 03:36:59,184 INFO L290 TraceCheckUtils]: 53: Hoare triple {10050#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {10060#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 8 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,185 INFO L290 TraceCheckUtils]: 54: Hoare triple {10060#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 8 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {10060#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 8 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,185 INFO L290 TraceCheckUtils]: 55: Hoare triple {10060#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 8 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {10060#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 8 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,186 INFO L290 TraceCheckUtils]: 56: Hoare triple {10060#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 8 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {10070#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,186 INFO L290 TraceCheckUtils]: 57: Hoare triple {10070#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 9 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {10070#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,186 INFO L290 TraceCheckUtils]: 58: Hoare triple {10070#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 9 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {10070#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,187 INFO L290 TraceCheckUtils]: 59: Hoare triple {10070#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 9 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {10080#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} is VALID [2022-02-21 03:36:59,187 INFO L290 TraceCheckUtils]: 60: Hoare triple {10080#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {10080#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} is VALID [2022-02-21 03:36:59,188 INFO L290 TraceCheckUtils]: 61: Hoare triple {10080#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {10080#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} is VALID [2022-02-21 03:36:59,188 INFO L290 TraceCheckUtils]: 62: Hoare triple {10080#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {10090#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 11 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,188 INFO L290 TraceCheckUtils]: 63: Hoare triple {10090#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 11 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {10090#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 11 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,189 INFO L290 TraceCheckUtils]: 64: Hoare triple {10090#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 11 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {10090#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 11 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,189 INFO L290 TraceCheckUtils]: 65: Hoare triple {10090#(and (<= |ULTIMATE.start_main_~num~0#1| 13) (<= 11 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {10100#(and (<= 12 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} is VALID [2022-02-21 03:36:59,190 INFO L290 TraceCheckUtils]: 66: Hoare triple {10100#(and (<= 12 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {10100#(and (<= 12 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} is VALID [2022-02-21 03:36:59,190 INFO L290 TraceCheckUtils]: 67: Hoare triple {10100#(and (<= 12 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {10100#(and (<= 12 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} is VALID [2022-02-21 03:36:59,191 INFO L290 TraceCheckUtils]: 68: Hoare triple {10100#(and (<= 12 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {10110#(and (<= 13 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} is VALID [2022-02-21 03:36:59,191 INFO L290 TraceCheckUtils]: 69: Hoare triple {10110#(and (<= 13 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 13))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {9859#false} is VALID [2022-02-21 03:36:59,191 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 247 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:59,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:59,657 INFO L290 TraceCheckUtils]: 69: Hoare triple {9888#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {9859#false} is VALID [2022-02-21 03:36:59,658 INFO L290 TraceCheckUtils]: 68: Hoare triple {9887#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {9888#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:36:59,658 INFO L290 TraceCheckUtils]: 67: Hoare triple {9887#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {9887#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:59,659 INFO L290 TraceCheckUtils]: 66: Hoare triple {9887#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {9887#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:59,659 INFO L290 TraceCheckUtils]: 65: Hoare triple {9886#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {9887#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:36:59,659 INFO L290 TraceCheckUtils]: 64: Hoare triple {9886#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {9886#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,660 INFO L290 TraceCheckUtils]: 63: Hoare triple {9886#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {9886#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,660 INFO L290 TraceCheckUtils]: 62: Hoare triple {9885#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {9886#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,660 INFO L290 TraceCheckUtils]: 61: Hoare triple {9885#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {9885#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,661 INFO L290 TraceCheckUtils]: 60: Hoare triple {9885#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {9885#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,661 INFO L290 TraceCheckUtils]: 59: Hoare triple {9884#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {9885#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,661 INFO L290 TraceCheckUtils]: 58: Hoare triple {9884#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {9884#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:59,662 INFO L290 TraceCheckUtils]: 57: Hoare triple {9884#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {9884#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:59,662 INFO L290 TraceCheckUtils]: 56: Hoare triple {9883#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {9884#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:36:59,662 INFO L290 TraceCheckUtils]: 55: Hoare triple {9883#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {9883#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,663 INFO L290 TraceCheckUtils]: 54: Hoare triple {9883#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {9883#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,663 INFO L290 TraceCheckUtils]: 53: Hoare triple {9882#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {9883#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,663 INFO L290 TraceCheckUtils]: 52: Hoare triple {9882#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {9882#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,664 INFO L290 TraceCheckUtils]: 51: Hoare triple {9882#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {9882#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,664 INFO L290 TraceCheckUtils]: 50: Hoare triple {9881#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {9882#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,664 INFO L290 TraceCheckUtils]: 49: Hoare triple {9881#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {9881#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,665 INFO L290 TraceCheckUtils]: 48: Hoare triple {9881#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {9881#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,665 INFO L290 TraceCheckUtils]: 47: Hoare triple {9880#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {9881#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,665 INFO L290 TraceCheckUtils]: 46: Hoare triple {9880#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {9880#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:59,666 INFO L290 TraceCheckUtils]: 45: Hoare triple {9880#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {9880#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:59,666 INFO L290 TraceCheckUtils]: 44: Hoare triple {9879#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {9880#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:36:59,666 INFO L290 TraceCheckUtils]: 43: Hoare triple {9879#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {9879#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,667 INFO L290 TraceCheckUtils]: 42: Hoare triple {9879#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {9879#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,667 INFO L290 TraceCheckUtils]: 41: Hoare triple {9878#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {9879#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:36:59,667 INFO L290 TraceCheckUtils]: 40: Hoare triple {9878#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {9878#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:36:59,668 INFO L290 TraceCheckUtils]: 39: Hoare triple {9878#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {9878#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:36:59,668 INFO L290 TraceCheckUtils]: 38: Hoare triple {9877#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {9878#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:36:59,668 INFO L290 TraceCheckUtils]: 37: Hoare triple {9877#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {9877#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:36:59,669 INFO L290 TraceCheckUtils]: 36: Hoare triple {9877#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {9877#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:36:59,669 INFO L290 TraceCheckUtils]: 35: Hoare triple {9876#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {9877#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:36:59,669 INFO L290 TraceCheckUtils]: 34: Hoare triple {9876#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {9876#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} is VALID [2022-02-21 03:36:59,670 INFO L290 TraceCheckUtils]: 33: Hoare triple {9876#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {9876#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} is VALID [2022-02-21 03:36:59,670 INFO L290 TraceCheckUtils]: 32: Hoare triple {10225#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {9876#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} is VALID [2022-02-21 03:36:59,670 INFO L290 TraceCheckUtils]: 31: Hoare triple {10225#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {10225#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} is VALID [2022-02-21 03:36:59,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {10225#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {10225#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} is VALID [2022-02-21 03:36:59,671 INFO L290 TraceCheckUtils]: 29: Hoare triple {9874#(<= |ULTIMATE.start_main_~num~0#1| 13)} main_~i~0#1 := 0; {10225#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} is VALID [2022-02-21 03:36:59,671 INFO L290 TraceCheckUtils]: 28: Hoare triple {9873#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !(main_~i~0#1 < main_~num~0#1); {9874#(<= |ULTIMATE.start_main_~num~0#1| 13)} is VALID [2022-02-21 03:36:59,672 INFO L290 TraceCheckUtils]: 27: Hoare triple {9872#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9873#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:36:59,672 INFO L290 TraceCheckUtils]: 26: Hoare triple {9872#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9872#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:59,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {9871#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9872#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:59,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {9871#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9871#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:36:59,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {9870#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9871#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:36:59,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {9870#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9870#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:59,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {9869#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9870#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:59,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {9869#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9869#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:59,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {9868#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9869#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:59,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {9868#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9868#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:59,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {9867#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9868#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:59,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {9867#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9867#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:59,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {9866#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9867#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:59,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {9866#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9866#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:59,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {9865#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9866#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:59,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {9865#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9865#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:59,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {9864#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9865#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:59,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {9864#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9864#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:59,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {9863#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9864#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:59,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {9863#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9863#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:59,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {9862#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9863#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:59,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {9862#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9862#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:59,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {9861#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9862#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:59,679 INFO L290 TraceCheckUtils]: 4: Hoare triple {9861#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9861#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:59,680 INFO L290 TraceCheckUtils]: 3: Hoare triple {9895#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {9861#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:59,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {9895#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {9895#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:59,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {9858#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {9895#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:59,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {9858#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); {9858#true} is VALID [2022-02-21 03:36:59,681 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 247 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:59,681 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000314476] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:59,681 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:59,681 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 46 [2022-02-21 03:36:59,681 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542486912] [2022-02-21 03:36:59,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:59,720 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:59,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-02-21 03:36:59,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=1647, Unknown=0, NotChecked=0, Total=2162 [2022-02-21 03:36:59,721 INFO L87 Difference]: Start difference. First operand 116 states and 132 transitions. cyclomatic complexity: 19 Second operand has 47 states, 46 states have (on average 2.5652173913043477) internal successors, (118), 47 states have internal predecessors, (118), 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-21 03:37:01,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:01,621 INFO L93 Difference]: Finished difference Result 375 states and 434 transitions. [2022-02-21 03:37:01,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-02-21 03:37:01,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 47 states, 46 states have (on average 2.5652173913043477) internal successors, (118), 47 states have internal predecessors, (118), 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-21 03:37:01,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:01,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 375 states and 434 transitions. [2022-02-21 03:37:01,716 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:37:01,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 375 states to 214 states and 246 transitions. [2022-02-21 03:37:01,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 185 [2022-02-21 03:37:01,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 185 [2022-02-21 03:37:01,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 214 states and 246 transitions. [2022-02-21 03:37:01,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:37:01,721 INFO L681 BuchiCegarLoop]: Abstraction has 214 states and 246 transitions. [2022-02-21 03:37:01,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states and 246 transitions. [2022-02-21 03:37:01,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 124. [2022-02-21 03:37:01,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:01,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 214 states and 246 transitions. Second operand has 124 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 123 states have internal predecessors, (141), 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-21 03:37:01,723 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states and 246 transitions. Second operand has 124 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 123 states have internal predecessors, (141), 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-21 03:37:01,723 INFO L87 Difference]: Start difference. First operand 214 states and 246 transitions. Second operand has 124 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 123 states have internal predecessors, (141), 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-21 03:37:01,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:01,726 INFO L93 Difference]: Finished difference Result 214 states and 246 transitions. [2022-02-21 03:37:01,726 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 246 transitions. [2022-02-21 03:37:01,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:01,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:01,727 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 123 states have internal predecessors, (141), 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 214 states and 246 transitions. [2022-02-21 03:37:01,728 INFO L87 Difference]: Start difference. First operand has 124 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 123 states have internal predecessors, (141), 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 214 states and 246 transitions. [2022-02-21 03:37:01,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:01,731 INFO L93 Difference]: Finished difference Result 214 states and 246 transitions. [2022-02-21 03:37:01,731 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 246 transitions. [2022-02-21 03:37:01,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:01,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:01,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:01,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:01,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 123 states have internal predecessors, (141), 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-21 03:37:01,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 141 transitions. [2022-02-21 03:37:01,733 INFO L704 BuchiCegarLoop]: Abstraction has 124 states and 141 transitions. [2022-02-21 03:37:01,733 INFO L587 BuchiCegarLoop]: Abstraction has 124 states and 141 transitions. [2022-02-21 03:37:01,733 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2022-02-21 03:37:01,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 141 transitions. [2022-02-21 03:37:01,734 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:37:01,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:01,734 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:01,735 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [14, 14, 14, 13, 13, 1, 1, 1, 1] [2022-02-21 03:37:01,735 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:01,735 INFO L791 eck$LassoCheckResult]: Stem: 10724#ULTIMATE.startENTRY 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); 10725#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; 10730#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 10744#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 10745#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 10733#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 10734#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 10773#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 10772#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 10771#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 10770#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 10769#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 10768#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 10767#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 10766#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 10765#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 10764#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 10763#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 10762#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 10761#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 10760#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 10759#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 10758#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 10757#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 10756#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 10755#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 10754#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 10753#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 10752#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 10748#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 10747#L27-3 assume !(main_~i~0#1 < main_~num~0#1); 10735#L27-4 main_~i~0#1 := 0; 10736#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 10842#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 10783#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 10781#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 10782#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 10786#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 10840#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 10837#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 10835#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 10834#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 10831#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 10829#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 10828#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 10825#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 10823#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 10822#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 10819#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 10817#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 10816#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 10813#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 10811#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 10810#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 10807#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 10805#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 10804#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 10801#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 10799#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 10798#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 10795#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 10793#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 10792#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 10791#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 10790#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 10789#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 10741#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 10729#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 10738#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 10743#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 10778#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 10777#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 10750#L34 [2022-02-21 03:37:01,736 INFO L793 eck$LassoCheckResult]: Loop: 10750#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 10751#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 10749#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 10750#L34 [2022-02-21 03:37:01,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:01,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1142017637, now seen corresponding path program 26 times [2022-02-21 03:37:01,736 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:01,736 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270692431] [2022-02-21 03:37:01,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:01,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:01,842 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:01,903 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:01,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:01,904 INFO L85 PathProgramCache]: Analyzing trace with hash 69557, now seen corresponding path program 15 times [2022-02-21 03:37:01,904 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:01,904 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346848205] [2022-02-21 03:37:01,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:01,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:01,910 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:01,914 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:01,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:01,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1411512017, now seen corresponding path program 27 times [2022-02-21 03:37:01,914 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:01,915 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553242654] [2022-02-21 03:37:01,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:01,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:02,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {11281#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); {11281#true} is VALID [2022-02-21 03:37:02,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {11281#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {11283#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:02,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {11283#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11283#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:02,372 INFO L290 TraceCheckUtils]: 3: Hoare triple {11283#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11284#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:37:02,373 INFO L290 TraceCheckUtils]: 4: Hoare triple {11284#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11284#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:37:02,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {11284#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11285#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:02,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {11285#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11285#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:02,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {11285#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11286#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:37:02,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {11286#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11286#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:37:02,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {11286#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11287#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:02,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {11287#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11287#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:02,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {11287#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11288#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:37:02,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {11288#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11288#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:37:02,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {11288#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11289#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:37:02,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {11289#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11289#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:37:02,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {11289#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11290#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:37:02,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {11290#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11290#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:37:02,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {11290#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11291#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:02,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {11291#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11291#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:02,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {11291#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11292#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:37:02,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {11292#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11292#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:37:02,379 INFO L290 TraceCheckUtils]: 21: Hoare triple {11292#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11293#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:02,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {11293#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11293#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:02,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {11293#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11294#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:37:02,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {11294#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11294#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:37:02,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {11294#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11295#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:37:02,381 INFO L290 TraceCheckUtils]: 26: Hoare triple {11295#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11295#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:37:02,382 INFO L290 TraceCheckUtils]: 27: Hoare triple {11295#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11296#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:37:02,382 INFO L290 TraceCheckUtils]: 28: Hoare triple {11296#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11296#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:37:02,383 INFO L290 TraceCheckUtils]: 29: Hoare triple {11296#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11297#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:37:02,383 INFO L290 TraceCheckUtils]: 30: Hoare triple {11297#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !(main_~i~0#1 < main_~num~0#1); {11298#(<= |ULTIMATE.start_main_~num~0#1| 14)} is VALID [2022-02-21 03:37:02,383 INFO L290 TraceCheckUtils]: 31: Hoare triple {11298#(<= |ULTIMATE.start_main_~num~0#1| 14)} main_~i~0#1 := 0; {11299#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 14))} is VALID [2022-02-21 03:37:02,384 INFO L290 TraceCheckUtils]: 32: Hoare triple {11299#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 14))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11299#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 14))} is VALID [2022-02-21 03:37:02,385 INFO L290 TraceCheckUtils]: 33: Hoare triple {11299#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 14))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11299#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 14))} is VALID [2022-02-21 03:37:02,385 INFO L290 TraceCheckUtils]: 34: Hoare triple {11299#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 14))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11300#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} is VALID [2022-02-21 03:37:02,385 INFO L290 TraceCheckUtils]: 35: Hoare triple {11300#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11300#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} is VALID [2022-02-21 03:37:02,386 INFO L290 TraceCheckUtils]: 36: Hoare triple {11300#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11300#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} is VALID [2022-02-21 03:37:02,386 INFO L290 TraceCheckUtils]: 37: Hoare triple {11300#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11301#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} is VALID [2022-02-21 03:37:02,387 INFO L290 TraceCheckUtils]: 38: Hoare triple {11301#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11301#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} is VALID [2022-02-21 03:37:02,387 INFO L290 TraceCheckUtils]: 39: Hoare triple {11301#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11301#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} is VALID [2022-02-21 03:37:02,388 INFO L290 TraceCheckUtils]: 40: Hoare triple {11301#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11302#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:37:02,388 INFO L290 TraceCheckUtils]: 41: Hoare triple {11302#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11302#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:37:02,388 INFO L290 TraceCheckUtils]: 42: Hoare triple {11302#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11302#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:37:02,389 INFO L290 TraceCheckUtils]: 43: Hoare triple {11302#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11303#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:37:02,389 INFO L290 TraceCheckUtils]: 44: Hoare triple {11303#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11303#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:37:02,389 INFO L290 TraceCheckUtils]: 45: Hoare triple {11303#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11303#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:37:02,390 INFO L290 TraceCheckUtils]: 46: Hoare triple {11303#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11304#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:02,390 INFO L290 TraceCheckUtils]: 47: Hoare triple {11304#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11304#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:02,391 INFO L290 TraceCheckUtils]: 48: Hoare triple {11304#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11304#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:02,391 INFO L290 TraceCheckUtils]: 49: Hoare triple {11304#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11305#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:37:02,392 INFO L290 TraceCheckUtils]: 50: Hoare triple {11305#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11305#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:37:02,392 INFO L290 TraceCheckUtils]: 51: Hoare triple {11305#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11305#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:37:02,392 INFO L290 TraceCheckUtils]: 52: Hoare triple {11305#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11306#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:02,393 INFO L290 TraceCheckUtils]: 53: Hoare triple {11306#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11306#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:02,393 INFO L290 TraceCheckUtils]: 54: Hoare triple {11306#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11306#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:02,394 INFO L290 TraceCheckUtils]: 55: Hoare triple {11306#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11307#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:02,394 INFO L290 TraceCheckUtils]: 56: Hoare triple {11307#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11307#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:02,394 INFO L290 TraceCheckUtils]: 57: Hoare triple {11307#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11307#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:02,395 INFO L290 TraceCheckUtils]: 58: Hoare triple {11307#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11308#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:02,399 INFO L290 TraceCheckUtils]: 59: Hoare triple {11308#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11308#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:02,400 INFO L290 TraceCheckUtils]: 60: Hoare triple {11308#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11308#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:02,400 INFO L290 TraceCheckUtils]: 61: Hoare triple {11308#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11309#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:37:02,401 INFO L290 TraceCheckUtils]: 62: Hoare triple {11309#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11309#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:37:02,401 INFO L290 TraceCheckUtils]: 63: Hoare triple {11309#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11309#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:37:02,402 INFO L290 TraceCheckUtils]: 64: Hoare triple {11309#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11310#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:02,402 INFO L290 TraceCheckUtils]: 65: Hoare triple {11310#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11310#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:02,402 INFO L290 TraceCheckUtils]: 66: Hoare triple {11310#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11310#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:02,403 INFO L290 TraceCheckUtils]: 67: Hoare triple {11310#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11311#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:02,403 INFO L290 TraceCheckUtils]: 68: Hoare triple {11311#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11311#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:02,404 INFO L290 TraceCheckUtils]: 69: Hoare triple {11311#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11311#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:02,404 INFO L290 TraceCheckUtils]: 70: Hoare triple {11311#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11312#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:37:02,404 INFO L290 TraceCheckUtils]: 71: Hoare triple {11312#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11312#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:37:02,405 INFO L290 TraceCheckUtils]: 72: Hoare triple {11312#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11312#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:37:02,405 INFO L290 TraceCheckUtils]: 73: Hoare triple {11312#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11313#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:37:02,406 INFO L290 TraceCheckUtils]: 74: Hoare triple {11313#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11282#false} is VALID [2022-02-21 03:37:02,406 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 247 proven. 236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:02,406 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:37:02,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553242654] [2022-02-21 03:37:02,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553242654] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:37:02,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573060138] [2022-02-21 03:37:02,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:37:02,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:37:02,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:02,409 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:37:02,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-02-21 03:37:02,761 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2022-02-21 03:37:02,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:37:02,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 32 conjunts are in the unsatisfiable core [2022-02-21 03:37:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:02,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:03,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {11281#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); {11281#true} is VALID [2022-02-21 03:37:03,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {11281#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {11320#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:03,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {11320#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11320#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:03,742 INFO L290 TraceCheckUtils]: 3: Hoare triple {11320#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11284#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:37:03,742 INFO L290 TraceCheckUtils]: 4: Hoare triple {11284#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11284#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:37:03,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {11284#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11285#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:03,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {11285#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11285#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:03,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {11285#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11286#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:37:03,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {11286#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11286#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:37:03,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {11286#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11287#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:03,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {11287#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11287#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:03,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {11287#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11288#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:37:03,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {11288#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11288#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:37:03,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {11288#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11289#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:37:03,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {11289#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11289#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:37:03,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {11289#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11290#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:37:03,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {11290#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11290#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:37:03,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {11290#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11291#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:03,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {11291#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11291#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:03,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {11291#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11292#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:37:03,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {11292#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11292#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:37:03,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {11292#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11293#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:03,749 INFO L290 TraceCheckUtils]: 22: Hoare triple {11293#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11293#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:03,749 INFO L290 TraceCheckUtils]: 23: Hoare triple {11293#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11294#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:37:03,749 INFO L290 TraceCheckUtils]: 24: Hoare triple {11294#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11294#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:37:03,750 INFO L290 TraceCheckUtils]: 25: Hoare triple {11294#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11295#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:37:03,750 INFO L290 TraceCheckUtils]: 26: Hoare triple {11295#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11295#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:37:03,750 INFO L290 TraceCheckUtils]: 27: Hoare triple {11295#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11296#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:37:03,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {11296#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11296#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:37:03,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {11296#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11297#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:37:03,752 INFO L290 TraceCheckUtils]: 30: Hoare triple {11297#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !(main_~i~0#1 < main_~num~0#1); {11298#(<= |ULTIMATE.start_main_~num~0#1| 14)} is VALID [2022-02-21 03:37:03,752 INFO L290 TraceCheckUtils]: 31: Hoare triple {11298#(<= |ULTIMATE.start_main_~num~0#1| 14)} main_~i~0#1 := 0; {11411#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} is VALID [2022-02-21 03:37:03,752 INFO L290 TraceCheckUtils]: 32: Hoare triple {11411#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11411#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} is VALID [2022-02-21 03:37:03,753 INFO L290 TraceCheckUtils]: 33: Hoare triple {11411#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11411#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} is VALID [2022-02-21 03:37:03,753 INFO L290 TraceCheckUtils]: 34: Hoare triple {11411#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11421#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} is VALID [2022-02-21 03:37:03,754 INFO L290 TraceCheckUtils]: 35: Hoare triple {11421#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11421#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} is VALID [2022-02-21 03:37:03,754 INFO L290 TraceCheckUtils]: 36: Hoare triple {11421#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11421#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} is VALID [2022-02-21 03:37:03,755 INFO L290 TraceCheckUtils]: 37: Hoare triple {11421#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11431#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:03,755 INFO L290 TraceCheckUtils]: 38: Hoare triple {11431#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11431#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:03,756 INFO L290 TraceCheckUtils]: 39: Hoare triple {11431#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11431#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:03,756 INFO L290 TraceCheckUtils]: 40: Hoare triple {11431#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11441#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} is VALID [2022-02-21 03:37:03,757 INFO L290 TraceCheckUtils]: 41: Hoare triple {11441#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11441#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} is VALID [2022-02-21 03:37:03,757 INFO L290 TraceCheckUtils]: 42: Hoare triple {11441#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11441#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} is VALID [2022-02-21 03:37:03,757 INFO L290 TraceCheckUtils]: 43: Hoare triple {11441#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11451#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:03,758 INFO L290 TraceCheckUtils]: 44: Hoare triple {11451#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 4 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11451#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:03,758 INFO L290 TraceCheckUtils]: 45: Hoare triple {11451#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 4 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11451#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:03,759 INFO L290 TraceCheckUtils]: 46: Hoare triple {11451#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 4 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11461#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} is VALID [2022-02-21 03:37:03,759 INFO L290 TraceCheckUtils]: 47: Hoare triple {11461#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11461#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} is VALID [2022-02-21 03:37:03,760 INFO L290 TraceCheckUtils]: 48: Hoare triple {11461#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11461#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} is VALID [2022-02-21 03:37:03,760 INFO L290 TraceCheckUtils]: 49: Hoare triple {11461#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11471#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:03,761 INFO L290 TraceCheckUtils]: 50: Hoare triple {11471#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11471#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:03,761 INFO L290 TraceCheckUtils]: 51: Hoare triple {11471#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 6 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11471#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:03,761 INFO L290 TraceCheckUtils]: 52: Hoare triple {11471#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11481#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} is VALID [2022-02-21 03:37:03,762 INFO L290 TraceCheckUtils]: 53: Hoare triple {11481#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11481#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} is VALID [2022-02-21 03:37:03,762 INFO L290 TraceCheckUtils]: 54: Hoare triple {11481#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11481#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} is VALID [2022-02-21 03:37:03,763 INFO L290 TraceCheckUtils]: 55: Hoare triple {11481#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11491#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 8 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:03,763 INFO L290 TraceCheckUtils]: 56: Hoare triple {11491#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 8 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11491#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 8 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:03,764 INFO L290 TraceCheckUtils]: 57: Hoare triple {11491#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 8 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11491#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 8 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:03,764 INFO L290 TraceCheckUtils]: 58: Hoare triple {11491#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 8 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11501#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:03,765 INFO L290 TraceCheckUtils]: 59: Hoare triple {11501#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 9 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11501#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:03,765 INFO L290 TraceCheckUtils]: 60: Hoare triple {11501#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 9 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11501#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:03,766 INFO L290 TraceCheckUtils]: 61: Hoare triple {11501#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 9 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11511#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} is VALID [2022-02-21 03:37:03,766 INFO L290 TraceCheckUtils]: 62: Hoare triple {11511#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11511#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} is VALID [2022-02-21 03:37:03,766 INFO L290 TraceCheckUtils]: 63: Hoare triple {11511#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11511#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} is VALID [2022-02-21 03:37:03,767 INFO L290 TraceCheckUtils]: 64: Hoare triple {11511#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11521#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 11 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:03,767 INFO L290 TraceCheckUtils]: 65: Hoare triple {11521#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 11 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11521#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 11 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:03,768 INFO L290 TraceCheckUtils]: 66: Hoare triple {11521#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 11 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11521#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 11 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:03,768 INFO L290 TraceCheckUtils]: 67: Hoare triple {11521#(and (<= |ULTIMATE.start_main_~num~0#1| 14) (<= 11 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11531#(and (<= 12 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} is VALID [2022-02-21 03:37:03,769 INFO L290 TraceCheckUtils]: 68: Hoare triple {11531#(and (<= 12 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11531#(and (<= 12 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} is VALID [2022-02-21 03:37:03,769 INFO L290 TraceCheckUtils]: 69: Hoare triple {11531#(and (<= 12 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11531#(and (<= 12 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} is VALID [2022-02-21 03:37:03,770 INFO L290 TraceCheckUtils]: 70: Hoare triple {11531#(and (<= 12 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11541#(and (<= 13 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} is VALID [2022-02-21 03:37:03,770 INFO L290 TraceCheckUtils]: 71: Hoare triple {11541#(and (<= 13 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11541#(and (<= 13 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} is VALID [2022-02-21 03:37:03,770 INFO L290 TraceCheckUtils]: 72: Hoare triple {11541#(and (<= 13 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11541#(and (<= 13 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} is VALID [2022-02-21 03:37:03,771 INFO L290 TraceCheckUtils]: 73: Hoare triple {11541#(and (<= 13 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11551#(and (<= 14 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} is VALID [2022-02-21 03:37:03,772 INFO L290 TraceCheckUtils]: 74: Hoare triple {11551#(and (<= 14 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 14))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11282#false} is VALID [2022-02-21 03:37:03,772 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 287 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:03,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:37:04,283 INFO L290 TraceCheckUtils]: 74: Hoare triple {11313#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11282#false} is VALID [2022-02-21 03:37:04,284 INFO L290 TraceCheckUtils]: 73: Hoare triple {11312#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11313#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:37:04,284 INFO L290 TraceCheckUtils]: 72: Hoare triple {11312#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11312#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:37:04,285 INFO L290 TraceCheckUtils]: 71: Hoare triple {11312#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11312#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:37:04,285 INFO L290 TraceCheckUtils]: 70: Hoare triple {11311#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11312#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:37:04,285 INFO L290 TraceCheckUtils]: 69: Hoare triple {11311#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11311#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:04,286 INFO L290 TraceCheckUtils]: 68: Hoare triple {11311#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11311#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:04,295 INFO L290 TraceCheckUtils]: 67: Hoare triple {11310#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11311#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:04,295 INFO L290 TraceCheckUtils]: 66: Hoare triple {11310#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11310#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:04,296 INFO L290 TraceCheckUtils]: 65: Hoare triple {11310#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11310#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:04,296 INFO L290 TraceCheckUtils]: 64: Hoare triple {11309#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11310#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:04,296 INFO L290 TraceCheckUtils]: 63: Hoare triple {11309#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11309#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:37:04,297 INFO L290 TraceCheckUtils]: 62: Hoare triple {11309#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11309#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:37:04,297 INFO L290 TraceCheckUtils]: 61: Hoare triple {11308#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11309#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:37:04,297 INFO L290 TraceCheckUtils]: 60: Hoare triple {11308#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11308#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:04,298 INFO L290 TraceCheckUtils]: 59: Hoare triple {11308#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11308#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:04,298 INFO L290 TraceCheckUtils]: 58: Hoare triple {11307#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11308#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:04,298 INFO L290 TraceCheckUtils]: 57: Hoare triple {11307#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11307#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:04,299 INFO L290 TraceCheckUtils]: 56: Hoare triple {11307#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11307#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:04,299 INFO L290 TraceCheckUtils]: 55: Hoare triple {11306#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11307#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:04,299 INFO L290 TraceCheckUtils]: 54: Hoare triple {11306#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11306#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:04,300 INFO L290 TraceCheckUtils]: 53: Hoare triple {11306#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11306#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:04,300 INFO L290 TraceCheckUtils]: 52: Hoare triple {11305#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11306#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:04,300 INFO L290 TraceCheckUtils]: 51: Hoare triple {11305#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11305#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:37:04,301 INFO L290 TraceCheckUtils]: 50: Hoare triple {11305#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11305#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:37:04,301 INFO L290 TraceCheckUtils]: 49: Hoare triple {11304#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11305#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:37:04,301 INFO L290 TraceCheckUtils]: 48: Hoare triple {11304#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11304#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:04,302 INFO L290 TraceCheckUtils]: 47: Hoare triple {11304#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11304#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:04,302 INFO L290 TraceCheckUtils]: 46: Hoare triple {11303#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11304#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:04,302 INFO L290 TraceCheckUtils]: 45: Hoare triple {11303#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11303#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:37:04,303 INFO L290 TraceCheckUtils]: 44: Hoare triple {11303#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11303#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:37:04,303 INFO L290 TraceCheckUtils]: 43: Hoare triple {11302#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11303#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:37:04,303 INFO L290 TraceCheckUtils]: 42: Hoare triple {11302#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11302#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:37:04,304 INFO L290 TraceCheckUtils]: 41: Hoare triple {11302#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11302#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:37:04,304 INFO L290 TraceCheckUtils]: 40: Hoare triple {11301#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11302#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:37:04,304 INFO L290 TraceCheckUtils]: 39: Hoare triple {11301#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11301#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} is VALID [2022-02-21 03:37:04,305 INFO L290 TraceCheckUtils]: 38: Hoare triple {11301#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11301#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} is VALID [2022-02-21 03:37:04,305 INFO L290 TraceCheckUtils]: 37: Hoare triple {11300#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11301#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} is VALID [2022-02-21 03:37:04,306 INFO L290 TraceCheckUtils]: 36: Hoare triple {11300#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11300#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} is VALID [2022-02-21 03:37:04,306 INFO L290 TraceCheckUtils]: 35: Hoare triple {11300#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11300#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} is VALID [2022-02-21 03:37:04,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {11675#(<= |ULTIMATE.start_main_~num~0#1| (+ 14 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {11300#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} is VALID [2022-02-21 03:37:04,306 INFO L290 TraceCheckUtils]: 33: Hoare triple {11675#(<= |ULTIMATE.start_main_~num~0#1| (+ 14 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {11675#(<= |ULTIMATE.start_main_~num~0#1| (+ 14 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:04,307 INFO L290 TraceCheckUtils]: 32: Hoare triple {11675#(<= |ULTIMATE.start_main_~num~0#1| (+ 14 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {11675#(<= |ULTIMATE.start_main_~num~0#1| (+ 14 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:04,307 INFO L290 TraceCheckUtils]: 31: Hoare triple {11298#(<= |ULTIMATE.start_main_~num~0#1| 14)} main_~i~0#1 := 0; {11675#(<= |ULTIMATE.start_main_~num~0#1| (+ 14 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:04,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {11297#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !(main_~i~0#1 < main_~num~0#1); {11298#(<= |ULTIMATE.start_main_~num~0#1| 14)} is VALID [2022-02-21 03:37:04,308 INFO L290 TraceCheckUtils]: 29: Hoare triple {11296#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11297#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:37:04,308 INFO L290 TraceCheckUtils]: 28: Hoare triple {11296#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11296#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:37:04,308 INFO L290 TraceCheckUtils]: 27: Hoare triple {11295#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11296#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:37:04,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {11295#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11295#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:37:04,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {11294#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11295#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:37:04,309 INFO L290 TraceCheckUtils]: 24: Hoare triple {11294#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11294#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:37:04,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {11293#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11294#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:37:04,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {11293#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11293#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:04,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {11292#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11293#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:04,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {11292#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11292#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:37:04,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {11291#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11292#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:37:04,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {11291#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11291#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:04,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {11290#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11291#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:04,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {11290#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11290#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:37:04,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {11289#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11290#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:37:04,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {11289#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11289#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:37:04,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {11288#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11289#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:37:04,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {11288#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11288#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:37:04,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {11287#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11288#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:37:04,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {11287#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11287#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:04,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {11286#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11287#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:04,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {11286#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11286#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:37:04,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {11285#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11286#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:37:04,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {11285#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11285#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:04,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {11284#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11285#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:04,320 INFO L290 TraceCheckUtils]: 4: Hoare triple {11284#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11284#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:37:04,320 INFO L290 TraceCheckUtils]: 3: Hoare triple {11320#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {11284#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:37:04,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {11320#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {11320#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:04,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {11281#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {11320#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:04,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {11281#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); {11281#true} is VALID [2022-02-21 03:37:04,322 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 287 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:04,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573060138] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:37:04,322 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:37:04,322 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 49 [2022-02-21 03:37:04,323 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185033246] [2022-02-21 03:37:04,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:37:04,362 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:37:04,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-02-21 03:37:04,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=581, Invalid=1869, Unknown=0, NotChecked=0, Total=2450 [2022-02-21 03:37:04,364 INFO L87 Difference]: Start difference. First operand 124 states and 141 transitions. cyclomatic complexity: 20 Second operand has 50 states, 49 states have (on average 2.5714285714285716) internal successors, (126), 50 states have internal predecessors, (126), 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-21 03:37:06,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:06,698 INFO L93 Difference]: Finished difference Result 401 states and 464 transitions. [2022-02-21 03:37:06,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-21 03:37:06,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 50 states, 49 states have (on average 2.5714285714285716) internal successors, (126), 50 states have internal predecessors, (126), 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-21 03:37:06,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:06,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 401 states and 464 transitions. [2022-02-21 03:37:06,811 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:37:06,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 401 states to 228 states and 262 transitions. [2022-02-21 03:37:06,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 197 [2022-02-21 03:37:06,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 197 [2022-02-21 03:37:06,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 228 states and 262 transitions. [2022-02-21 03:37:06,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:37:06,815 INFO L681 BuchiCegarLoop]: Abstraction has 228 states and 262 transitions. [2022-02-21 03:37:06,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states and 262 transitions. [2022-02-21 03:37:06,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 132. [2022-02-21 03:37:06,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:06,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 228 states and 262 transitions. Second operand has 132 states, 132 states have (on average 1.1363636363636365) internal successors, (150), 131 states have internal predecessors, (150), 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-21 03:37:06,818 INFO L74 IsIncluded]: Start isIncluded. First operand 228 states and 262 transitions. Second operand has 132 states, 132 states have (on average 1.1363636363636365) internal successors, (150), 131 states have internal predecessors, (150), 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-21 03:37:06,818 INFO L87 Difference]: Start difference. First operand 228 states and 262 transitions. Second operand has 132 states, 132 states have (on average 1.1363636363636365) internal successors, (150), 131 states have internal predecessors, (150), 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-21 03:37:06,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:06,821 INFO L93 Difference]: Finished difference Result 228 states and 262 transitions. [2022-02-21 03:37:06,821 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 262 transitions. [2022-02-21 03:37:06,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:06,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:06,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 132 states have (on average 1.1363636363636365) internal successors, (150), 131 states have internal predecessors, (150), 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 228 states and 262 transitions. [2022-02-21 03:37:06,823 INFO L87 Difference]: Start difference. First operand has 132 states, 132 states have (on average 1.1363636363636365) internal successors, (150), 131 states have internal predecessors, (150), 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 228 states and 262 transitions. [2022-02-21 03:37:06,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:06,826 INFO L93 Difference]: Finished difference Result 228 states and 262 transitions. [2022-02-21 03:37:06,826 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 262 transitions. [2022-02-21 03:37:06,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:06,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:06,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:06,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:06,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 132 states have (on average 1.1363636363636365) internal successors, (150), 131 states have internal predecessors, (150), 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-21 03:37:06,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 150 transitions. [2022-02-21 03:37:06,828 INFO L704 BuchiCegarLoop]: Abstraction has 132 states and 150 transitions. [2022-02-21 03:37:06,828 INFO L587 BuchiCegarLoop]: Abstraction has 132 states and 150 transitions. [2022-02-21 03:37:06,828 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2022-02-21 03:37:06,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 150 transitions. [2022-02-21 03:37:06,829 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:37:06,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:06,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:06,829 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [15, 15, 15, 14, 14, 1, 1, 1, 1] [2022-02-21 03:37:06,829 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:06,830 INFO L791 eck$LassoCheckResult]: Stem: 12208#ULTIMATE.startENTRY 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); 12209#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; 12214#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 12229#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12230#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 12217#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12218#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 12260#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12259#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 12258#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12257#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 12256#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12255#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 12254#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12253#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 12252#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12251#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 12250#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12249#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 12248#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12247#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 12246#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12245#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 12244#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12243#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 12242#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12241#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 12240#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12239#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 12238#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12237#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 12233#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 12232#L27-3 assume !(main_~i~0#1 < main_~num~0#1); 12219#L27-4 main_~i~0#1 := 0; 12220#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 12268#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 12269#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 12270#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 12274#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 12273#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 12334#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 12331#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 12329#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 12328#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 12325#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 12323#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 12322#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 12319#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 12317#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 12316#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 12313#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 12311#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 12310#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 12307#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 12305#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 12304#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 12301#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 12299#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 12298#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 12295#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 12293#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 12292#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 12289#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 12287#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 12286#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 12283#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 12281#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 12280#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 12278#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 12277#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 12276#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 12226#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 12213#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 12223#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 12228#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 12265#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 12264#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 12235#L34 [2022-02-21 03:37:06,830 INFO L793 eck$LassoCheckResult]: Loop: 12235#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 12236#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 12234#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 12235#L34 [2022-02-21 03:37:06,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:06,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1133388657, now seen corresponding path program 28 times [2022-02-21 03:37:06,830 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:06,831 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270528951] [2022-02-21 03:37:06,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:06,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:06,928 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:06,986 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:06,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:06,986 INFO L85 PathProgramCache]: Analyzing trace with hash 69557, now seen corresponding path program 16 times [2022-02-21 03:37:06,987 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:06,987 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538629182] [2022-02-21 03:37:06,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:06,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:06,992 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:06,995 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:06,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:06,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2043527065, now seen corresponding path program 29 times [2022-02-21 03:37:06,996 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:06,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076008472] [2022-02-21 03:37:06,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:06,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:07,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {12801#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); {12801#true} is VALID [2022-02-21 03:37:07,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {12801#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {12803#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:07,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {12803#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12803#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:07,513 INFO L290 TraceCheckUtils]: 3: Hoare triple {12803#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12804#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:37:07,513 INFO L290 TraceCheckUtils]: 4: Hoare triple {12804#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12804#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:37:07,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {12804#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12805#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:07,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {12805#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12805#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:07,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {12805#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12806#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:37:07,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {12806#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12806#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:37:07,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {12806#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12807#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:07,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {12807#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12807#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:07,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {12807#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12808#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:37:07,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {12808#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12808#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:37:07,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {12808#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12809#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:37:07,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {12809#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12809#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:37:07,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {12809#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12810#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:37:07,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {12810#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12810#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:37:07,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {12810#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12811#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:07,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {12811#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12811#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:07,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {12811#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12812#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:37:07,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {12812#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12812#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:37:07,519 INFO L290 TraceCheckUtils]: 21: Hoare triple {12812#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12813#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:07,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {12813#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12813#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:07,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {12813#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12814#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:37:07,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {12814#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12814#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:37:07,520 INFO L290 TraceCheckUtils]: 25: Hoare triple {12814#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12815#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:37:07,520 INFO L290 TraceCheckUtils]: 26: Hoare triple {12815#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12815#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:37:07,520 INFO L290 TraceCheckUtils]: 27: Hoare triple {12815#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12816#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:37:07,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {12816#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12816#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:37:07,521 INFO L290 TraceCheckUtils]: 29: Hoare triple {12816#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12817#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:37:07,521 INFO L290 TraceCheckUtils]: 30: Hoare triple {12817#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12817#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:37:07,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {12817#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12818#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:37:07,522 INFO L290 TraceCheckUtils]: 32: Hoare triple {12818#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !(main_~i~0#1 < main_~num~0#1); {12819#(<= |ULTIMATE.start_main_~num~0#1| 15)} is VALID [2022-02-21 03:37:07,522 INFO L290 TraceCheckUtils]: 33: Hoare triple {12819#(<= |ULTIMATE.start_main_~num~0#1| 15)} main_~i~0#1 := 0; {12820#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 15))} is VALID [2022-02-21 03:37:07,523 INFO L290 TraceCheckUtils]: 34: Hoare triple {12820#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 15))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12820#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 15))} is VALID [2022-02-21 03:37:07,523 INFO L290 TraceCheckUtils]: 35: Hoare triple {12820#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 15))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12820#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 15))} is VALID [2022-02-21 03:37:07,524 INFO L290 TraceCheckUtils]: 36: Hoare triple {12820#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 15))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12821#(<= |ULTIMATE.start_main_~num~0#1| (+ 14 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:07,524 INFO L290 TraceCheckUtils]: 37: Hoare triple {12821#(<= |ULTIMATE.start_main_~num~0#1| (+ 14 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12821#(<= |ULTIMATE.start_main_~num~0#1| (+ 14 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:07,524 INFO L290 TraceCheckUtils]: 38: Hoare triple {12821#(<= |ULTIMATE.start_main_~num~0#1| (+ 14 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12821#(<= |ULTIMATE.start_main_~num~0#1| (+ 14 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:07,525 INFO L290 TraceCheckUtils]: 39: Hoare triple {12821#(<= |ULTIMATE.start_main_~num~0#1| (+ 14 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12822#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} is VALID [2022-02-21 03:37:07,525 INFO L290 TraceCheckUtils]: 40: Hoare triple {12822#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12822#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} is VALID [2022-02-21 03:37:07,525 INFO L290 TraceCheckUtils]: 41: Hoare triple {12822#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12822#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} is VALID [2022-02-21 03:37:07,526 INFO L290 TraceCheckUtils]: 42: Hoare triple {12822#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12823#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} is VALID [2022-02-21 03:37:07,526 INFO L290 TraceCheckUtils]: 43: Hoare triple {12823#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12823#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} is VALID [2022-02-21 03:37:07,526 INFO L290 TraceCheckUtils]: 44: Hoare triple {12823#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12823#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} is VALID [2022-02-21 03:37:07,527 INFO L290 TraceCheckUtils]: 45: Hoare triple {12823#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12824#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:37:07,527 INFO L290 TraceCheckUtils]: 46: Hoare triple {12824#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12824#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:37:07,527 INFO L290 TraceCheckUtils]: 47: Hoare triple {12824#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12824#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:37:07,528 INFO L290 TraceCheckUtils]: 48: Hoare triple {12824#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12825#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:37:07,528 INFO L290 TraceCheckUtils]: 49: Hoare triple {12825#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12825#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:37:07,528 INFO L290 TraceCheckUtils]: 50: Hoare triple {12825#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12825#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:37:07,529 INFO L290 TraceCheckUtils]: 51: Hoare triple {12825#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12826#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:07,529 INFO L290 TraceCheckUtils]: 52: Hoare triple {12826#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12826#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:07,529 INFO L290 TraceCheckUtils]: 53: Hoare triple {12826#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12826#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:07,530 INFO L290 TraceCheckUtils]: 54: Hoare triple {12826#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12827#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:37:07,530 INFO L290 TraceCheckUtils]: 55: Hoare triple {12827#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12827#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:37:07,530 INFO L290 TraceCheckUtils]: 56: Hoare triple {12827#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12827#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:37:07,531 INFO L290 TraceCheckUtils]: 57: Hoare triple {12827#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12828#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:07,531 INFO L290 TraceCheckUtils]: 58: Hoare triple {12828#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12828#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:07,531 INFO L290 TraceCheckUtils]: 59: Hoare triple {12828#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12828#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:07,532 INFO L290 TraceCheckUtils]: 60: Hoare triple {12828#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12829#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:07,532 INFO L290 TraceCheckUtils]: 61: Hoare triple {12829#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12829#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:07,532 INFO L290 TraceCheckUtils]: 62: Hoare triple {12829#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12829#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:07,533 INFO L290 TraceCheckUtils]: 63: Hoare triple {12829#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12830#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:07,533 INFO L290 TraceCheckUtils]: 64: Hoare triple {12830#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12830#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:07,533 INFO L290 TraceCheckUtils]: 65: Hoare triple {12830#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12830#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:07,534 INFO L290 TraceCheckUtils]: 66: Hoare triple {12830#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12831#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:37:07,534 INFO L290 TraceCheckUtils]: 67: Hoare triple {12831#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12831#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:37:07,534 INFO L290 TraceCheckUtils]: 68: Hoare triple {12831#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12831#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:37:07,535 INFO L290 TraceCheckUtils]: 69: Hoare triple {12831#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12832#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:07,535 INFO L290 TraceCheckUtils]: 70: Hoare triple {12832#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12832#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:07,535 INFO L290 TraceCheckUtils]: 71: Hoare triple {12832#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12832#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:07,536 INFO L290 TraceCheckUtils]: 72: Hoare triple {12832#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12833#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:07,536 INFO L290 TraceCheckUtils]: 73: Hoare triple {12833#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12833#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:07,536 INFO L290 TraceCheckUtils]: 74: Hoare triple {12833#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12833#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:07,537 INFO L290 TraceCheckUtils]: 75: Hoare triple {12833#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12834#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:37:07,537 INFO L290 TraceCheckUtils]: 76: Hoare triple {12834#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12834#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:37:07,537 INFO L290 TraceCheckUtils]: 77: Hoare triple {12834#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12834#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:37:07,537 INFO L290 TraceCheckUtils]: 78: Hoare triple {12834#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12835#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:37:07,538 INFO L290 TraceCheckUtils]: 79: Hoare triple {12835#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12802#false} is VALID [2022-02-21 03:37:07,538 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 287 proven. 268 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:07,538 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:37:07,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076008472] [2022-02-21 03:37:07,539 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076008472] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:37:07,539 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915950869] [2022-02-21 03:37:07,539 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-21 03:37:07,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:37:07,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:07,540 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:37:07,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-02-21 03:37:07,953 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2022-02-21 03:37:07,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:37:07,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 34 conjunts are in the unsatisfiable core [2022-02-21 03:37:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:07,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:08,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {12801#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); {12801#true} is VALID [2022-02-21 03:37:08,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {12801#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {12842#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:08,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {12842#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12842#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:08,937 INFO L290 TraceCheckUtils]: 3: Hoare triple {12842#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12804#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:37:08,938 INFO L290 TraceCheckUtils]: 4: Hoare triple {12804#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12804#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:37:08,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {12804#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12805#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:08,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {12805#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12805#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:08,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {12805#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12806#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:37:08,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {12806#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12806#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:37:08,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {12806#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12807#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:08,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {12807#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12807#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:08,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {12807#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12808#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:37:08,940 INFO L290 TraceCheckUtils]: 12: Hoare triple {12808#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12808#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:37:08,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {12808#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12809#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:37:08,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {12809#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12809#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:37:08,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {12809#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12810#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:37:08,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {12810#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12810#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:37:08,942 INFO L290 TraceCheckUtils]: 17: Hoare triple {12810#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12811#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:08,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {12811#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12811#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:08,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {12811#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12812#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:37:08,943 INFO L290 TraceCheckUtils]: 20: Hoare triple {12812#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12812#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:37:08,952 INFO L290 TraceCheckUtils]: 21: Hoare triple {12812#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12813#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:08,952 INFO L290 TraceCheckUtils]: 22: Hoare triple {12813#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12813#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:08,953 INFO L290 TraceCheckUtils]: 23: Hoare triple {12813#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12814#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:37:08,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {12814#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12814#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:37:08,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {12814#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12815#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:37:08,955 INFO L290 TraceCheckUtils]: 26: Hoare triple {12815#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12815#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:37:08,955 INFO L290 TraceCheckUtils]: 27: Hoare triple {12815#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12816#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:37:08,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {12816#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12816#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:37:08,956 INFO L290 TraceCheckUtils]: 29: Hoare triple {12816#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12817#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:37:08,957 INFO L290 TraceCheckUtils]: 30: Hoare triple {12817#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12817#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:37:08,958 INFO L290 TraceCheckUtils]: 31: Hoare triple {12817#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12818#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:37:08,958 INFO L290 TraceCheckUtils]: 32: Hoare triple {12818#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !(main_~i~0#1 < main_~num~0#1); {12819#(<= |ULTIMATE.start_main_~num~0#1| 15)} is VALID [2022-02-21 03:37:08,959 INFO L290 TraceCheckUtils]: 33: Hoare triple {12819#(<= |ULTIMATE.start_main_~num~0#1| 15)} main_~i~0#1 := 0; {12939#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:08,960 INFO L290 TraceCheckUtils]: 34: Hoare triple {12939#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12939#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:08,960 INFO L290 TraceCheckUtils]: 35: Hoare triple {12939#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 0 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12939#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:08,961 INFO L290 TraceCheckUtils]: 36: Hoare triple {12939#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 0 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12949#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} is VALID [2022-02-21 03:37:08,961 INFO L290 TraceCheckUtils]: 37: Hoare triple {12949#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12949#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} is VALID [2022-02-21 03:37:08,962 INFO L290 TraceCheckUtils]: 38: Hoare triple {12949#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12949#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} is VALID [2022-02-21 03:37:08,962 INFO L290 TraceCheckUtils]: 39: Hoare triple {12949#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12959#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:08,963 INFO L290 TraceCheckUtils]: 40: Hoare triple {12959#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12959#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:08,963 INFO L290 TraceCheckUtils]: 41: Hoare triple {12959#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12959#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:08,964 INFO L290 TraceCheckUtils]: 42: Hoare triple {12959#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12969#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:08,965 INFO L290 TraceCheckUtils]: 43: Hoare triple {12969#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12969#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:08,965 INFO L290 TraceCheckUtils]: 44: Hoare triple {12969#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12969#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:08,966 INFO L290 TraceCheckUtils]: 45: Hoare triple {12969#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12979#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:08,966 INFO L290 TraceCheckUtils]: 46: Hoare triple {12979#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 4 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12979#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:08,967 INFO L290 TraceCheckUtils]: 47: Hoare triple {12979#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 4 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12979#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:08,967 INFO L290 TraceCheckUtils]: 48: Hoare triple {12979#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 4 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12989#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} is VALID [2022-02-21 03:37:08,968 INFO L290 TraceCheckUtils]: 49: Hoare triple {12989#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12989#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} is VALID [2022-02-21 03:37:08,968 INFO L290 TraceCheckUtils]: 50: Hoare triple {12989#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12989#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} is VALID [2022-02-21 03:37:08,969 INFO L290 TraceCheckUtils]: 51: Hoare triple {12989#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12999#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:08,970 INFO L290 TraceCheckUtils]: 52: Hoare triple {12999#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12999#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:08,970 INFO L290 TraceCheckUtils]: 53: Hoare triple {12999#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 6 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12999#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:08,971 INFO L290 TraceCheckUtils]: 54: Hoare triple {12999#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {13009#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} is VALID [2022-02-21 03:37:08,971 INFO L290 TraceCheckUtils]: 55: Hoare triple {13009#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {13009#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} is VALID [2022-02-21 03:37:08,972 INFO L290 TraceCheckUtils]: 56: Hoare triple {13009#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {13009#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} is VALID [2022-02-21 03:37:08,972 INFO L290 TraceCheckUtils]: 57: Hoare triple {13009#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {13019#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 8 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:08,972 INFO L290 TraceCheckUtils]: 58: Hoare triple {13019#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 8 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {13019#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 8 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:08,973 INFO L290 TraceCheckUtils]: 59: Hoare triple {13019#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 8 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {13019#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 8 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:08,973 INFO L290 TraceCheckUtils]: 60: Hoare triple {13019#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 8 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {13029#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:08,974 INFO L290 TraceCheckUtils]: 61: Hoare triple {13029#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 9 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {13029#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:08,974 INFO L290 TraceCheckUtils]: 62: Hoare triple {13029#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 9 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {13029#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:08,974 INFO L290 TraceCheckUtils]: 63: Hoare triple {13029#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 9 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {13039#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} is VALID [2022-02-21 03:37:08,975 INFO L290 TraceCheckUtils]: 64: Hoare triple {13039#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {13039#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} is VALID [2022-02-21 03:37:08,975 INFO L290 TraceCheckUtils]: 65: Hoare triple {13039#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {13039#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} is VALID [2022-02-21 03:37:08,976 INFO L290 TraceCheckUtils]: 66: Hoare triple {13039#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {13049#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 11 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:08,976 INFO L290 TraceCheckUtils]: 67: Hoare triple {13049#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 11 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {13049#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 11 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:08,976 INFO L290 TraceCheckUtils]: 68: Hoare triple {13049#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 11 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {13049#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 11 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:08,977 INFO L290 TraceCheckUtils]: 69: Hoare triple {13049#(and (<= |ULTIMATE.start_main_~num~0#1| 15) (<= 11 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {13059#(and (<= 12 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} is VALID [2022-02-21 03:37:08,977 INFO L290 TraceCheckUtils]: 70: Hoare triple {13059#(and (<= 12 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {13059#(and (<= 12 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} is VALID [2022-02-21 03:37:08,978 INFO L290 TraceCheckUtils]: 71: Hoare triple {13059#(and (<= 12 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {13059#(and (<= 12 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} is VALID [2022-02-21 03:37:08,978 INFO L290 TraceCheckUtils]: 72: Hoare triple {13059#(and (<= 12 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {13069#(and (<= 13 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} is VALID [2022-02-21 03:37:08,979 INFO L290 TraceCheckUtils]: 73: Hoare triple {13069#(and (<= 13 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {13069#(and (<= 13 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} is VALID [2022-02-21 03:37:08,979 INFO L290 TraceCheckUtils]: 74: Hoare triple {13069#(and (<= 13 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {13069#(and (<= 13 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} is VALID [2022-02-21 03:37:08,979 INFO L290 TraceCheckUtils]: 75: Hoare triple {13069#(and (<= 13 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {13079#(and (<= 14 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} is VALID [2022-02-21 03:37:08,980 INFO L290 TraceCheckUtils]: 76: Hoare triple {13079#(and (<= 14 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {13079#(and (<= 14 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} is VALID [2022-02-21 03:37:08,980 INFO L290 TraceCheckUtils]: 77: Hoare triple {13079#(and (<= 14 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {13079#(and (<= 14 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} is VALID [2022-02-21 03:37:08,981 INFO L290 TraceCheckUtils]: 78: Hoare triple {13079#(and (<= 14 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {13089#(and (<= 15 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} is VALID [2022-02-21 03:37:08,981 INFO L290 TraceCheckUtils]: 79: Hoare triple {13089#(and (<= 15 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 15))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12802#false} is VALID [2022-02-21 03:37:08,982 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 330 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:08,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:37:09,509 INFO L290 TraceCheckUtils]: 79: Hoare triple {12835#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12802#false} is VALID [2022-02-21 03:37:09,510 INFO L290 TraceCheckUtils]: 78: Hoare triple {12834#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12835#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:37:09,510 INFO L290 TraceCheckUtils]: 77: Hoare triple {12834#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12834#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:37:09,510 INFO L290 TraceCheckUtils]: 76: Hoare triple {12834#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12834#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:37:09,511 INFO L290 TraceCheckUtils]: 75: Hoare triple {12833#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12834#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:37:09,511 INFO L290 TraceCheckUtils]: 74: Hoare triple {12833#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12833#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:09,511 INFO L290 TraceCheckUtils]: 73: Hoare triple {12833#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12833#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:09,512 INFO L290 TraceCheckUtils]: 72: Hoare triple {12832#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12833#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:09,512 INFO L290 TraceCheckUtils]: 71: Hoare triple {12832#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12832#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:09,512 INFO L290 TraceCheckUtils]: 70: Hoare triple {12832#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12832#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:09,512 INFO L290 TraceCheckUtils]: 69: Hoare triple {12831#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12832#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:09,513 INFO L290 TraceCheckUtils]: 68: Hoare triple {12831#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12831#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:37:09,513 INFO L290 TraceCheckUtils]: 67: Hoare triple {12831#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12831#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:37:09,513 INFO L290 TraceCheckUtils]: 66: Hoare triple {12830#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12831#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:37:09,514 INFO L290 TraceCheckUtils]: 65: Hoare triple {12830#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12830#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:09,514 INFO L290 TraceCheckUtils]: 64: Hoare triple {12830#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12830#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:09,514 INFO L290 TraceCheckUtils]: 63: Hoare triple {12829#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12830#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:09,515 INFO L290 TraceCheckUtils]: 62: Hoare triple {12829#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12829#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:09,515 INFO L290 TraceCheckUtils]: 61: Hoare triple {12829#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12829#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:09,515 INFO L290 TraceCheckUtils]: 60: Hoare triple {12828#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12829#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:09,516 INFO L290 TraceCheckUtils]: 59: Hoare triple {12828#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12828#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:09,516 INFO L290 TraceCheckUtils]: 58: Hoare triple {12828#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12828#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:09,516 INFO L290 TraceCheckUtils]: 57: Hoare triple {12827#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12828#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:09,517 INFO L290 TraceCheckUtils]: 56: Hoare triple {12827#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12827#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:37:09,517 INFO L290 TraceCheckUtils]: 55: Hoare triple {12827#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12827#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:37:09,517 INFO L290 TraceCheckUtils]: 54: Hoare triple {12826#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12827#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:37:09,518 INFO L290 TraceCheckUtils]: 53: Hoare triple {12826#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12826#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:09,518 INFO L290 TraceCheckUtils]: 52: Hoare triple {12826#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12826#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:09,518 INFO L290 TraceCheckUtils]: 51: Hoare triple {12825#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12826#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:09,519 INFO L290 TraceCheckUtils]: 50: Hoare triple {12825#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12825#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:37:09,519 INFO L290 TraceCheckUtils]: 49: Hoare triple {12825#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12825#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:37:09,519 INFO L290 TraceCheckUtils]: 48: Hoare triple {12824#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12825#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:37:09,520 INFO L290 TraceCheckUtils]: 47: Hoare triple {12824#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12824#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:37:09,520 INFO L290 TraceCheckUtils]: 46: Hoare triple {12824#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12824#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:37:09,520 INFO L290 TraceCheckUtils]: 45: Hoare triple {12823#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12824#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:37:09,521 INFO L290 TraceCheckUtils]: 44: Hoare triple {12823#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12823#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} is VALID [2022-02-21 03:37:09,521 INFO L290 TraceCheckUtils]: 43: Hoare triple {12823#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12823#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} is VALID [2022-02-21 03:37:09,522 INFO L290 TraceCheckUtils]: 42: Hoare triple {12822#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12823#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} is VALID [2022-02-21 03:37:09,522 INFO L290 TraceCheckUtils]: 41: Hoare triple {12822#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12822#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} is VALID [2022-02-21 03:37:09,522 INFO L290 TraceCheckUtils]: 40: Hoare triple {12822#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12822#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} is VALID [2022-02-21 03:37:09,522 INFO L290 TraceCheckUtils]: 39: Hoare triple {12821#(<= |ULTIMATE.start_main_~num~0#1| (+ 14 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12822#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} is VALID [2022-02-21 03:37:09,523 INFO L290 TraceCheckUtils]: 38: Hoare triple {12821#(<= |ULTIMATE.start_main_~num~0#1| (+ 14 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {12821#(<= |ULTIMATE.start_main_~num~0#1| (+ 14 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:09,523 INFO L290 TraceCheckUtils]: 37: Hoare triple {12821#(<= |ULTIMATE.start_main_~num~0#1| (+ 14 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {12821#(<= |ULTIMATE.start_main_~num~0#1| (+ 14 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:09,523 INFO L290 TraceCheckUtils]: 36: Hoare triple {13222#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 15))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {12821#(<= |ULTIMATE.start_main_~num~0#1| (+ 14 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:09,524 INFO L290 TraceCheckUtils]: 35: Hoare triple {13222#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 15))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {13222#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 15))} is VALID [2022-02-21 03:37:09,524 INFO L290 TraceCheckUtils]: 34: Hoare triple {13222#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 15))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {13222#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 15))} is VALID [2022-02-21 03:37:09,525 INFO L290 TraceCheckUtils]: 33: Hoare triple {12819#(<= |ULTIMATE.start_main_~num~0#1| 15)} main_~i~0#1 := 0; {13222#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 15))} is VALID [2022-02-21 03:37:09,525 INFO L290 TraceCheckUtils]: 32: Hoare triple {12818#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !(main_~i~0#1 < main_~num~0#1); {12819#(<= |ULTIMATE.start_main_~num~0#1| 15)} is VALID [2022-02-21 03:37:09,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {12817#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12818#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:37:09,526 INFO L290 TraceCheckUtils]: 30: Hoare triple {12817#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12817#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:37:09,526 INFO L290 TraceCheckUtils]: 29: Hoare triple {12816#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12817#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:37:09,526 INFO L290 TraceCheckUtils]: 28: Hoare triple {12816#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12816#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:37:09,527 INFO L290 TraceCheckUtils]: 27: Hoare triple {12815#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12816#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:37:09,527 INFO L290 TraceCheckUtils]: 26: Hoare triple {12815#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12815#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:37:09,527 INFO L290 TraceCheckUtils]: 25: Hoare triple {12814#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12815#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:37:09,527 INFO L290 TraceCheckUtils]: 24: Hoare triple {12814#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12814#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:37:09,528 INFO L290 TraceCheckUtils]: 23: Hoare triple {12813#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12814#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:37:09,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {12813#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12813#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:09,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {12812#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12813#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:09,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {12812#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12812#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:37:09,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {12811#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12812#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:37:09,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {12811#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12811#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:09,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {12810#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12811#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:09,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {12810#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12810#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:37:09,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {12809#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12810#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:37:09,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {12809#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12809#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:37:09,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {12808#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12809#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:37:09,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {12808#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12808#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:37:09,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {12807#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12808#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:37:09,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {12807#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12807#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:09,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {12806#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12807#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:09,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {12806#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12806#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:37:09,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {12805#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12806#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:37:09,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {12805#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12805#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:09,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {12804#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12805#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:09,534 INFO L290 TraceCheckUtils]: 4: Hoare triple {12804#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12804#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:37:09,534 INFO L290 TraceCheckUtils]: 3: Hoare triple {12842#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {12804#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:37:09,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {12842#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {12842#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:09,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {12801#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {12842#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:09,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {12801#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); {12801#true} is VALID [2022-02-21 03:37:09,535 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 330 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:09,536 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915950869] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:37:09,536 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:37:09,536 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 52 [2022-02-21 03:37:09,536 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427126259] [2022-02-21 03:37:09,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:37:09,577 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:37:09,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-02-21 03:37:09,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=651, Invalid=2105, Unknown=0, NotChecked=0, Total=2756 [2022-02-21 03:37:09,579 INFO L87 Difference]: Start difference. First operand 132 states and 150 transitions. cyclomatic complexity: 21 Second operand has 53 states, 52 states have (on average 2.576923076923077) internal successors, (134), 53 states have internal predecessors, (134), 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-21 03:37:12,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:12,111 INFO L93 Difference]: Finished difference Result 427 states and 494 transitions. [2022-02-21 03:37:12,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-02-21 03:37:12,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 53 states, 52 states have (on average 2.576923076923077) internal successors, (134), 53 states have internal predecessors, (134), 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-21 03:37:12,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:12,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 427 states and 494 transitions. [2022-02-21 03:37:12,220 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:37:12,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 427 states to 242 states and 278 transitions. [2022-02-21 03:37:12,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 209 [2022-02-21 03:37:12,224 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 209 [2022-02-21 03:37:12,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 242 states and 278 transitions. [2022-02-21 03:37:12,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:37:12,225 INFO L681 BuchiCegarLoop]: Abstraction has 242 states and 278 transitions. [2022-02-21 03:37:12,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states and 278 transitions. [2022-02-21 03:37:12,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 140. [2022-02-21 03:37:12,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:12,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 242 states and 278 transitions. Second operand has 140 states, 140 states have (on average 1.1357142857142857) internal successors, (159), 139 states have internal predecessors, (159), 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-21 03:37:12,228 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states and 278 transitions. Second operand has 140 states, 140 states have (on average 1.1357142857142857) internal successors, (159), 139 states have internal predecessors, (159), 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-21 03:37:12,228 INFO L87 Difference]: Start difference. First operand 242 states and 278 transitions. Second operand has 140 states, 140 states have (on average 1.1357142857142857) internal successors, (159), 139 states have internal predecessors, (159), 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-21 03:37:12,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:12,231 INFO L93 Difference]: Finished difference Result 242 states and 278 transitions. [2022-02-21 03:37:12,231 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 278 transitions. [2022-02-21 03:37:12,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:12,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:12,232 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 140 states have (on average 1.1357142857142857) internal successors, (159), 139 states have internal predecessors, (159), 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 242 states and 278 transitions. [2022-02-21 03:37:12,233 INFO L87 Difference]: Start difference. First operand has 140 states, 140 states have (on average 1.1357142857142857) internal successors, (159), 139 states have internal predecessors, (159), 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 242 states and 278 transitions. [2022-02-21 03:37:12,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:12,236 INFO L93 Difference]: Finished difference Result 242 states and 278 transitions. [2022-02-21 03:37:12,236 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 278 transitions. [2022-02-21 03:37:12,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:12,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:12,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:12,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:12,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 140 states have (on average 1.1357142857142857) internal successors, (159), 139 states have internal predecessors, (159), 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-21 03:37:12,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 159 transitions. [2022-02-21 03:37:12,239 INFO L704 BuchiCegarLoop]: Abstraction has 140 states and 159 transitions. [2022-02-21 03:37:12,239 INFO L587 BuchiCegarLoop]: Abstraction has 140 states and 159 transitions. [2022-02-21 03:37:12,239 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2022-02-21 03:37:12,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 159 transitions. [2022-02-21 03:37:12,240 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:37:12,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:12,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:12,241 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [16, 16, 16, 15, 15, 1, 1, 1, 1] [2022-02-21 03:37:12,241 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:12,241 INFO L791 eck$LassoCheckResult]: Stem: 13789#ULTIMATE.startENTRY 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); 13790#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; 13795#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 13809#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 13810#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 13798#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 13799#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 13842#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 13841#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 13840#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 13839#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 13838#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 13837#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 13836#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 13835#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 13834#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 13833#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 13832#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 13831#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 13830#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 13829#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 13828#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 13827#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 13826#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 13825#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 13824#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 13823#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 13822#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 13821#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 13820#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 13819#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 13818#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 13817#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 13813#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 13812#L27-3 assume !(main_~i~0#1 < main_~num~0#1); 13800#L27-4 main_~i~0#1 := 0; 13801#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 13924#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 13852#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13850#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 13851#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 13855#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13923#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 13920#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 13918#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13917#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 13914#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 13912#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13911#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 13908#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 13906#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13905#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 13902#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 13900#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13899#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 13896#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 13894#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13893#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 13890#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 13888#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13887#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 13884#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 13882#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13881#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 13878#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 13876#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13875#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 13872#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 13870#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13869#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 13866#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 13864#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13863#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 13861#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 13859#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13858#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 13806#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 13794#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13803#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 13808#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 13847#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13846#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 13815#L34 [2022-02-21 03:37:12,241 INFO L793 eck$LassoCheckResult]: Loop: 13815#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 13816#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 13814#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 13815#L34 [2022-02-21 03:37:12,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:12,242 INFO L85 PathProgramCache]: Analyzing trace with hash 21119337, now seen corresponding path program 30 times [2022-02-21 03:37:12,242 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:12,242 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011189781] [2022-02-21 03:37:12,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:12,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:12,367 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:12,474 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:12,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:12,475 INFO L85 PathProgramCache]: Analyzing trace with hash 69557, now seen corresponding path program 17 times [2022-02-21 03:37:12,475 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:12,475 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473348980] [2022-02-21 03:37:12,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:12,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:12,480 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:12,483 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:12,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:12,484 INFO L85 PathProgramCache]: Analyzing trace with hash 2100983117, now seen corresponding path program 31 times [2022-02-21 03:37:12,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:12,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454038716] [2022-02-21 03:37:12,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:12,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:13,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {14418#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); {14418#true} is VALID [2022-02-21 03:37:13,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {14418#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {14420#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:13,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {14420#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14420#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:13,026 INFO L290 TraceCheckUtils]: 3: Hoare triple {14420#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14421#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:37:13,026 INFO L290 TraceCheckUtils]: 4: Hoare triple {14421#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14421#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:37:13,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {14421#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14422#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:13,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {14422#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14422#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:13,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {14422#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14423#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:37:13,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {14423#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14423#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:37:13,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {14423#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14424#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:13,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {14424#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14424#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:13,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {14424#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14425#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:37:13,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {14425#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14425#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:37:13,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {14425#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14426#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:37:13,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {14426#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14426#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:37:13,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {14426#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14427#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:37:13,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {14427#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14427#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:37:13,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {14427#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14428#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:13,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {14428#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14428#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:13,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {14428#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14429#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:37:13,032 INFO L290 TraceCheckUtils]: 20: Hoare triple {14429#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14429#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:37:13,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {14429#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14430#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:13,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {14430#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14430#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:13,033 INFO L290 TraceCheckUtils]: 23: Hoare triple {14430#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14431#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:37:13,033 INFO L290 TraceCheckUtils]: 24: Hoare triple {14431#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14431#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:37:13,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {14431#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14432#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:37:13,033 INFO L290 TraceCheckUtils]: 26: Hoare triple {14432#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14432#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:37:13,034 INFO L290 TraceCheckUtils]: 27: Hoare triple {14432#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14433#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:37:13,034 INFO L290 TraceCheckUtils]: 28: Hoare triple {14433#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14433#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:37:13,034 INFO L290 TraceCheckUtils]: 29: Hoare triple {14433#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14434#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:37:13,035 INFO L290 TraceCheckUtils]: 30: Hoare triple {14434#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14434#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:37:13,036 INFO L290 TraceCheckUtils]: 31: Hoare triple {14434#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14435#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:37:13,036 INFO L290 TraceCheckUtils]: 32: Hoare triple {14435#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14435#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:37:13,037 INFO L290 TraceCheckUtils]: 33: Hoare triple {14435#(<= |ULTIMATE.start_main_~i~0#1| 15)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14436#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:37:13,037 INFO L290 TraceCheckUtils]: 34: Hoare triple {14436#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !(main_~i~0#1 < main_~num~0#1); {14437#(<= |ULTIMATE.start_main_~num~0#1| 16)} is VALID [2022-02-21 03:37:13,037 INFO L290 TraceCheckUtils]: 35: Hoare triple {14437#(<= |ULTIMATE.start_main_~num~0#1| 16)} main_~i~0#1 := 0; {14438#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:13,038 INFO L290 TraceCheckUtils]: 36: Hoare triple {14438#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 16))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14438#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:13,038 INFO L290 TraceCheckUtils]: 37: Hoare triple {14438#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 16))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14438#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:13,039 INFO L290 TraceCheckUtils]: 38: Hoare triple {14438#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 16))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14439#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 15))} is VALID [2022-02-21 03:37:13,039 INFO L290 TraceCheckUtils]: 39: Hoare triple {14439#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 15))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14439#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 15))} is VALID [2022-02-21 03:37:13,039 INFO L290 TraceCheckUtils]: 40: Hoare triple {14439#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 15))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14439#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 15))} is VALID [2022-02-21 03:37:13,040 INFO L290 TraceCheckUtils]: 41: Hoare triple {14439#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 15))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14440#(<= |ULTIMATE.start_main_~num~0#1| (+ 14 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:13,040 INFO L290 TraceCheckUtils]: 42: Hoare triple {14440#(<= |ULTIMATE.start_main_~num~0#1| (+ 14 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14440#(<= |ULTIMATE.start_main_~num~0#1| (+ 14 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:13,040 INFO L290 TraceCheckUtils]: 43: Hoare triple {14440#(<= |ULTIMATE.start_main_~num~0#1| (+ 14 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14440#(<= |ULTIMATE.start_main_~num~0#1| (+ 14 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:13,041 INFO L290 TraceCheckUtils]: 44: Hoare triple {14440#(<= |ULTIMATE.start_main_~num~0#1| (+ 14 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14441#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} is VALID [2022-02-21 03:37:13,041 INFO L290 TraceCheckUtils]: 45: Hoare triple {14441#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14441#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} is VALID [2022-02-21 03:37:13,041 INFO L290 TraceCheckUtils]: 46: Hoare triple {14441#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14441#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} is VALID [2022-02-21 03:37:13,042 INFO L290 TraceCheckUtils]: 47: Hoare triple {14441#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14442#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} is VALID [2022-02-21 03:37:13,042 INFO L290 TraceCheckUtils]: 48: Hoare triple {14442#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14442#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} is VALID [2022-02-21 03:37:13,042 INFO L290 TraceCheckUtils]: 49: Hoare triple {14442#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14442#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} is VALID [2022-02-21 03:37:13,043 INFO L290 TraceCheckUtils]: 50: Hoare triple {14442#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14443#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:37:13,043 INFO L290 TraceCheckUtils]: 51: Hoare triple {14443#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14443#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:37:13,043 INFO L290 TraceCheckUtils]: 52: Hoare triple {14443#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14443#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:37:13,044 INFO L290 TraceCheckUtils]: 53: Hoare triple {14443#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14444#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:37:13,044 INFO L290 TraceCheckUtils]: 54: Hoare triple {14444#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14444#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:37:13,044 INFO L290 TraceCheckUtils]: 55: Hoare triple {14444#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14444#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:37:13,045 INFO L290 TraceCheckUtils]: 56: Hoare triple {14444#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14445#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:13,045 INFO L290 TraceCheckUtils]: 57: Hoare triple {14445#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14445#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:13,045 INFO L290 TraceCheckUtils]: 58: Hoare triple {14445#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14445#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:13,046 INFO L290 TraceCheckUtils]: 59: Hoare triple {14445#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14446#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:37:13,046 INFO L290 TraceCheckUtils]: 60: Hoare triple {14446#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14446#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:37:13,046 INFO L290 TraceCheckUtils]: 61: Hoare triple {14446#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14446#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:37:13,047 INFO L290 TraceCheckUtils]: 62: Hoare triple {14446#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14447#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:13,047 INFO L290 TraceCheckUtils]: 63: Hoare triple {14447#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14447#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:13,047 INFO L290 TraceCheckUtils]: 64: Hoare triple {14447#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14447#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:13,048 INFO L290 TraceCheckUtils]: 65: Hoare triple {14447#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14448#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:13,048 INFO L290 TraceCheckUtils]: 66: Hoare triple {14448#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14448#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:13,048 INFO L290 TraceCheckUtils]: 67: Hoare triple {14448#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14448#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:13,049 INFO L290 TraceCheckUtils]: 68: Hoare triple {14448#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14449#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:13,049 INFO L290 TraceCheckUtils]: 69: Hoare triple {14449#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14449#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:13,049 INFO L290 TraceCheckUtils]: 70: Hoare triple {14449#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14449#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:13,050 INFO L290 TraceCheckUtils]: 71: Hoare triple {14449#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14450#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:37:13,050 INFO L290 TraceCheckUtils]: 72: Hoare triple {14450#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14450#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:37:13,050 INFO L290 TraceCheckUtils]: 73: Hoare triple {14450#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14450#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:37:13,051 INFO L290 TraceCheckUtils]: 74: Hoare triple {14450#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14451#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:13,051 INFO L290 TraceCheckUtils]: 75: Hoare triple {14451#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14451#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:13,051 INFO L290 TraceCheckUtils]: 76: Hoare triple {14451#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14451#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:13,052 INFO L290 TraceCheckUtils]: 77: Hoare triple {14451#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14452#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:13,052 INFO L290 TraceCheckUtils]: 78: Hoare triple {14452#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14452#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:13,052 INFO L290 TraceCheckUtils]: 79: Hoare triple {14452#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14452#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:13,053 INFO L290 TraceCheckUtils]: 80: Hoare triple {14452#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14453#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:37:13,053 INFO L290 TraceCheckUtils]: 81: Hoare triple {14453#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14453#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:37:13,053 INFO L290 TraceCheckUtils]: 82: Hoare triple {14453#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14453#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:37:13,053 INFO L290 TraceCheckUtils]: 83: Hoare triple {14453#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14454#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:37:13,054 INFO L290 TraceCheckUtils]: 84: Hoare triple {14454#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14419#false} is VALID [2022-02-21 03:37:13,054 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 330 proven. 302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:13,055 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:37:13,055 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454038716] [2022-02-21 03:37:13,055 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454038716] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:37:13,055 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516756234] [2022-02-21 03:37:13,055 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-21 03:37:13,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:37:13,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:13,057 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:37:13,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-02-21 03:37:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:13,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 36 conjunts are in the unsatisfiable core [2022-02-21 03:37:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:13,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:14,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {14418#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); {14418#true} is VALID [2022-02-21 03:37:14,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {14418#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {14461#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:14,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {14461#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14461#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:14,301 INFO L290 TraceCheckUtils]: 3: Hoare triple {14461#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14421#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:37:14,301 INFO L290 TraceCheckUtils]: 4: Hoare triple {14421#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14421#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:37:14,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {14421#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14422#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:14,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {14422#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14422#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:14,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {14422#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14423#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:37:14,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {14423#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14423#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:37:14,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {14423#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14424#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:14,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {14424#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14424#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:14,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {14424#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14425#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:37:14,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {14425#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14425#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:37:14,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {14425#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14426#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:37:14,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {14426#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14426#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:37:14,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {14426#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14427#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:37:14,305 INFO L290 TraceCheckUtils]: 16: Hoare triple {14427#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14427#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:37:14,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {14427#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14428#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:14,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {14428#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14428#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:14,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {14428#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14429#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:37:14,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {14429#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14429#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:37:14,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {14429#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14430#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:14,322 INFO L290 TraceCheckUtils]: 22: Hoare triple {14430#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14430#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:14,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {14430#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14431#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:37:14,324 INFO L290 TraceCheckUtils]: 24: Hoare triple {14431#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14431#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:37:14,324 INFO L290 TraceCheckUtils]: 25: Hoare triple {14431#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14432#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:37:14,325 INFO L290 TraceCheckUtils]: 26: Hoare triple {14432#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14432#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:37:14,325 INFO L290 TraceCheckUtils]: 27: Hoare triple {14432#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14433#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:37:14,326 INFO L290 TraceCheckUtils]: 28: Hoare triple {14433#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14433#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:37:14,326 INFO L290 TraceCheckUtils]: 29: Hoare triple {14433#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14434#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:37:14,327 INFO L290 TraceCheckUtils]: 30: Hoare triple {14434#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14434#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:37:14,328 INFO L290 TraceCheckUtils]: 31: Hoare triple {14434#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14435#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:37:14,328 INFO L290 TraceCheckUtils]: 32: Hoare triple {14435#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14435#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:37:14,329 INFO L290 TraceCheckUtils]: 33: Hoare triple {14435#(<= |ULTIMATE.start_main_~i~0#1| 15)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14436#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:37:14,329 INFO L290 TraceCheckUtils]: 34: Hoare triple {14436#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !(main_~i~0#1 < main_~num~0#1); {14437#(<= |ULTIMATE.start_main_~num~0#1| 16)} is VALID [2022-02-21 03:37:14,330 INFO L290 TraceCheckUtils]: 35: Hoare triple {14437#(<= |ULTIMATE.start_main_~num~0#1| 16)} main_~i~0#1 := 0; {14564#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,336 INFO L290 TraceCheckUtils]: 36: Hoare triple {14564#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14564#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,337 INFO L290 TraceCheckUtils]: 37: Hoare triple {14564#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14564#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,338 INFO L290 TraceCheckUtils]: 38: Hoare triple {14564#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14574#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,338 INFO L290 TraceCheckUtils]: 39: Hoare triple {14574#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14574#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,339 INFO L290 TraceCheckUtils]: 40: Hoare triple {14574#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14574#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,340 INFO L290 TraceCheckUtils]: 41: Hoare triple {14574#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14584#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,340 INFO L290 TraceCheckUtils]: 42: Hoare triple {14584#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14584#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,341 INFO L290 TraceCheckUtils]: 43: Hoare triple {14584#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14584#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,341 INFO L290 TraceCheckUtils]: 44: Hoare triple {14584#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14594#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,342 INFO L290 TraceCheckUtils]: 45: Hoare triple {14594#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14594#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,342 INFO L290 TraceCheckUtils]: 46: Hoare triple {14594#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14594#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,343 INFO L290 TraceCheckUtils]: 47: Hoare triple {14594#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14604#(and (<= |ULTIMATE.start_main_~num~0#1| 16) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,344 INFO L290 TraceCheckUtils]: 48: Hoare triple {14604#(and (<= |ULTIMATE.start_main_~num~0#1| 16) (<= 4 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14604#(and (<= |ULTIMATE.start_main_~num~0#1| 16) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,344 INFO L290 TraceCheckUtils]: 49: Hoare triple {14604#(and (<= |ULTIMATE.start_main_~num~0#1| 16) (<= 4 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14604#(and (<= |ULTIMATE.start_main_~num~0#1| 16) (<= 4 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,345 INFO L290 TraceCheckUtils]: 50: Hoare triple {14604#(and (<= |ULTIMATE.start_main_~num~0#1| 16) (<= 4 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14614#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,345 INFO L290 TraceCheckUtils]: 51: Hoare triple {14614#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14614#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,346 INFO L290 TraceCheckUtils]: 52: Hoare triple {14614#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14614#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,346 INFO L290 TraceCheckUtils]: 53: Hoare triple {14614#(and (<= 5 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14624#(and (<= |ULTIMATE.start_main_~num~0#1| 16) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,347 INFO L290 TraceCheckUtils]: 54: Hoare triple {14624#(and (<= |ULTIMATE.start_main_~num~0#1| 16) (<= 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14624#(and (<= |ULTIMATE.start_main_~num~0#1| 16) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,347 INFO L290 TraceCheckUtils]: 55: Hoare triple {14624#(and (<= |ULTIMATE.start_main_~num~0#1| 16) (<= 6 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14624#(and (<= |ULTIMATE.start_main_~num~0#1| 16) (<= 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,348 INFO L290 TraceCheckUtils]: 56: Hoare triple {14624#(and (<= |ULTIMATE.start_main_~num~0#1| 16) (<= 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14634#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,348 INFO L290 TraceCheckUtils]: 57: Hoare triple {14634#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14634#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,349 INFO L290 TraceCheckUtils]: 58: Hoare triple {14634#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14634#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,350 INFO L290 TraceCheckUtils]: 59: Hoare triple {14634#(and (<= 7 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14644#(and (<= |ULTIMATE.start_main_~num~0#1| 16) (<= 8 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,350 INFO L290 TraceCheckUtils]: 60: Hoare triple {14644#(and (<= |ULTIMATE.start_main_~num~0#1| 16) (<= 8 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14644#(and (<= |ULTIMATE.start_main_~num~0#1| 16) (<= 8 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,351 INFO L290 TraceCheckUtils]: 61: Hoare triple {14644#(and (<= |ULTIMATE.start_main_~num~0#1| 16) (<= 8 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14644#(and (<= |ULTIMATE.start_main_~num~0#1| 16) (<= 8 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,351 INFO L290 TraceCheckUtils]: 62: Hoare triple {14644#(and (<= |ULTIMATE.start_main_~num~0#1| 16) (<= 8 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14654#(and (<= 9 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,352 INFO L290 TraceCheckUtils]: 63: Hoare triple {14654#(and (<= 9 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14654#(and (<= 9 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,352 INFO L290 TraceCheckUtils]: 64: Hoare triple {14654#(and (<= 9 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14654#(and (<= 9 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,353 INFO L290 TraceCheckUtils]: 65: Hoare triple {14654#(and (<= 9 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14664#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,353 INFO L290 TraceCheckUtils]: 66: Hoare triple {14664#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14664#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,354 INFO L290 TraceCheckUtils]: 67: Hoare triple {14664#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14664#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,354 INFO L290 TraceCheckUtils]: 68: Hoare triple {14664#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14674#(and (<= |ULTIMATE.start_main_~num~0#1| 16) (<= 11 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,355 INFO L290 TraceCheckUtils]: 69: Hoare triple {14674#(and (<= |ULTIMATE.start_main_~num~0#1| 16) (<= 11 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14674#(and (<= |ULTIMATE.start_main_~num~0#1| 16) (<= 11 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,356 INFO L290 TraceCheckUtils]: 70: Hoare triple {14674#(and (<= |ULTIMATE.start_main_~num~0#1| 16) (<= 11 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14674#(and (<= |ULTIMATE.start_main_~num~0#1| 16) (<= 11 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,356 INFO L290 TraceCheckUtils]: 71: Hoare triple {14674#(and (<= |ULTIMATE.start_main_~num~0#1| 16) (<= 11 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14684#(and (<= 12 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,357 INFO L290 TraceCheckUtils]: 72: Hoare triple {14684#(and (<= 12 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14684#(and (<= 12 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,357 INFO L290 TraceCheckUtils]: 73: Hoare triple {14684#(and (<= 12 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14684#(and (<= 12 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,358 INFO L290 TraceCheckUtils]: 74: Hoare triple {14684#(and (<= 12 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14694#(and (<= 13 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,358 INFO L290 TraceCheckUtils]: 75: Hoare triple {14694#(and (<= 13 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14694#(and (<= 13 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,359 INFO L290 TraceCheckUtils]: 76: Hoare triple {14694#(and (<= 13 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14694#(and (<= 13 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,359 INFO L290 TraceCheckUtils]: 77: Hoare triple {14694#(and (<= 13 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14704#(and (<= 14 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,360 INFO L290 TraceCheckUtils]: 78: Hoare triple {14704#(and (<= 14 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14704#(and (<= 14 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,360 INFO L290 TraceCheckUtils]: 79: Hoare triple {14704#(and (<= 14 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14704#(and (<= 14 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,361 INFO L290 TraceCheckUtils]: 80: Hoare triple {14704#(and (<= 14 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14714#(and (<= 15 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,361 INFO L290 TraceCheckUtils]: 81: Hoare triple {14714#(and (<= 15 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14714#(and (<= 15 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,362 INFO L290 TraceCheckUtils]: 82: Hoare triple {14714#(and (<= 15 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14714#(and (<= 15 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} is VALID [2022-02-21 03:37:14,363 INFO L290 TraceCheckUtils]: 83: Hoare triple {14714#(and (<= 15 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~num~0#1| 16))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14724#(and (<= |ULTIMATE.start_main_~num~0#1| 16) (<= 16 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,363 INFO L290 TraceCheckUtils]: 84: Hoare triple {14724#(and (<= |ULTIMATE.start_main_~num~0#1| 16) (<= 16 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14419#false} is VALID [2022-02-21 03:37:14,364 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 376 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:14,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:37:14,934 INFO L290 TraceCheckUtils]: 84: Hoare triple {14454#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14419#false} is VALID [2022-02-21 03:37:14,935 INFO L290 TraceCheckUtils]: 83: Hoare triple {14453#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14454#(<= |ULTIMATE.start_main_~num~0#1| |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:37:14,935 INFO L290 TraceCheckUtils]: 82: Hoare triple {14453#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14453#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:37:14,936 INFO L290 TraceCheckUtils]: 81: Hoare triple {14453#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14453#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:37:14,936 INFO L290 TraceCheckUtils]: 80: Hoare triple {14452#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14453#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:37:14,936 INFO L290 TraceCheckUtils]: 79: Hoare triple {14452#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14452#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,937 INFO L290 TraceCheckUtils]: 78: Hoare triple {14452#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14452#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,937 INFO L290 TraceCheckUtils]: 77: Hoare triple {14451#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14452#(<= |ULTIMATE.start_main_~num~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,937 INFO L290 TraceCheckUtils]: 76: Hoare triple {14451#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14451#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,938 INFO L290 TraceCheckUtils]: 75: Hoare triple {14451#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14451#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,938 INFO L290 TraceCheckUtils]: 74: Hoare triple {14450#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14451#(<= |ULTIMATE.start_main_~num~0#1| (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,938 INFO L290 TraceCheckUtils]: 73: Hoare triple {14450#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14450#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:37:14,939 INFO L290 TraceCheckUtils]: 72: Hoare triple {14450#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14450#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:37:14,939 INFO L290 TraceCheckUtils]: 71: Hoare triple {14449#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14450#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 4))} is VALID [2022-02-21 03:37:14,939 INFO L290 TraceCheckUtils]: 70: Hoare triple {14449#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14449#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,939 INFO L290 TraceCheckUtils]: 69: Hoare triple {14449#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14449#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,940 INFO L290 TraceCheckUtils]: 68: Hoare triple {14448#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14449#(<= |ULTIMATE.start_main_~num~0#1| (+ 5 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,940 INFO L290 TraceCheckUtils]: 67: Hoare triple {14448#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14448#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,940 INFO L290 TraceCheckUtils]: 66: Hoare triple {14448#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14448#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,941 INFO L290 TraceCheckUtils]: 65: Hoare triple {14447#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14448#(<= |ULTIMATE.start_main_~num~0#1| (+ 6 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,941 INFO L290 TraceCheckUtils]: 64: Hoare triple {14447#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14447#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,941 INFO L290 TraceCheckUtils]: 63: Hoare triple {14447#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14447#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,942 INFO L290 TraceCheckUtils]: 62: Hoare triple {14446#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14447#(<= |ULTIMATE.start_main_~num~0#1| (+ 7 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,943 INFO L290 TraceCheckUtils]: 61: Hoare triple {14446#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14446#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:37:14,944 INFO L290 TraceCheckUtils]: 60: Hoare triple {14446#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14446#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:37:14,944 INFO L290 TraceCheckUtils]: 59: Hoare triple {14445#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14446#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 8))} is VALID [2022-02-21 03:37:14,945 INFO L290 TraceCheckUtils]: 58: Hoare triple {14445#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14445#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,945 INFO L290 TraceCheckUtils]: 57: Hoare triple {14445#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14445#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,946 INFO L290 TraceCheckUtils]: 56: Hoare triple {14444#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14445#(<= |ULTIMATE.start_main_~num~0#1| (+ 9 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,946 INFO L290 TraceCheckUtils]: 55: Hoare triple {14444#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14444#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:37:14,947 INFO L290 TraceCheckUtils]: 54: Hoare triple {14444#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14444#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:37:14,947 INFO L290 TraceCheckUtils]: 53: Hoare triple {14443#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14444#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:37:14,947 INFO L290 TraceCheckUtils]: 52: Hoare triple {14443#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14443#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:37:14,948 INFO L290 TraceCheckUtils]: 51: Hoare triple {14443#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14443#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:37:14,948 INFO L290 TraceCheckUtils]: 50: Hoare triple {14442#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14443#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 11))} is VALID [2022-02-21 03:37:14,949 INFO L290 TraceCheckUtils]: 49: Hoare triple {14442#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14442#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} is VALID [2022-02-21 03:37:14,949 INFO L290 TraceCheckUtils]: 48: Hoare triple {14442#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14442#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} is VALID [2022-02-21 03:37:14,950 INFO L290 TraceCheckUtils]: 47: Hoare triple {14441#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14442#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 12))} is VALID [2022-02-21 03:37:14,950 INFO L290 TraceCheckUtils]: 46: Hoare triple {14441#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14441#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} is VALID [2022-02-21 03:37:14,950 INFO L290 TraceCheckUtils]: 45: Hoare triple {14441#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14441#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} is VALID [2022-02-21 03:37:14,950 INFO L290 TraceCheckUtils]: 44: Hoare triple {14440#(<= |ULTIMATE.start_main_~num~0#1| (+ 14 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14441#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 13))} is VALID [2022-02-21 03:37:14,951 INFO L290 TraceCheckUtils]: 43: Hoare triple {14440#(<= |ULTIMATE.start_main_~num~0#1| (+ 14 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14440#(<= |ULTIMATE.start_main_~num~0#1| (+ 14 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,951 INFO L290 TraceCheckUtils]: 42: Hoare triple {14440#(<= |ULTIMATE.start_main_~num~0#1| (+ 14 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14440#(<= |ULTIMATE.start_main_~num~0#1| (+ 14 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,951 INFO L290 TraceCheckUtils]: 41: Hoare triple {14439#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 15))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14440#(<= |ULTIMATE.start_main_~num~0#1| (+ 14 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,952 INFO L290 TraceCheckUtils]: 40: Hoare triple {14439#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 15))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14439#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 15))} is VALID [2022-02-21 03:37:14,952 INFO L290 TraceCheckUtils]: 39: Hoare triple {14439#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 15))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14439#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 15))} is VALID [2022-02-21 03:37:14,953 INFO L290 TraceCheckUtils]: 38: Hoare triple {14866#(<= |ULTIMATE.start_main_~num~0#1| (+ 16 |ULTIMATE.start_main_~i~0#1|))} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {14439#(<= |ULTIMATE.start_main_~num~0#1| (+ |ULTIMATE.start_main_~i~0#1| 15))} is VALID [2022-02-21 03:37:14,953 INFO L290 TraceCheckUtils]: 37: Hoare triple {14866#(<= |ULTIMATE.start_main_~num~0#1| (+ 16 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {14866#(<= |ULTIMATE.start_main_~num~0#1| (+ 16 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,953 INFO L290 TraceCheckUtils]: 36: Hoare triple {14866#(<= |ULTIMATE.start_main_~num~0#1| (+ 16 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {14866#(<= |ULTIMATE.start_main_~num~0#1| (+ 16 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,953 INFO L290 TraceCheckUtils]: 35: Hoare triple {14437#(<= |ULTIMATE.start_main_~num~0#1| 16)} main_~i~0#1 := 0; {14866#(<= |ULTIMATE.start_main_~num~0#1| (+ 16 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:37:14,954 INFO L290 TraceCheckUtils]: 34: Hoare triple {14436#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !(main_~i~0#1 < main_~num~0#1); {14437#(<= |ULTIMATE.start_main_~num~0#1| 16)} is VALID [2022-02-21 03:37:14,954 INFO L290 TraceCheckUtils]: 33: Hoare triple {14435#(<= |ULTIMATE.start_main_~i~0#1| 15)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14436#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:37:14,954 INFO L290 TraceCheckUtils]: 32: Hoare triple {14435#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14435#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:37:14,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {14434#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14435#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:37:14,955 INFO L290 TraceCheckUtils]: 30: Hoare triple {14434#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14434#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:37:14,955 INFO L290 TraceCheckUtils]: 29: Hoare triple {14433#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14434#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:37:14,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {14433#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14433#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:37:14,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {14432#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14433#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:37:14,956 INFO L290 TraceCheckUtils]: 26: Hoare triple {14432#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14432#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:37:14,957 INFO L290 TraceCheckUtils]: 25: Hoare triple {14431#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14432#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:37:14,957 INFO L290 TraceCheckUtils]: 24: Hoare triple {14431#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14431#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:37:14,957 INFO L290 TraceCheckUtils]: 23: Hoare triple {14430#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14431#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:37:14,958 INFO L290 TraceCheckUtils]: 22: Hoare triple {14430#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14430#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:14,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {14429#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14430#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:37:14,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {14429#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14429#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:37:14,959 INFO L290 TraceCheckUtils]: 19: Hoare triple {14428#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14429#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:37:14,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {14428#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14428#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:14,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {14427#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14428#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:37:14,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {14427#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14427#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:37:14,960 INFO L290 TraceCheckUtils]: 15: Hoare triple {14426#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14427#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:37:14,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {14426#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14426#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:37:14,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {14425#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14426#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:37:14,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {14425#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14425#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:37:14,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {14424#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14425#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:37:14,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {14424#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14424#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:14,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {14423#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14424#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:37:14,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {14423#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14423#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:37:14,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {14422#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14423#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:37:14,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {14422#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14422#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:14,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {14421#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14422#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:37:14,963 INFO L290 TraceCheckUtils]: 4: Hoare triple {14421#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14421#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:37:14,964 INFO L290 TraceCheckUtils]: 3: Hoare triple {14461#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {14421#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:37:14,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {14461#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {14461#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:14,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {14418#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {14461#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:37:14,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {14418#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); {14418#true} is VALID [2022-02-21 03:37:14,965 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 376 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:14,965 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516756234] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:37:14,965 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:37:14,965 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 55 [2022-02-21 03:37:14,965 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189120601] [2022-02-21 03:37:14,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:37:15,006 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:37:15,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-02-21 03:37:15,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=2355, Unknown=0, NotChecked=0, Total=3080 [2022-02-21 03:37:15,008 INFO L87 Difference]: Start difference. First operand 140 states and 159 transitions. cyclomatic complexity: 22 Second operand has 56 states, 55 states have (on average 2.581818181818182) internal successors, (142), 56 states have internal predecessors, (142), 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-21 03:37:17,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:17,516 INFO L93 Difference]: Finished difference Result 453 states and 524 transitions. [2022-02-21 03:37:17,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-02-21 03:37:17,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 56 states, 55 states have (on average 2.581818181818182) internal successors, (142), 56 states have internal predecessors, (142), 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-21 03:37:17,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:17,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 453 states and 524 transitions. [2022-02-21 03:37:17,647 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:37:17,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 453 states to 256 states and 294 transitions. [2022-02-21 03:37:17,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 221 [2022-02-21 03:37:17,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 221 [2022-02-21 03:37:17,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 256 states and 294 transitions. [2022-02-21 03:37:17,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:37:17,652 INFO L681 BuchiCegarLoop]: Abstraction has 256 states and 294 transitions. [2022-02-21 03:37:17,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states and 294 transitions. [2022-02-21 03:37:17,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 148. [2022-02-21 03:37:17,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:17,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 256 states and 294 transitions. Second operand has 148 states, 148 states have (on average 1.135135135135135) internal successors, (168), 147 states have internal predecessors, (168), 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-21 03:37:17,654 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states and 294 transitions. Second operand has 148 states, 148 states have (on average 1.135135135135135) internal successors, (168), 147 states have internal predecessors, (168), 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-21 03:37:17,655 INFO L87 Difference]: Start difference. First operand 256 states and 294 transitions. Second operand has 148 states, 148 states have (on average 1.135135135135135) internal successors, (168), 147 states have internal predecessors, (168), 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-21 03:37:17,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:17,658 INFO L93 Difference]: Finished difference Result 256 states and 294 transitions. [2022-02-21 03:37:17,658 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 294 transitions. [2022-02-21 03:37:17,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:17,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:17,659 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 148 states have (on average 1.135135135135135) internal successors, (168), 147 states have internal predecessors, (168), 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 256 states and 294 transitions. [2022-02-21 03:37:17,659 INFO L87 Difference]: Start difference. First operand has 148 states, 148 states have (on average 1.135135135135135) internal successors, (168), 147 states have internal predecessors, (168), 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 256 states and 294 transitions. [2022-02-21 03:37:17,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:17,663 INFO L93 Difference]: Finished difference Result 256 states and 294 transitions. [2022-02-21 03:37:17,663 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 294 transitions. [2022-02-21 03:37:17,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:17,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:17,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:17,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:17,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 148 states have (on average 1.135135135135135) internal successors, (168), 147 states have internal predecessors, (168), 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-21 03:37:17,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 168 transitions. [2022-02-21 03:37:17,665 INFO L704 BuchiCegarLoop]: Abstraction has 148 states and 168 transitions. [2022-02-21 03:37:17,666 INFO L587 BuchiCegarLoop]: Abstraction has 148 states and 168 transitions. [2022-02-21 03:37:17,666 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2022-02-21 03:37:17,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 148 states and 168 transitions. [2022-02-21 03:37:17,667 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2022-02-21 03:37:17,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:17,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:17,667 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [17, 17, 17, 16, 16, 1, 1, 1, 1] [2022-02-21 03:37:17,667 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:17,668 INFO L791 eck$LassoCheckResult]: Stem: 15467#ULTIMATE.startENTRY 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); 15468#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; 15473#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 15488#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 15489#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 15476#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 15477#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 15523#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 15522#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 15521#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 15520#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 15519#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 15518#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 15517#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 15516#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 15515#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 15514#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 15513#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 15512#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 15511#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 15510#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 15509#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 15508#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 15507#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 15506#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 15505#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 15504#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 15503#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 15502#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 15501#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 15500#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 15499#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 15498#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 15497#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 15496#L27-3 assume !!(main_~i~0#1 < main_~num~0#1);call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; 15492#L27-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 15491#L27-3 assume !(main_~i~0#1 < main_~num~0#1); 15478#L27-4 main_~i~0#1 := 0; 15479#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 15531#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 15532#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 15533#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 15537#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 15536#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 15609#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 15606#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 15604#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 15603#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 15600#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 15598#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 15597#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 15594#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 15592#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 15591#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 15588#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 15586#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 15585#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 15582#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 15580#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 15579#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 15576#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 15574#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 15573#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 15570#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 15568#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 15567#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 15564#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 15562#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 15561#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 15558#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 15556#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 15555#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 15552#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 15550#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 15549#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 15546#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 15544#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 15543#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 15541#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 15540#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 15539#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 15485#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 15472#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 15482#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 15487#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 15528#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 15527#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 15494#L34 [2022-02-21 03:37:17,668 INFO L793 eck$LassoCheckResult]: Loop: 15494#L34 assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; 15495#L32-2 main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 15493#L32-3 assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); 15494#L34 [2022-02-21 03:37:17,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:17,668 INFO L85 PathProgramCache]: Analyzing trace with hash 611108235, now seen corresponding path program 32 times [2022-02-21 03:37:17,669 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:17,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398619508] [2022-02-21 03:37:17,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:17,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:17,787 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:17,868 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:17,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:17,869 INFO L85 PathProgramCache]: Analyzing trace with hash 69557, now seen corresponding path program 18 times [2022-02-21 03:37:17,870 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:17,870 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820505240] [2022-02-21 03:37:17,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:17,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:17,875 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:17,878 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:17,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:17,879 INFO L85 PathProgramCache]: Analyzing trace with hash -840899093, now seen corresponding path program 33 times [2022-02-21 03:37:17,879 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:17,879 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454976040] [2022-02-21 03:37:17,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:17,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat