./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.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-industry-pattern/array_assert_loop_dep.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 fb960067570884de0638f14e8f74b0912d9ff4ed83f9c3c33e6cd3e420d05661 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:36:28,356 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:36:28,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:36:28,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:36:28,391 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:36:28,393 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:36:28,394 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:36:28,396 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:36:28,397 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:36:28,401 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:36:28,401 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:36:28,402 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:36:28,403 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:36:28,404 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:36:28,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:36:28,408 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:36:28,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:36:28,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:36:28,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:36:28,415 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:36:28,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:36:28,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:36:28,418 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:36:28,418 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:36:28,423 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:36:28,423 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:36:28,423 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:36:28,424 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:36:28,425 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:36:28,426 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:36:28,426 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:36:28,427 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:36:28,428 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:36:28,429 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:36:28,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:36:28,430 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:36:28,430 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:36:28,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:36:28,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:36:28,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:36:28,431 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:36:28,432 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:28,456 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:36:28,456 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:36:28,457 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:36:28,457 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:36:28,458 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:36:28,458 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:36:28,458 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:36:28,458 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:36:28,459 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:36:28,459 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:36:28,460 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:36:28,460 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:36:28,460 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:36:28,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:36:28,460 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:36:28,460 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:36:28,460 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:36:28,461 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:36:28,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:36:28,461 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:36:28,461 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:36:28,461 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:36:28,461 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:36:28,461 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:36:28,463 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:36:28,463 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:36:28,463 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:36:28,463 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:36:28,463 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:36:28,463 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:36:28,464 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:36:28,464 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:36:28,465 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 -> fb960067570884de0638f14e8f74b0912d9ff4ed83f9c3c33e6cd3e420d05661 [2022-02-21 03:36:28,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:36:28,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:36:28,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:36:28,707 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:36:28,708 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:36:28,709 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2022-02-21 03:36:28,773 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad53f0fb9/fe36cfd1531f4cb6bfae496913b4b1ca/FLAG092c28bb4 [2022-02-21 03:36:29,113 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:36:29,114 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2022-02-21 03:36:29,121 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad53f0fb9/fe36cfd1531f4cb6bfae496913b4b1ca/FLAG092c28bb4 [2022-02-21 03:36:29,546 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad53f0fb9/fe36cfd1531f4cb6bfae496913b4b1ca [2022-02-21 03:36:29,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:36:29,550 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:36:29,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:36:29,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:36:29,558 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:36:29,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:36:29" (1/1) ... [2022-02-21 03:36:29,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6725d14d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:29, skipping insertion in model container [2022-02-21 03:36:29,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:36:29" (1/1) ... [2022-02-21 03:36:29,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:36:29,576 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:36:29,720 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-industry-pattern/array_assert_loop_dep.i[814,827] [2022-02-21 03:36:29,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:36:29,755 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:36:29,778 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-industry-pattern/array_assert_loop_dep.i[814,827] [2022-02-21 03:36:29,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:36:29,792 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:36:29,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:29 WrapperNode [2022-02-21 03:36:29,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:36:29,794 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:36:29,794 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:36:29,794 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:36:29,800 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:29" (1/1) ... [2022-02-21 03:36:29,807 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:29" (1/1) ... [2022-02-21 03:36:29,824 INFO L137 Inliner]: procedures = 15, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 44 [2022-02-21 03:36:29,824 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:36:29,825 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:36:29,825 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:36:29,826 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:36:29,832 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:29" (1/1) ... [2022-02-21 03:36:29,832 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:29" (1/1) ... [2022-02-21 03:36:29,833 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:29" (1/1) ... [2022-02-21 03:36:29,833 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:29" (1/1) ... [2022-02-21 03:36:29,837 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:29" (1/1) ... [2022-02-21 03:36:29,840 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:29" (1/1) ... [2022-02-21 03:36:29,841 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:29" (1/1) ... [2022-02-21 03:36:29,842 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:36:29,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:36:29,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:36:29,843 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:36:29,847 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:29" (1/1) ... [2022-02-21 03:36:29,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:29,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:29,879 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:29,885 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:29,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:36:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:36:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:36:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:36:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:36:29,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:36:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:36:29,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:36:29,958 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:36:29,959 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:36:30,063 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:36:30,067 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:36:30,068 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:36:30,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:36:30 BoogieIcfgContainer [2022-02-21 03:36:30,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:36:30,070 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:36:30,070 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:36:30,073 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:36:30,074 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:30,074 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:36:29" (1/3) ... [2022-02-21 03:36:30,075 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63b52b1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:36:30, skipping insertion in model container [2022-02-21 03:36:30,075 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:30,075 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:29" (2/3) ... [2022-02-21 03:36:30,076 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63b52b1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:36:30, skipping insertion in model container [2022-02-21 03:36:30,079 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:30,079 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:36:30" (3/3) ... [2022-02-21 03:36:30,080 INFO L388 chiAutomizerObserver]: Analyzing ICFG array_assert_loop_dep.i [2022-02-21 03:36:30,118 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:36:30,118 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:36:30,119 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:36:30,119 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:36:30,119 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:36:30,119 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:36:30,119 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:36:30,119 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:36:30,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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,145 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:36:30,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:30,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:30,151 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:36:30,151 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:36:30,151 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:36:30,152 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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,154 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:36:30,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:30,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:30,155 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:36:30,155 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:36:30,161 INFO L791 eck$LassoCheckResult]: Stem: 4#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(24, 2); 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 13#L18-3true [2022-02-21 03:36:30,161 INFO L793 eck$LassoCheckResult]: Loop: 13#L18-3true assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 12#L18-2true main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 13#L18-3true [2022-02-21 03:36:30,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:30,167 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:36:30,173 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:30,174 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553678880] [2022-02-21 03:36:30,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:30,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:30,236 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:30,255 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:30,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:30,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-02-21 03:36:30,257 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:30,257 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242072577] [2022-02-21 03:36:30,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:30,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:30,286 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:30,292 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:30,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:30,294 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-02-21 03:36:30,294 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:30,294 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301836409] [2022-02-21 03:36:30,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:30,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:30,314 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:30,329 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:30,647 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:36:30,648 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:36:30,648 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:36:30,648 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:36:30,648 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:36:30,649 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:30,649 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:36:30,649 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:36:30,649 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_assert_loop_dep.i_Iteration1_Lasso [2022-02-21 03:36:30,649 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:36:30,649 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:36:30,663 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:30,842 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:30,854 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:30,857 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:30,861 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:30,864 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:30,867 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:31,132 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:36:31,135 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:36:31,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:31,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:31,145 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:31,149 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:31,149 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:31,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:31,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:31,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:31,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:31,164 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:31,165 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:31,181 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:31,200 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:31,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:31,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:31,201 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:31,204 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:31,204 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:31,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:31,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:31,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:31,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:31,214 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:31,215 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:31,228 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:31,245 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:31,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:31,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:31,246 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:31,247 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:31,248 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:31,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:31,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:31,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:31,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:31,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:31,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:31,272 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:31,291 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:31,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:31,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:31,293 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:31,303 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:31,304 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:31,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:31,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:31,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:31,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:31,312 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:31,312 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:31,327 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:31,346 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:31,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:31,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:31,348 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:31,349 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:31,351 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:31,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:31,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:31,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:31,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:31,359 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:31,359 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:31,371 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:31,394 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:31,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:31,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:31,408 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:31,409 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:31,411 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:31,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:31,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:31,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:31,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:31,420 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:31,420 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:31,431 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:31,448 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:31,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:31,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:31,450 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:31,450 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:31,452 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:31,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:31,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:31,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:31,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:31,461 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:31,461 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:31,487 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:31,508 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:31,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:31,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:31,510 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:31,510 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:31,512 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:31,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:31,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:31,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:31,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:31,520 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:31,520 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:31,536 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:31,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:31,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:31,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:31,554 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:31,555 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:31,557 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:31,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:31,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:31,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:31,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:31,566 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:31,567 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:31,579 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:36:31,620 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2022-02-21 03:36:31,621 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-02-21 03:36:31,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:31,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:31,624 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:31,625 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:31,626 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:36:31,660 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:36:31,661 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:36:31,661 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1) = -8*ULTIMATE.start_main_~i~0#1 + 199999*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 Supporting invariants [] [2022-02-21 03:36:31,692 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:31,716 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2022-02-21 03:36:31,722 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);" "main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;" [2022-02-21 03:36:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:31,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:31,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:36:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:31,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:31,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#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(24, 2); {25#unseeded} is VALID [2022-02-21 03:36:31,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {25#unseeded} is VALID [2022-02-21 03:36:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:31,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:36:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:31,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:31,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(>= oldRank0 (+ (* 199999 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (* (- 8) |ULTIMATE.start_main_~i~0#1|)))} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {71#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (>= oldRank0 (+ (* |ULTIMATE.start_main_~i~0#1| (- 8)) (* (select |#length| |ULTIMATE.start_main_~#a~0#1.base|) 199999))) (< |ULTIMATE.start_main_~i~0#1| 100000))} is VALID [2022-02-21 03:36:31,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {71#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (>= oldRank0 (+ (* |ULTIMATE.start_main_~i~0#1| (- 8)) (* (select |#length| |ULTIMATE.start_main_~#a~0#1.base|) 199999))) (< |ULTIMATE.start_main_~i~0#1| 100000))} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {63#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* 199999 (select |#length| |ULTIMATE.start_main_~#a~0#1.base|)) (* (- 8) |ULTIMATE.start_main_~i~0#1|)))))} is VALID [2022-02-21 03:36:31,885 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:31,904 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:31,912 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:31,915 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:31,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:31,919 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:31,921 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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:31,987 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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 29 states and 41 transitions. Complement of second has 8 states. [2022-02-21 03:36:31,988 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:31,988 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:31,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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,992 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:36:31,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:31,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:31,997 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:32,000 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:36:32,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:32,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:32,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 41 transitions. [2022-02-21 03:36:32,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:36:32,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:32,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:32,005 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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:32,009 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:36:32,014 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:36:32,015 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:32,017 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:36:32,018 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:36:32,018 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 41 transitions. cyclomatic complexity: 15 [2022-02-21 03:36:32,019 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:36:32,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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:32,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,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:32,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:36:32,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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:32,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,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 1 letters. Loop has 2 letters. [2022-02-21 03:36:32,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:32,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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 5 letters. [2022-02-21 03:36:32,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,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 4 letters. Loop has 5 letters. [2022-02-21 03:36:32,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:36:32,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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 29 letters. Loop has 29 letters. [2022-02-21 03:36:32,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,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 29 letters. Loop has 29 letters. [2022-02-21 03:36:32,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:36:32,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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 15 letters. Loop has 15 letters. [2022-02-21 03:36:32,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,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 15 letters. Loop has 15 letters. [2022-02-21 03:36:32,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:36:32,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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:32,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,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 5 letters. Loop has 5 letters. [2022-02-21 03:36:32,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:32,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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 5 letters. [2022-02-21 03:36:32,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,036 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 5 letters. [2022-02-21 03:36:32,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:36:32,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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 5 letters. [2022-02-21 03:36:32,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,038 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 5 letters. [2022-02-21 03:36:32,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:36:32,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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 5 letters. [2022-02-21 03:36:32,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,056 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 5 letters. [2022-02-21 03:36:32,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:36:32,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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 5 letters. [2022-02-21 03:36:32,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,057 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 5 letters. [2022-02-21 03:36:32,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:36:32,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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:32,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,058 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:32,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:32,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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:32,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,058 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:32,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:36:32,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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:32,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,059 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:32,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:36:32,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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:32,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,060 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:32,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:36:32,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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:32,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,060 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:32,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:36:32,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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:32,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,061 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:32,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:36:32,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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 5 letters. [2022-02-21 03:36:32,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,062 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 5 letters. [2022-02-21 03:36:32,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 5 letters. [2022-02-21 03:36:32,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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:32,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,062 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:32,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:36:32,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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:32,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,063 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:32,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:36:32,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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 5 letters. [2022-02-21 03:36:32,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,064 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 5 letters. [2022-02-21 03:36:32,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:36:32,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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 5 letters. [2022-02-21 03:36:32,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,065 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 5 letters. [2022-02-21 03:36:32,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 5 letters. [2022-02-21 03:36:32,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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 5 letters. [2022-02-21 03:36:32,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,065 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 5 letters. [2022-02-21 03:36:32,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 5 letters. [2022-02-21 03:36:32,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,066 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:32,070 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:32,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-02-21 03:36:32,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:36:32,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:36:32,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:36:32,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:32,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 41 transitions. cyclomatic complexity: 15 [2022-02-21 03:36:32,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:36:32,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 12 states and 16 transitions. [2022-02-21 03:36:32,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:36:32,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 03:36:32,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2022-02-21 03:36:32,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:32,078 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 03:36:32,082 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:32,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2022-02-21 03:36:32,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-21 03:36:32,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:32,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:32,100 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:32,102 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:32,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:32,105 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2022-02-21 03:36:32,105 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-02-21 03:36:32,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:32,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:32,105 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states and 16 transitions. [2022-02-21 03:36:32,106 INFO L87 Difference]: Start difference. First operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states and 16 transitions. [2022-02-21 03:36:32,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:32,109 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2022-02-21 03:36:32,109 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-02-21 03:36:32,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:32,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:32,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:32,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:32,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:32,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-02-21 03:36:32,112 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 03:36:32,113 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 03:36:32,113 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:36:32,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2022-02-21 03:36:32,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:36:32,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:32,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:32,116 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:36:32,116 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:36:32,116 INFO L791 eck$LassoCheckResult]: Stem: 118#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(24, 2); 119#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 122#L18-3 assume !(main_~i~0#1 < 100000); 123#L18-4 main_~i~0#1 := 0; 124#L22-3 [2022-02-21 03:36:32,117 INFO L793 eck$LassoCheckResult]: Loop: 124#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 117#L13 assume !(0 == __VERIFIER_assert_~cond#1); 116#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 125#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 126#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 124#L22-3 [2022-02-21 03:36:32,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:32,119 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2022-02-21 03:36:32,119 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:32,120 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435169583] [2022-02-21 03:36:32,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:32,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:32,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {154#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(24, 2); {154#true} is VALID [2022-02-21 03:36:32,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {156#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:32,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 100000); {155#false} is VALID [2022-02-21 03:36:32,188 INFO L290 TraceCheckUtils]: 3: Hoare triple {155#false} main_~i~0#1 := 0; {155#false} is VALID [2022-02-21 03:36:32,189 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:32,189 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:32,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435169583] [2022-02-21 03:36:32,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435169583] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:36:32,189 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:36:32,189 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:36:32,190 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371240271] [2022-02-21 03:36:32,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:36:32,191 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:32,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:32,192 INFO L85 PathProgramCache]: Analyzing trace with hash 51750045, now seen corresponding path program 1 times [2022-02-21 03:36:32,192 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:32,192 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155190548] [2022-02-21 03:36:32,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:32,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:32,213 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:32,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:32,219 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:32,337 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:32,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:36:32,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:36:32,340 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 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:32,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:32,366 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-02-21 03:36:32,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:36:32,366 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:32,369 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:32,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2022-02-21 03:36:32,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:36:32,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 19 transitions. [2022-02-21 03:36:32,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 03:36:32,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 03:36:32,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2022-02-21 03:36:32,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:32,372 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-02-21 03:36:32,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2022-02-21 03:36:32,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2022-02-21 03:36:32,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:32,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 19 transitions. Second operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 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:32,374 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 19 transitions. Second operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 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:32,374 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 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:32,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:32,375 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-02-21 03:36:32,375 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-02-21 03:36:32,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:32,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:32,375 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 states and 19 transitions. [2022-02-21 03:36:32,375 INFO L87 Difference]: Start difference. First operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 states and 19 transitions. [2022-02-21 03:36:32,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:32,376 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-02-21 03:36:32,376 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-02-21 03:36:32,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:32,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:32,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:32,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:32,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 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:32,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-02-21 03:36:32,377 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-02-21 03:36:32,377 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-02-21 03:36:32,377 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:36:32,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2022-02-21 03:36:32,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:36:32,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:32,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:32,378 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:32,378 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:36:32,378 INFO L791 eck$LassoCheckResult]: Stem: 180#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(24, 2); 181#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 184#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 182#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 183#L18-3 assume !(main_~i~0#1 < 100000); 185#L18-4 main_~i~0#1 := 0; 186#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 192#L13 assume !(0 == __VERIFIER_assert_~cond#1); 191#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 187#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 188#L22-2 [2022-02-21 03:36:32,378 INFO L793 eck$LassoCheckResult]: Loop: 188#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 190#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 178#L13 assume !(0 == __VERIFIER_assert_~cond#1); 179#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 189#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 188#L22-2 [2022-02-21 03:36:32,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:32,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1436006135, now seen corresponding path program 1 times [2022-02-21 03:36:32,379 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:32,379 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181259383] [2022-02-21 03:36:32,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:32,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:32,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {230#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(24, 2); {230#true} is VALID [2022-02-21 03:36:32,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {230#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {232#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:32,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {232#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:32,409 INFO L290 TraceCheckUtils]: 3: Hoare triple {232#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {233#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:32,410 INFO L290 TraceCheckUtils]: 4: Hoare triple {233#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {231#false} is VALID [2022-02-21 03:36:32,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#false} main_~i~0#1 := 0; {231#false} is VALID [2022-02-21 03:36:32,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {231#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {231#false} is VALID [2022-02-21 03:36:32,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {231#false} assume !(0 == __VERIFIER_assert_~cond#1); {231#false} is VALID [2022-02-21 03:36:32,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {231#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {231#false} is VALID [2022-02-21 03:36:32,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {231#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {231#false} is VALID [2022-02-21 03:36:32,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:32,411 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:32,411 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181259383] [2022-02-21 03:36:32,411 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181259383] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:32,411 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927892074] [2022-02-21 03:36:32,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:32,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:32,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:32,413 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:32,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-21 03:36:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:32,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:36:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:32,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:32,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {230#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(24, 2); {230#true} is VALID [2022-02-21 03:36:32,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {230#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {240#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:32,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {240#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {240#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:32,488 INFO L290 TraceCheckUtils]: 3: Hoare triple {240#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {233#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:32,488 INFO L290 TraceCheckUtils]: 4: Hoare triple {233#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {231#false} is VALID [2022-02-21 03:36:32,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#false} main_~i~0#1 := 0; {231#false} is VALID [2022-02-21 03:36:32,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {231#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {231#false} is VALID [2022-02-21 03:36:32,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {231#false} assume !(0 == __VERIFIER_assert_~cond#1); {231#false} is VALID [2022-02-21 03:36:32,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {231#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {231#false} is VALID [2022-02-21 03:36:32,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {231#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {231#false} is VALID [2022-02-21 03:36:32,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:32,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:32,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {231#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {231#false} is VALID [2022-02-21 03:36:32,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {231#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {231#false} is VALID [2022-02-21 03:36:32,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {231#false} assume !(0 == __VERIFIER_assert_~cond#1); {231#false} is VALID [2022-02-21 03:36:32,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {231#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {231#false} is VALID [2022-02-21 03:36:32,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#false} main_~i~0#1 := 0; {231#false} is VALID [2022-02-21 03:36:32,544 INFO L290 TraceCheckUtils]: 4: Hoare triple {280#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {231#false} is VALID [2022-02-21 03:36:32,544 INFO L290 TraceCheckUtils]: 3: Hoare triple {284#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {280#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-21 03:36:32,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {284#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {284#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-21 03:36:32,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {230#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {284#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-21 03:36:32,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {230#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(24, 2); {230#true} is VALID [2022-02-21 03:36:32,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:32,547 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927892074] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:32,547 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:32,547 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-21 03:36:32,547 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020802321] [2022-02-21 03:36:32,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:32,549 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:32,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:32,549 INFO L85 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 2 times [2022-02-21 03:36:32,551 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:32,552 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927356037] [2022-02-21 03:36:32,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:32,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:32,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:32,571 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:32,583 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:32,743 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:32,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:36:32,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:36:32,744 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 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:32,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:32,826 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-02-21 03:36:32,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:36:32,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 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:32,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:32,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2022-02-21 03:36:32,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:36:32,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 36 transitions. [2022-02-21 03:36:32,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-02-21 03:36:32,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-02-21 03:36:32,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 36 transitions. [2022-02-21 03:36:32,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:32,844 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-02-21 03:36:32,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 36 transitions. [2022-02-21 03:36:32,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2022-02-21 03:36:32,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:32,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states and 36 transitions. Second operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 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:32,846 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states and 36 transitions. Second operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 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:32,846 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 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:32,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:32,847 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-02-21 03:36:32,847 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-02-21 03:36:32,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:32,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:32,848 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 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 33 states and 36 transitions. [2022-02-21 03:36:32,848 INFO L87 Difference]: Start difference. First operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 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 33 states and 36 transitions. [2022-02-21 03:36:32,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:32,849 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-02-21 03:36:32,849 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-02-21 03:36:32,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:32,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:32,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:32,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:32,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 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:32,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-02-21 03:36:32,851 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-02-21 03:36:32,851 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-02-21 03:36:32,851 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:36:32,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2022-02-21 03:36:32,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:36:32,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:32,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:32,852 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-02-21 03:36:32,852 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:36:32,852 INFO L791 eck$LassoCheckResult]: Stem: 328#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(24, 2); 329#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 332#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 333#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 334#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 330#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 331#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 344#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 343#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 342#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 341#L18-3 assume !(main_~i~0#1 < 100000); 335#L18-4 main_~i~0#1 := 0; 336#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 347#L13 assume !(0 == __VERIFIER_assert_~cond#1); 345#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 346#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 348#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 349#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 351#L13 assume !(0 == __VERIFIER_assert_~cond#1); 350#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 337#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 338#L22-2 [2022-02-21 03:36:32,852 INFO L793 eck$LassoCheckResult]: Loop: 338#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 340#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 326#L13 assume !(0 == __VERIFIER_assert_~cond#1); 327#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 339#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 338#L22-2 [2022-02-21 03:36:32,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:32,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1930352971, now seen corresponding path program 1 times [2022-02-21 03:36:32,853 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:32,853 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898079049] [2022-02-21 03:36:32,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:32,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:32,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {421#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(24, 2); {421#true} is VALID [2022-02-21 03:36:32,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {421#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {423#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:32,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {423#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {423#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:32,936 INFO L290 TraceCheckUtils]: 3: Hoare triple {423#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {424#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:32,936 INFO L290 TraceCheckUtils]: 4: Hoare triple {424#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {424#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:32,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {424#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {425#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:32,937 INFO L290 TraceCheckUtils]: 6: Hoare triple {425#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {425#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:32,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {425#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {426#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:32,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {426#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {426#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:32,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {426#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {427#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:32,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {427#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 100000); {422#false} is VALID [2022-02-21 03:36:32,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {422#false} main_~i~0#1 := 0; {422#false} is VALID [2022-02-21 03:36:32,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {422#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {422#false} is VALID [2022-02-21 03:36:32,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {422#false} assume !(0 == __VERIFIER_assert_~cond#1); {422#false} is VALID [2022-02-21 03:36:32,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {422#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {422#false} is VALID [2022-02-21 03:36:32,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {422#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {422#false} is VALID [2022-02-21 03:36:32,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {422#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {422#false} is VALID [2022-02-21 03:36:32,942 INFO L290 TraceCheckUtils]: 17: Hoare triple {422#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {422#false} is VALID [2022-02-21 03:36:32,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {422#false} assume !(0 == __VERIFIER_assert_~cond#1); {422#false} is VALID [2022-02-21 03:36:32,942 INFO L290 TraceCheckUtils]: 19: Hoare triple {422#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {422#false} is VALID [2022-02-21 03:36:32,943 INFO L290 TraceCheckUtils]: 20: Hoare triple {422#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {422#false} is VALID [2022-02-21 03:36:32,944 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 03:36:32,944 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:32,944 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898079049] [2022-02-21 03:36:32,945 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898079049] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:32,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456855531] [2022-02-21 03:36:32,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:32,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:32,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:32,946 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:32,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-21 03:36:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:33,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:36:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:33,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:33,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {421#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(24, 2); {421#true} is VALID [2022-02-21 03:36:33,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {421#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {434#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:33,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {434#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {434#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:33,121 INFO L290 TraceCheckUtils]: 3: Hoare triple {434#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {424#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:33,122 INFO L290 TraceCheckUtils]: 4: Hoare triple {424#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {424#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:33,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {424#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {425#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:33,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {425#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {425#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:33,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {425#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {426#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:33,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {426#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {426#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:33,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {426#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {427#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:33,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {427#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 100000); {422#false} is VALID [2022-02-21 03:36:33,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {422#false} main_~i~0#1 := 0; {422#false} is VALID [2022-02-21 03:36:33,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {422#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {422#false} is VALID [2022-02-21 03:36:33,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {422#false} assume !(0 == __VERIFIER_assert_~cond#1); {422#false} is VALID [2022-02-21 03:36:33,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {422#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {422#false} is VALID [2022-02-21 03:36:33,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {422#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {422#false} is VALID [2022-02-21 03:36:33,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {422#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {422#false} is VALID [2022-02-21 03:36:33,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {422#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {422#false} is VALID [2022-02-21 03:36:33,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {422#false} assume !(0 == __VERIFIER_assert_~cond#1); {422#false} is VALID [2022-02-21 03:36:33,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {422#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {422#false} is VALID [2022-02-21 03:36:33,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {422#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {422#false} is VALID [2022-02-21 03:36:33,125 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 03:36:33,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:33,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {422#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {422#false} is VALID [2022-02-21 03:36:33,240 INFO L290 TraceCheckUtils]: 19: Hoare triple {422#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {422#false} is VALID [2022-02-21 03:36:33,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {422#false} assume !(0 == __VERIFIER_assert_~cond#1); {422#false} is VALID [2022-02-21 03:36:33,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {422#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {422#false} is VALID [2022-02-21 03:36:33,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {422#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {422#false} is VALID [2022-02-21 03:36:33,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {422#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {422#false} is VALID [2022-02-21 03:36:33,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {422#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {422#false} is VALID [2022-02-21 03:36:33,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {422#false} assume !(0 == __VERIFIER_assert_~cond#1); {422#false} is VALID [2022-02-21 03:36:33,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {422#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {422#false} is VALID [2022-02-21 03:36:33,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {422#false} main_~i~0#1 := 0; {422#false} is VALID [2022-02-21 03:36:33,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {522#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {422#false} is VALID [2022-02-21 03:36:33,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {526#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {522#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-21 03:36:33,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {526#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {526#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-21 03:36:33,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {533#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {526#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-21 03:36:33,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {533#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {533#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-21 03:36:33,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {540#(< |ULTIMATE.start_main_~i~0#1| 99997)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {533#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-21 03:36:33,243 INFO L290 TraceCheckUtils]: 4: Hoare triple {540#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {540#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-21 03:36:33,243 INFO L290 TraceCheckUtils]: 3: Hoare triple {547#(< |ULTIMATE.start_main_~i~0#1| 99996)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {540#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-21 03:36:33,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {547#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {547#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-21 03:36:33,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {421#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {547#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-21 03:36:33,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {421#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(24, 2); {421#true} is VALID [2022-02-21 03:36:33,244 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 03:36:33,245 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456855531] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:33,245 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:33,245 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-21 03:36:33,245 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5770033] [2022-02-21 03:36:33,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:33,245 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:33,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:33,246 INFO L85 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 3 times [2022-02-21 03:36:33,246 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:33,246 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160989958] [2022-02-21 03:36:33,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:33,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:33,253 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:33,258 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:33,407 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:33,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-21 03:36:33,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:36:33,408 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. cyclomatic complexity: 4 Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 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:33,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:33,611 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2022-02-21 03:36:33,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:36:33,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 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:33,637 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:33,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 81 transitions. [2022-02-21 03:36:33,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2022-02-21 03:36:33,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 75 states and 81 transitions. [2022-02-21 03:36:33,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2022-02-21 03:36:33,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2022-02-21 03:36:33,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 81 transitions. [2022-02-21 03:36:33,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:33,642 INFO L681 BuchiCegarLoop]: Abstraction has 75 states and 81 transitions. [2022-02-21 03:36:33,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 81 transitions. [2022-02-21 03:36:33,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2022-02-21 03:36:33,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:33,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states and 81 transitions. Second operand has 53 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 52 states have internal predecessors, (55), 0 states have call successors, (0), 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,646 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states and 81 transitions. Second operand has 53 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 52 states have internal predecessors, (55), 0 states have call successors, (0), 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,646 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 53 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 52 states have internal predecessors, (55), 0 states have call successors, (0), 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,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:33,648 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2022-02-21 03:36:33,648 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2022-02-21 03:36:33,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:33,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:33,648 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 52 states have internal predecessors, (55), 0 states have call successors, (0), 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 75 states and 81 transitions. [2022-02-21 03:36:33,648 INFO L87 Difference]: Start difference. First operand has 53 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 52 states have internal predecessors, (55), 0 states have call successors, (0), 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 75 states and 81 transitions. [2022-02-21 03:36:33,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:33,650 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2022-02-21 03:36:33,650 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2022-02-21 03:36:33,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:33,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:33,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:33,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:33,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 52 states have internal predecessors, (55), 0 states have call successors, (0), 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,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2022-02-21 03:36:33,652 INFO L704 BuchiCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-02-21 03:36:33,652 INFO L587 BuchiCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-02-21 03:36:33,652 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:36:33,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 55 transitions. [2022-02-21 03:36:33,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:36:33,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:33,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:33,653 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 5, 5, 5, 5, 4, 1, 1, 1, 1] [2022-02-21 03:36:33,653 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:36:33,653 INFO L791 eck$LassoCheckResult]: Stem: 631#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(24, 2); 632#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 637#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 638#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 639#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 635#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 636#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 662#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 661#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 660#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 659#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 658#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 657#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 656#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 655#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 654#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 653#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 652#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 651#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 650#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 649#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 648#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 647#L18-3 assume !(main_~i~0#1 < 100000); 640#L18-4 main_~i~0#1 := 0; 641#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 645#L13 assume !(0 == __VERIFIER_assert_~cond#1); 683#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 682#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 666#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 667#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 633#L13 assume !(0 == __VERIFIER_assert_~cond#1); 634#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 644#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 668#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 681#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 680#L13 assume !(0 == __VERIFIER_assert_~cond#1); 679#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 678#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 677#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 676#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 675#L13 assume !(0 == __VERIFIER_assert_~cond#1); 674#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 673#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 672#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 671#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 670#L13 assume !(0 == __VERIFIER_assert_~cond#1); 669#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 642#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 643#L22-2 [2022-02-21 03:36:33,659 INFO L793 eck$LassoCheckResult]: Loop: 643#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 646#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 665#L13 assume !(0 == __VERIFIER_assert_~cond#1); 664#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 663#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 643#L22-2 [2022-02-21 03:36:33,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:33,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1653685129, now seen corresponding path program 2 times [2022-02-21 03:36:33,660 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:33,660 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488407649] [2022-02-21 03:36:33,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:33,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:33,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {837#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(24, 2); {837#true} is VALID [2022-02-21 03:36:33,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {837#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {839#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:33,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {839#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {839#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:33,824 INFO L290 TraceCheckUtils]: 3: Hoare triple {839#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {840#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:33,824 INFO L290 TraceCheckUtils]: 4: Hoare triple {840#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {840#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:33,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {840#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {841#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:33,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {841#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {841#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:33,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {841#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {842#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:33,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {842#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {842#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:33,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {842#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {843#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:33,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {843#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {843#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:33,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {843#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {844#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:33,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {844#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {844#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:33,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {844#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {845#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:33,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {845#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {845#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:33,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {845#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {846#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:33,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {846#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {846#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:33,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {846#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {847#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:33,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {847#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {847#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:33,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {847#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {848#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:33,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {848#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {848#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:33,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {848#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {849#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:33,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {849#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 100000); {838#false} is VALID [2022-02-21 03:36:33,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {838#false} main_~i~0#1 := 0; {838#false} is VALID [2022-02-21 03:36:33,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {838#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {838#false} is VALID [2022-02-21 03:36:33,832 INFO L290 TraceCheckUtils]: 25: Hoare triple {838#false} assume !(0 == __VERIFIER_assert_~cond#1); {838#false} is VALID [2022-02-21 03:36:33,833 INFO L290 TraceCheckUtils]: 26: Hoare triple {838#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {838#false} is VALID [2022-02-21 03:36:33,833 INFO L290 TraceCheckUtils]: 27: Hoare triple {838#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {838#false} is VALID [2022-02-21 03:36:33,833 INFO L290 TraceCheckUtils]: 28: Hoare triple {838#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {838#false} is VALID [2022-02-21 03:36:33,833 INFO L290 TraceCheckUtils]: 29: Hoare triple {838#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {838#false} is VALID [2022-02-21 03:36:33,833 INFO L290 TraceCheckUtils]: 30: Hoare triple {838#false} assume !(0 == __VERIFIER_assert_~cond#1); {838#false} is VALID [2022-02-21 03:36:33,833 INFO L290 TraceCheckUtils]: 31: Hoare triple {838#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {838#false} is VALID [2022-02-21 03:36:33,833 INFO L290 TraceCheckUtils]: 32: Hoare triple {838#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {838#false} is VALID [2022-02-21 03:36:33,834 INFO L290 TraceCheckUtils]: 33: Hoare triple {838#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {838#false} is VALID [2022-02-21 03:36:33,834 INFO L290 TraceCheckUtils]: 34: Hoare triple {838#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {838#false} is VALID [2022-02-21 03:36:33,834 INFO L290 TraceCheckUtils]: 35: Hoare triple {838#false} assume !(0 == __VERIFIER_assert_~cond#1); {838#false} is VALID [2022-02-21 03:36:33,834 INFO L290 TraceCheckUtils]: 36: Hoare triple {838#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {838#false} is VALID [2022-02-21 03:36:33,834 INFO L290 TraceCheckUtils]: 37: Hoare triple {838#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {838#false} is VALID [2022-02-21 03:36:33,834 INFO L290 TraceCheckUtils]: 38: Hoare triple {838#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {838#false} is VALID [2022-02-21 03:36:33,834 INFO L290 TraceCheckUtils]: 39: Hoare triple {838#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {838#false} is VALID [2022-02-21 03:36:33,835 INFO L290 TraceCheckUtils]: 40: Hoare triple {838#false} assume !(0 == __VERIFIER_assert_~cond#1); {838#false} is VALID [2022-02-21 03:36:33,835 INFO L290 TraceCheckUtils]: 41: Hoare triple {838#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {838#false} is VALID [2022-02-21 03:36:33,835 INFO L290 TraceCheckUtils]: 42: Hoare triple {838#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {838#false} is VALID [2022-02-21 03:36:33,835 INFO L290 TraceCheckUtils]: 43: Hoare triple {838#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {838#false} is VALID [2022-02-21 03:36:33,847 INFO L290 TraceCheckUtils]: 44: Hoare triple {838#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {838#false} is VALID [2022-02-21 03:36:33,847 INFO L290 TraceCheckUtils]: 45: Hoare triple {838#false} assume !(0 == __VERIFIER_assert_~cond#1); {838#false} is VALID [2022-02-21 03:36:33,847 INFO L290 TraceCheckUtils]: 46: Hoare triple {838#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {838#false} is VALID [2022-02-21 03:36:33,848 INFO L290 TraceCheckUtils]: 47: Hoare triple {838#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {838#false} is VALID [2022-02-21 03:36:33,848 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-02-21 03:36:33,848 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:33,848 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488407649] [2022-02-21 03:36:33,848 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488407649] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:33,848 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931910684] [2022-02-21 03:36:33,848 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:36:33,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:33,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:33,896 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:33,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-21 03:36:33,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:36:33,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:36:33,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:36:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:34,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:34,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {837#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(24, 2); {837#true} is VALID [2022-02-21 03:36:34,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {837#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {856#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:34,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {856#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {856#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:34,181 INFO L290 TraceCheckUtils]: 3: Hoare triple {856#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {840#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:34,182 INFO L290 TraceCheckUtils]: 4: Hoare triple {840#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {840#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:34,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {840#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {841#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:34,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {841#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {841#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:34,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {841#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {842#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:34,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {842#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {842#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:34,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {842#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {843#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:34,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {843#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {843#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:34,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {843#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {844#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:34,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {844#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {844#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:34,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {844#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {845#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:34,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {845#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {845#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:34,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {845#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {846#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:34,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {846#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {846#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:34,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {846#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {847#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:34,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {847#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {847#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:34,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {847#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {848#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:34,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {848#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {848#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:34,187 INFO L290 TraceCheckUtils]: 21: Hoare triple {848#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {849#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:34,187 INFO L290 TraceCheckUtils]: 22: Hoare triple {849#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 100000); {838#false} is VALID [2022-02-21 03:36:34,188 INFO L290 TraceCheckUtils]: 23: Hoare triple {838#false} main_~i~0#1 := 0; {838#false} is VALID [2022-02-21 03:36:34,188 INFO L290 TraceCheckUtils]: 24: Hoare triple {838#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {838#false} is VALID [2022-02-21 03:36:34,188 INFO L290 TraceCheckUtils]: 25: Hoare triple {838#false} assume !(0 == __VERIFIER_assert_~cond#1); {838#false} is VALID [2022-02-21 03:36:34,188 INFO L290 TraceCheckUtils]: 26: Hoare triple {838#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {838#false} is VALID [2022-02-21 03:36:34,188 INFO L290 TraceCheckUtils]: 27: Hoare triple {838#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {838#false} is VALID [2022-02-21 03:36:34,188 INFO L290 TraceCheckUtils]: 28: Hoare triple {838#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {838#false} is VALID [2022-02-21 03:36:34,188 INFO L290 TraceCheckUtils]: 29: Hoare triple {838#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {838#false} is VALID [2022-02-21 03:36:34,188 INFO L290 TraceCheckUtils]: 30: Hoare triple {838#false} assume !(0 == __VERIFIER_assert_~cond#1); {838#false} is VALID [2022-02-21 03:36:34,188 INFO L290 TraceCheckUtils]: 31: Hoare triple {838#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {838#false} is VALID [2022-02-21 03:36:34,188 INFO L290 TraceCheckUtils]: 32: Hoare triple {838#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {838#false} is VALID [2022-02-21 03:36:34,188 INFO L290 TraceCheckUtils]: 33: Hoare triple {838#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {838#false} is VALID [2022-02-21 03:36:34,188 INFO L290 TraceCheckUtils]: 34: Hoare triple {838#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {838#false} is VALID [2022-02-21 03:36:34,188 INFO L290 TraceCheckUtils]: 35: Hoare triple {838#false} assume !(0 == __VERIFIER_assert_~cond#1); {838#false} is VALID [2022-02-21 03:36:34,188 INFO L290 TraceCheckUtils]: 36: Hoare triple {838#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {838#false} is VALID [2022-02-21 03:36:34,189 INFO L290 TraceCheckUtils]: 37: Hoare triple {838#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {838#false} is VALID [2022-02-21 03:36:34,189 INFO L290 TraceCheckUtils]: 38: Hoare triple {838#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {838#false} is VALID [2022-02-21 03:36:34,190 INFO L290 TraceCheckUtils]: 39: Hoare triple {838#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {838#false} is VALID [2022-02-21 03:36:34,190 INFO L290 TraceCheckUtils]: 40: Hoare triple {838#false} assume !(0 == __VERIFIER_assert_~cond#1); {838#false} is VALID [2022-02-21 03:36:34,190 INFO L290 TraceCheckUtils]: 41: Hoare triple {838#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {838#false} is VALID [2022-02-21 03:36:34,190 INFO L290 TraceCheckUtils]: 42: Hoare triple {838#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {838#false} is VALID [2022-02-21 03:36:34,190 INFO L290 TraceCheckUtils]: 43: Hoare triple {838#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {838#false} is VALID [2022-02-21 03:36:34,190 INFO L290 TraceCheckUtils]: 44: Hoare triple {838#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {838#false} is VALID [2022-02-21 03:36:34,190 INFO L290 TraceCheckUtils]: 45: Hoare triple {838#false} assume !(0 == __VERIFIER_assert_~cond#1); {838#false} is VALID [2022-02-21 03:36:34,190 INFO L290 TraceCheckUtils]: 46: Hoare triple {838#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {838#false} is VALID [2022-02-21 03:36:34,190 INFO L290 TraceCheckUtils]: 47: Hoare triple {838#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {838#false} is VALID [2022-02-21 03:36:34,191 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-02-21 03:36:34,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:34,483 INFO L290 TraceCheckUtils]: 47: Hoare triple {838#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {838#false} is VALID [2022-02-21 03:36:34,484 INFO L290 TraceCheckUtils]: 46: Hoare triple {838#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {838#false} is VALID [2022-02-21 03:36:34,484 INFO L290 TraceCheckUtils]: 45: Hoare triple {838#false} assume !(0 == __VERIFIER_assert_~cond#1); {838#false} is VALID [2022-02-21 03:36:34,484 INFO L290 TraceCheckUtils]: 44: Hoare triple {838#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {838#false} is VALID [2022-02-21 03:36:34,484 INFO L290 TraceCheckUtils]: 43: Hoare triple {838#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {838#false} is VALID [2022-02-21 03:36:34,485 INFO L290 TraceCheckUtils]: 42: Hoare triple {838#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {838#false} is VALID [2022-02-21 03:36:34,485 INFO L290 TraceCheckUtils]: 41: Hoare triple {838#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {838#false} is VALID [2022-02-21 03:36:34,499 INFO L290 TraceCheckUtils]: 40: Hoare triple {838#false} assume !(0 == __VERIFIER_assert_~cond#1); {838#false} is VALID [2022-02-21 03:36:34,499 INFO L290 TraceCheckUtils]: 39: Hoare triple {838#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {838#false} is VALID [2022-02-21 03:36:34,499 INFO L290 TraceCheckUtils]: 38: Hoare triple {838#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {838#false} is VALID [2022-02-21 03:36:34,500 INFO L290 TraceCheckUtils]: 37: Hoare triple {838#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {838#false} is VALID [2022-02-21 03:36:34,500 INFO L290 TraceCheckUtils]: 36: Hoare triple {838#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {838#false} is VALID [2022-02-21 03:36:34,500 INFO L290 TraceCheckUtils]: 35: Hoare triple {838#false} assume !(0 == __VERIFIER_assert_~cond#1); {838#false} is VALID [2022-02-21 03:36:34,500 INFO L290 TraceCheckUtils]: 34: Hoare triple {838#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {838#false} is VALID [2022-02-21 03:36:34,500 INFO L290 TraceCheckUtils]: 33: Hoare triple {838#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {838#false} is VALID [2022-02-21 03:36:34,500 INFO L290 TraceCheckUtils]: 32: Hoare triple {838#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {838#false} is VALID [2022-02-21 03:36:34,500 INFO L290 TraceCheckUtils]: 31: Hoare triple {838#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {838#false} is VALID [2022-02-21 03:36:34,501 INFO L290 TraceCheckUtils]: 30: Hoare triple {838#false} assume !(0 == __VERIFIER_assert_~cond#1); {838#false} is VALID [2022-02-21 03:36:34,501 INFO L290 TraceCheckUtils]: 29: Hoare triple {838#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {838#false} is VALID [2022-02-21 03:36:34,501 INFO L290 TraceCheckUtils]: 28: Hoare triple {838#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {838#false} is VALID [2022-02-21 03:36:34,501 INFO L290 TraceCheckUtils]: 27: Hoare triple {838#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {838#false} is VALID [2022-02-21 03:36:34,501 INFO L290 TraceCheckUtils]: 26: Hoare triple {838#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {838#false} is VALID [2022-02-21 03:36:34,501 INFO L290 TraceCheckUtils]: 25: Hoare triple {838#false} assume !(0 == __VERIFIER_assert_~cond#1); {838#false} is VALID [2022-02-21 03:36:34,501 INFO L290 TraceCheckUtils]: 24: Hoare triple {838#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {838#false} is VALID [2022-02-21 03:36:34,501 INFO L290 TraceCheckUtils]: 23: Hoare triple {838#false} main_~i~0#1 := 0; {838#false} is VALID [2022-02-21 03:36:34,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {1070#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {838#false} is VALID [2022-02-21 03:36:34,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {1074#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1070#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-21 03:36:34,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {1074#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1074#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-21 03:36:34,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {1081#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1074#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-21 03:36:34,503 INFO L290 TraceCheckUtils]: 18: Hoare triple {1081#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1081#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-21 03:36:34,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {1088#(< |ULTIMATE.start_main_~i~0#1| 99997)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1081#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-21 03:36:34,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {1088#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1088#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-21 03:36:34,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {1095#(< |ULTIMATE.start_main_~i~0#1| 99996)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1088#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-21 03:36:34,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {1095#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1095#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-21 03:36:34,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {1102#(< |ULTIMATE.start_main_~i~0#1| 99995)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1095#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-21 03:36:34,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {1102#(< |ULTIMATE.start_main_~i~0#1| 99995)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1102#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-21 03:36:34,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {1109#(< |ULTIMATE.start_main_~i~0#1| 99994)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1102#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-21 03:36:34,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {1109#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1109#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-21 03:36:34,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#(< |ULTIMATE.start_main_~i~0#1| 99993)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1109#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-21 03:36:34,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#(< |ULTIMATE.start_main_~i~0#1| 99993)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1116#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-21 03:36:34,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {1123#(< |ULTIMATE.start_main_~i~0#1| 99992)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1116#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-21 03:36:34,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {1123#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1123#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-21 03:36:34,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {1130#(< |ULTIMATE.start_main_~i~0#1| 99991)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1123#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-21 03:36:34,509 INFO L290 TraceCheckUtils]: 4: Hoare triple {1130#(< |ULTIMATE.start_main_~i~0#1| 99991)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1130#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-21 03:36:34,509 INFO L290 TraceCheckUtils]: 3: Hoare triple {1137#(< |ULTIMATE.start_main_~i~0#1| 99990)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1130#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-21 03:36:34,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {1137#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1137#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-21 03:36:34,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {837#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {1137#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-21 03:36:34,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {837#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(24, 2); {837#true} is VALID [2022-02-21 03:36:34,512 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-02-21 03:36:34,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931910684] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:34,515 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:34,515 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-02-21 03:36:34,515 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48287804] [2022-02-21 03:36:34,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:34,516 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:34,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:34,516 INFO L85 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 4 times [2022-02-21 03:36:34,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:34,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546217759] [2022-02-21 03:36:34,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:34,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:34,537 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:34,542 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:34,660 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:34,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-21 03:36:34,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-21 03:36:34,662 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. cyclomatic complexity: 4 Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 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,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:35,094 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2022-02-21 03:36:35,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-21 03:36:35,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 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,139 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,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 171 transitions. [2022-02-21 03:36:35,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2022-02-21 03:36:35,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 159 states and 171 transitions. [2022-02-21 03:36:35,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2022-02-21 03:36:35,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2022-02-21 03:36:35,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 171 transitions. [2022-02-21 03:36:35,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:35,150 INFO L681 BuchiCegarLoop]: Abstraction has 159 states and 171 transitions. [2022-02-21 03:36:35,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 171 transitions. [2022-02-21 03:36:35,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 107. [2022-02-21 03:36:35,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:35,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states and 171 transitions. Second operand has 107 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 106 states have internal predecessors, (109), 0 states have call successors, (0), 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,155 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states and 171 transitions. Second operand has 107 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 106 states have internal predecessors, (109), 0 states have call successors, (0), 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,155 INFO L87 Difference]: Start difference. First operand 159 states and 171 transitions. Second operand has 107 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 106 states have internal predecessors, (109), 0 states have call successors, (0), 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,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:35,158 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2022-02-21 03:36:35,158 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 171 transitions. [2022-02-21 03:36:35,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:35,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:35,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 106 states have internal predecessors, (109), 0 states have call successors, (0), 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 159 states and 171 transitions. [2022-02-21 03:36:35,159 INFO L87 Difference]: Start difference. First operand has 107 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 106 states have internal predecessors, (109), 0 states have call successors, (0), 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 159 states and 171 transitions. [2022-02-21 03:36:35,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:35,163 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2022-02-21 03:36:35,163 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 171 transitions. [2022-02-21 03:36:35,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:35,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:35,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:35,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:35,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 106 states have internal predecessors, (109), 0 states have call successors, (0), 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,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2022-02-21 03:36:35,165 INFO L704 BuchiCegarLoop]: Abstraction has 107 states and 109 transitions. [2022-02-21 03:36:35,165 INFO L587 BuchiCegarLoop]: Abstraction has 107 states and 109 transitions. [2022-02-21 03:36:35,165 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:36:35,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 109 transitions. [2022-02-21 03:36:35,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:36:35,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:35,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:35,168 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [22, 22, 11, 11, 11, 11, 10, 1, 1, 1, 1] [2022-02-21 03:36:35,168 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:36:35,168 INFO L791 eck$LassoCheckResult]: Stem: 1307#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(24, 2); 1308#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 1311#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1312#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1313#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1309#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1310#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1359#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1358#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1357#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1356#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1355#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1354#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1353#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1352#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1351#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1350#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1349#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1348#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1347#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1346#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1345#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1344#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1343#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1342#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1341#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1340#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1339#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1338#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1337#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1336#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1335#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1334#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1333#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1332#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1331#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1330#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1329#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1328#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1327#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1326#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1325#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1324#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1323#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1322#L18-3 assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1321#L18-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1320#L18-3 assume !(main_~i~0#1 < 100000); 1314#L18-4 main_~i~0#1 := 0; 1315#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1363#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1411#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1410#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1364#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1365#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1362#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1360#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1361#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1366#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1409#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1408#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1407#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1406#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1405#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1404#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1403#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1402#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1401#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1400#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1399#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1398#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1397#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1396#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1395#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1394#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1393#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1392#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1391#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1390#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1389#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1388#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1387#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1386#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1385#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1384#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1383#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1382#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1381#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1380#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1379#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1378#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1377#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1376#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1375#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1374#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1373#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1372#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1371#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1370#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1369#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1368#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1367#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1316#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1317#L22-2 [2022-02-21 03:36:35,169 INFO L793 eck$LassoCheckResult]: Loop: 1317#L22-2 main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; 1319#L22-3 assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1305#L13 assume !(0 == __VERIFIER_assert_~cond#1); 1306#L13-3 assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; 1318#L25 assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); 1317#L22-2 [2022-02-21 03:36:35,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:35,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1459869857, now seen corresponding path program 3 times [2022-02-21 03:36:35,169 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:35,169 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385860634] [2022-02-21 03:36:35,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:35,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:35,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {1733#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(24, 2); {1733#true} is VALID [2022-02-21 03:36:35,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {1733#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {1735#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:35,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {1735#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1735#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:36:35,607 INFO L290 TraceCheckUtils]: 3: Hoare triple {1735#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1736#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:35,610 INFO L290 TraceCheckUtils]: 4: Hoare triple {1736#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1736#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:36:35,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {1736#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1737#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:35,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {1737#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1737#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:36:35,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {1737#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1738#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:35,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {1738#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1738#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-21 03:36:35,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {1738#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1739#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:35,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {1739#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1739#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-21 03:36:35,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {1739#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1740#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:35,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {1740#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1740#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-21 03:36:35,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {1740#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1741#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:35,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {1741#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1741#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-21 03:36:35,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {1741#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1742#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:35,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {1742#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1742#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-21 03:36:35,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {1742#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1743#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:35,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {1743#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1743#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-21 03:36:35,621 INFO L290 TraceCheckUtils]: 19: Hoare triple {1743#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1744#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:35,621 INFO L290 TraceCheckUtils]: 20: Hoare triple {1744#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1744#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:36:35,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {1744#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1745#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:35,622 INFO L290 TraceCheckUtils]: 22: Hoare triple {1745#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1745#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:36:35,623 INFO L290 TraceCheckUtils]: 23: Hoare triple {1745#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1746#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:36:35,623 INFO L290 TraceCheckUtils]: 24: Hoare triple {1746#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1746#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-21 03:36:35,623 INFO L290 TraceCheckUtils]: 25: Hoare triple {1746#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1747#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:35,624 INFO L290 TraceCheckUtils]: 26: Hoare triple {1747#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1747#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-21 03:36:35,624 INFO L290 TraceCheckUtils]: 27: Hoare triple {1747#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1748#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:36:35,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {1748#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1748#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-21 03:36:35,626 INFO L290 TraceCheckUtils]: 29: Hoare triple {1748#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1749#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:36:35,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {1749#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1749#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-21 03:36:35,626 INFO L290 TraceCheckUtils]: 31: Hoare triple {1749#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1750#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:36:35,627 INFO L290 TraceCheckUtils]: 32: Hoare triple {1750#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1750#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-21 03:36:35,627 INFO L290 TraceCheckUtils]: 33: Hoare triple {1750#(<= |ULTIMATE.start_main_~i~0#1| 15)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1751#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:36:35,627 INFO L290 TraceCheckUtils]: 34: Hoare triple {1751#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1751#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-21 03:36:35,628 INFO L290 TraceCheckUtils]: 35: Hoare triple {1751#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1752#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:36:35,628 INFO L290 TraceCheckUtils]: 36: Hoare triple {1752#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1752#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-21 03:36:35,629 INFO L290 TraceCheckUtils]: 37: Hoare triple {1752#(<= |ULTIMATE.start_main_~i~0#1| 17)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1753#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:36:35,630 INFO L290 TraceCheckUtils]: 38: Hoare triple {1753#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1753#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-21 03:36:35,630 INFO L290 TraceCheckUtils]: 39: Hoare triple {1753#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1754#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:36:35,630 INFO L290 TraceCheckUtils]: 40: Hoare triple {1754#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1754#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-21 03:36:35,631 INFO L290 TraceCheckUtils]: 41: Hoare triple {1754#(<= |ULTIMATE.start_main_~i~0#1| 19)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1755#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:36:35,631 INFO L290 TraceCheckUtils]: 42: Hoare triple {1755#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1755#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-21 03:36:35,632 INFO L290 TraceCheckUtils]: 43: Hoare triple {1755#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1756#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:36:35,632 INFO L290 TraceCheckUtils]: 44: Hoare triple {1756#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1756#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-21 03:36:35,633 INFO L290 TraceCheckUtils]: 45: Hoare triple {1756#(<= |ULTIMATE.start_main_~i~0#1| 21)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1757#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-21 03:36:35,633 INFO L290 TraceCheckUtils]: 46: Hoare triple {1757#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~i~0#1 < 100000); {1734#false} is VALID [2022-02-21 03:36:35,633 INFO L290 TraceCheckUtils]: 47: Hoare triple {1734#false} main_~i~0#1 := 0; {1734#false} is VALID [2022-02-21 03:36:35,634 INFO L290 TraceCheckUtils]: 48: Hoare triple {1734#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1734#false} is VALID [2022-02-21 03:36:35,634 INFO L290 TraceCheckUtils]: 49: Hoare triple {1734#false} assume !(0 == __VERIFIER_assert_~cond#1); {1734#false} is VALID [2022-02-21 03:36:35,634 INFO L290 TraceCheckUtils]: 50: Hoare triple {1734#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {1734#false} is VALID [2022-02-21 03:36:35,634 INFO L290 TraceCheckUtils]: 51: Hoare triple {1734#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {1734#false} is VALID [2022-02-21 03:36:35,634 INFO L290 TraceCheckUtils]: 52: Hoare triple {1734#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1734#false} is VALID [2022-02-21 03:36:35,635 INFO L290 TraceCheckUtils]: 53: Hoare triple {1734#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1734#false} is VALID [2022-02-21 03:36:35,635 INFO L290 TraceCheckUtils]: 54: Hoare triple {1734#false} assume !(0 == __VERIFIER_assert_~cond#1); {1734#false} is VALID [2022-02-21 03:36:35,635 INFO L290 TraceCheckUtils]: 55: Hoare triple {1734#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {1734#false} is VALID [2022-02-21 03:36:35,635 INFO L290 TraceCheckUtils]: 56: Hoare triple {1734#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {1734#false} is VALID [2022-02-21 03:36:35,635 INFO L290 TraceCheckUtils]: 57: Hoare triple {1734#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1734#false} is VALID [2022-02-21 03:36:35,635 INFO L290 TraceCheckUtils]: 58: Hoare triple {1734#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1734#false} is VALID [2022-02-21 03:36:35,635 INFO L290 TraceCheckUtils]: 59: Hoare triple {1734#false} assume !(0 == __VERIFIER_assert_~cond#1); {1734#false} is VALID [2022-02-21 03:36:35,635 INFO L290 TraceCheckUtils]: 60: Hoare triple {1734#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {1734#false} is VALID [2022-02-21 03:36:35,636 INFO L290 TraceCheckUtils]: 61: Hoare triple {1734#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {1734#false} is VALID [2022-02-21 03:36:35,636 INFO L290 TraceCheckUtils]: 62: Hoare triple {1734#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1734#false} is VALID [2022-02-21 03:36:35,636 INFO L290 TraceCheckUtils]: 63: Hoare triple {1734#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1734#false} is VALID [2022-02-21 03:36:35,636 INFO L290 TraceCheckUtils]: 64: Hoare triple {1734#false} assume !(0 == __VERIFIER_assert_~cond#1); {1734#false} is VALID [2022-02-21 03:36:35,636 INFO L290 TraceCheckUtils]: 65: Hoare triple {1734#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {1734#false} is VALID [2022-02-21 03:36:35,636 INFO L290 TraceCheckUtils]: 66: Hoare triple {1734#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {1734#false} is VALID [2022-02-21 03:36:35,636 INFO L290 TraceCheckUtils]: 67: Hoare triple {1734#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1734#false} is VALID [2022-02-21 03:36:35,636 INFO L290 TraceCheckUtils]: 68: Hoare triple {1734#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1734#false} is VALID [2022-02-21 03:36:35,637 INFO L290 TraceCheckUtils]: 69: Hoare triple {1734#false} assume !(0 == __VERIFIER_assert_~cond#1); {1734#false} is VALID [2022-02-21 03:36:35,637 INFO L290 TraceCheckUtils]: 70: Hoare triple {1734#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {1734#false} is VALID [2022-02-21 03:36:35,637 INFO L290 TraceCheckUtils]: 71: Hoare triple {1734#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {1734#false} is VALID [2022-02-21 03:36:35,637 INFO L290 TraceCheckUtils]: 72: Hoare triple {1734#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1734#false} is VALID [2022-02-21 03:36:35,637 INFO L290 TraceCheckUtils]: 73: Hoare triple {1734#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1734#false} is VALID [2022-02-21 03:36:35,637 INFO L290 TraceCheckUtils]: 74: Hoare triple {1734#false} assume !(0 == __VERIFIER_assert_~cond#1); {1734#false} is VALID [2022-02-21 03:36:35,637 INFO L290 TraceCheckUtils]: 75: Hoare triple {1734#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {1734#false} is VALID [2022-02-21 03:36:35,637 INFO L290 TraceCheckUtils]: 76: Hoare triple {1734#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {1734#false} is VALID [2022-02-21 03:36:35,638 INFO L290 TraceCheckUtils]: 77: Hoare triple {1734#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1734#false} is VALID [2022-02-21 03:36:35,638 INFO L290 TraceCheckUtils]: 78: Hoare triple {1734#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1734#false} is VALID [2022-02-21 03:36:35,638 INFO L290 TraceCheckUtils]: 79: Hoare triple {1734#false} assume !(0 == __VERIFIER_assert_~cond#1); {1734#false} is VALID [2022-02-21 03:36:35,638 INFO L290 TraceCheckUtils]: 80: Hoare triple {1734#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {1734#false} is VALID [2022-02-21 03:36:35,638 INFO L290 TraceCheckUtils]: 81: Hoare triple {1734#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {1734#false} is VALID [2022-02-21 03:36:35,638 INFO L290 TraceCheckUtils]: 82: Hoare triple {1734#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1734#false} is VALID [2022-02-21 03:36:35,638 INFO L290 TraceCheckUtils]: 83: Hoare triple {1734#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1734#false} is VALID [2022-02-21 03:36:35,638 INFO L290 TraceCheckUtils]: 84: Hoare triple {1734#false} assume !(0 == __VERIFIER_assert_~cond#1); {1734#false} is VALID [2022-02-21 03:36:35,639 INFO L290 TraceCheckUtils]: 85: Hoare triple {1734#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {1734#false} is VALID [2022-02-21 03:36:35,639 INFO L290 TraceCheckUtils]: 86: Hoare triple {1734#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {1734#false} is VALID [2022-02-21 03:36:35,639 INFO L290 TraceCheckUtils]: 87: Hoare triple {1734#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1734#false} is VALID [2022-02-21 03:36:35,639 INFO L290 TraceCheckUtils]: 88: Hoare triple {1734#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1734#false} is VALID [2022-02-21 03:36:35,639 INFO L290 TraceCheckUtils]: 89: Hoare triple {1734#false} assume !(0 == __VERIFIER_assert_~cond#1); {1734#false} is VALID [2022-02-21 03:36:35,639 INFO L290 TraceCheckUtils]: 90: Hoare triple {1734#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {1734#false} is VALID [2022-02-21 03:36:35,639 INFO L290 TraceCheckUtils]: 91: Hoare triple {1734#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {1734#false} is VALID [2022-02-21 03:36:35,639 INFO L290 TraceCheckUtils]: 92: Hoare triple {1734#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1734#false} is VALID [2022-02-21 03:36:35,639 INFO L290 TraceCheckUtils]: 93: Hoare triple {1734#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1734#false} is VALID [2022-02-21 03:36:35,640 INFO L290 TraceCheckUtils]: 94: Hoare triple {1734#false} assume !(0 == __VERIFIER_assert_~cond#1); {1734#false} is VALID [2022-02-21 03:36:35,640 INFO L290 TraceCheckUtils]: 95: Hoare triple {1734#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {1734#false} is VALID [2022-02-21 03:36:35,640 INFO L290 TraceCheckUtils]: 96: Hoare triple {1734#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {1734#false} is VALID [2022-02-21 03:36:35,640 INFO L290 TraceCheckUtils]: 97: Hoare triple {1734#false} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1734#false} is VALID [2022-02-21 03:36:35,640 INFO L290 TraceCheckUtils]: 98: Hoare triple {1734#false} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1734#false} is VALID [2022-02-21 03:36:35,640 INFO L290 TraceCheckUtils]: 99: Hoare triple {1734#false} assume !(0 == __VERIFIER_assert_~cond#1); {1734#false} is VALID [2022-02-21 03:36:35,640 INFO L290 TraceCheckUtils]: 100: Hoare triple {1734#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {1734#false} is VALID [2022-02-21 03:36:35,640 INFO L290 TraceCheckUtils]: 101: Hoare triple {1734#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {1734#false} is VALID [2022-02-21 03:36:35,641 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2022-02-21 03:36:35,641 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:35,641 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385860634] [2022-02-21 03:36:35,641 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385860634] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:35,641 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060721523] [2022-02-21 03:36:35,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:36:35,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:35,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:35,648 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:35,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-02-21 03:36:35,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-21 03:36:35,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:36:35,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:36:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:35,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:35,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-02-21 03:36:36,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-02-21 03:36:36,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {1733#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(24, 2); {1733#true} is VALID [2022-02-21 03:36:36,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {1733#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post1#1, main_#t~mem3#1, main_#t~post2#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; {1733#true} is VALID [2022-02-21 03:36:36,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1733#true} is VALID [2022-02-21 03:36:36,160 INFO L290 TraceCheckUtils]: 3: Hoare triple {1733#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1733#true} is VALID [2022-02-21 03:36:36,160 INFO L290 TraceCheckUtils]: 4: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1733#true} is VALID [2022-02-21 03:36:36,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {1733#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1733#true} is VALID [2022-02-21 03:36:36,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1733#true} is VALID [2022-02-21 03:36:36,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {1733#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1733#true} is VALID [2022-02-21 03:36:36,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1733#true} is VALID [2022-02-21 03:36:36,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {1733#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1733#true} is VALID [2022-02-21 03:36:36,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1733#true} is VALID [2022-02-21 03:36:36,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {1733#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1733#true} is VALID [2022-02-21 03:36:36,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1733#true} is VALID [2022-02-21 03:36:36,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {1733#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1733#true} is VALID [2022-02-21 03:36:36,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1733#true} is VALID [2022-02-21 03:36:36,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {1733#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1733#true} is VALID [2022-02-21 03:36:36,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1733#true} is VALID [2022-02-21 03:36:36,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {1733#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1733#true} is VALID [2022-02-21 03:36:36,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1733#true} is VALID [2022-02-21 03:36:36,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {1733#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1733#true} is VALID [2022-02-21 03:36:36,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1733#true} is VALID [2022-02-21 03:36:36,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {1733#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1733#true} is VALID [2022-02-21 03:36:36,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1733#true} is VALID [2022-02-21 03:36:36,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {1733#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1733#true} is VALID [2022-02-21 03:36:36,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1733#true} is VALID [2022-02-21 03:36:36,161 INFO L290 TraceCheckUtils]: 25: Hoare triple {1733#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1733#true} is VALID [2022-02-21 03:36:36,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1733#true} is VALID [2022-02-21 03:36:36,161 INFO L290 TraceCheckUtils]: 27: Hoare triple {1733#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1733#true} is VALID [2022-02-21 03:36:36,161 INFO L290 TraceCheckUtils]: 28: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1733#true} is VALID [2022-02-21 03:36:36,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {1733#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1733#true} is VALID [2022-02-21 03:36:36,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1733#true} is VALID [2022-02-21 03:36:36,161 INFO L290 TraceCheckUtils]: 31: Hoare triple {1733#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1733#true} is VALID [2022-02-21 03:36:36,161 INFO L290 TraceCheckUtils]: 32: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1733#true} is VALID [2022-02-21 03:36:36,161 INFO L290 TraceCheckUtils]: 33: Hoare triple {1733#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1733#true} is VALID [2022-02-21 03:36:36,162 INFO L290 TraceCheckUtils]: 34: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1733#true} is VALID [2022-02-21 03:36:36,162 INFO L290 TraceCheckUtils]: 35: Hoare triple {1733#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1733#true} is VALID [2022-02-21 03:36:36,162 INFO L290 TraceCheckUtils]: 36: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1733#true} is VALID [2022-02-21 03:36:36,162 INFO L290 TraceCheckUtils]: 37: Hoare triple {1733#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1733#true} is VALID [2022-02-21 03:36:36,162 INFO L290 TraceCheckUtils]: 38: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1733#true} is VALID [2022-02-21 03:36:36,162 INFO L290 TraceCheckUtils]: 39: Hoare triple {1733#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1733#true} is VALID [2022-02-21 03:36:36,162 INFO L290 TraceCheckUtils]: 40: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1733#true} is VALID [2022-02-21 03:36:36,162 INFO L290 TraceCheckUtils]: 41: Hoare triple {1733#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1733#true} is VALID [2022-02-21 03:36:36,162 INFO L290 TraceCheckUtils]: 42: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1733#true} is VALID [2022-02-21 03:36:36,162 INFO L290 TraceCheckUtils]: 43: Hoare triple {1733#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1733#true} is VALID [2022-02-21 03:36:36,162 INFO L290 TraceCheckUtils]: 44: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call write~int(10, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); {1733#true} is VALID [2022-02-21 03:36:36,162 INFO L290 TraceCheckUtils]: 45: Hoare triple {1733#true} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1733#true} is VALID [2022-02-21 03:36:36,162 INFO L290 TraceCheckUtils]: 46: Hoare triple {1733#true} assume !(main_~i~0#1 < 100000); {1733#true} is VALID [2022-02-21 03:36:36,162 INFO L290 TraceCheckUtils]: 47: Hoare triple {1733#true} main_~i~0#1 := 0; {1733#true} is VALID [2022-02-21 03:36:36,162 INFO L290 TraceCheckUtils]: 48: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1733#true} is VALID [2022-02-21 03:36:36,162 INFO L290 TraceCheckUtils]: 49: Hoare triple {1733#true} assume !(0 == __VERIFIER_assert_~cond#1); {1733#true} is VALID [2022-02-21 03:36:36,162 INFO L290 TraceCheckUtils]: 50: Hoare triple {1733#true} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {1733#true} is VALID [2022-02-21 03:36:36,162 INFO L290 TraceCheckUtils]: 51: Hoare triple {1733#true} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {1733#true} is VALID [2022-02-21 03:36:36,162 INFO L290 TraceCheckUtils]: 52: Hoare triple {1733#true} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1733#true} is VALID [2022-02-21 03:36:36,163 INFO L290 TraceCheckUtils]: 53: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1733#true} is VALID [2022-02-21 03:36:36,163 INFO L290 TraceCheckUtils]: 54: Hoare triple {1733#true} assume !(0 == __VERIFIER_assert_~cond#1); {1733#true} is VALID [2022-02-21 03:36:36,163 INFO L290 TraceCheckUtils]: 55: Hoare triple {1733#true} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {1733#true} is VALID [2022-02-21 03:36:36,163 INFO L290 TraceCheckUtils]: 56: Hoare triple {1733#true} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {1733#true} is VALID [2022-02-21 03:36:36,163 INFO L290 TraceCheckUtils]: 57: Hoare triple {1733#true} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1733#true} is VALID [2022-02-21 03:36:36,163 INFO L290 TraceCheckUtils]: 58: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1733#true} is VALID [2022-02-21 03:36:36,163 INFO L290 TraceCheckUtils]: 59: Hoare triple {1733#true} assume !(0 == __VERIFIER_assert_~cond#1); {1733#true} is VALID [2022-02-21 03:36:36,163 INFO L290 TraceCheckUtils]: 60: Hoare triple {1733#true} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {1733#true} is VALID [2022-02-21 03:36:36,163 INFO L290 TraceCheckUtils]: 61: Hoare triple {1733#true} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {1733#true} is VALID [2022-02-21 03:36:36,163 INFO L290 TraceCheckUtils]: 62: Hoare triple {1733#true} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1733#true} is VALID [2022-02-21 03:36:36,163 INFO L290 TraceCheckUtils]: 63: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1733#true} is VALID [2022-02-21 03:36:36,163 INFO L290 TraceCheckUtils]: 64: Hoare triple {1733#true} assume !(0 == __VERIFIER_assert_~cond#1); {1733#true} is VALID [2022-02-21 03:36:36,163 INFO L290 TraceCheckUtils]: 65: Hoare triple {1733#true} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {1733#true} is VALID [2022-02-21 03:36:36,163 INFO L290 TraceCheckUtils]: 66: Hoare triple {1733#true} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {1733#true} is VALID [2022-02-21 03:36:36,163 INFO L290 TraceCheckUtils]: 67: Hoare triple {1733#true} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1733#true} is VALID [2022-02-21 03:36:36,163 INFO L290 TraceCheckUtils]: 68: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1733#true} is VALID [2022-02-21 03:36:36,163 INFO L290 TraceCheckUtils]: 69: Hoare triple {1733#true} assume !(0 == __VERIFIER_assert_~cond#1); {1733#true} is VALID [2022-02-21 03:36:36,163 INFO L290 TraceCheckUtils]: 70: Hoare triple {1733#true} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {1733#true} is VALID [2022-02-21 03:36:36,164 INFO L290 TraceCheckUtils]: 71: Hoare triple {1733#true} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {1733#true} is VALID [2022-02-21 03:36:36,164 INFO L290 TraceCheckUtils]: 72: Hoare triple {1733#true} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1733#true} is VALID [2022-02-21 03:36:36,164 INFO L290 TraceCheckUtils]: 73: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1733#true} is VALID [2022-02-21 03:36:36,164 INFO L290 TraceCheckUtils]: 74: Hoare triple {1733#true} assume !(0 == __VERIFIER_assert_~cond#1); {1733#true} is VALID [2022-02-21 03:36:36,164 INFO L290 TraceCheckUtils]: 75: Hoare triple {1733#true} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {1733#true} is VALID [2022-02-21 03:36:36,164 INFO L290 TraceCheckUtils]: 76: Hoare triple {1733#true} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {1733#true} is VALID [2022-02-21 03:36:36,164 INFO L290 TraceCheckUtils]: 77: Hoare triple {1733#true} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1733#true} is VALID [2022-02-21 03:36:36,164 INFO L290 TraceCheckUtils]: 78: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1733#true} is VALID [2022-02-21 03:36:36,164 INFO L290 TraceCheckUtils]: 79: Hoare triple {1733#true} assume !(0 == __VERIFIER_assert_~cond#1); {1733#true} is VALID [2022-02-21 03:36:36,164 INFO L290 TraceCheckUtils]: 80: Hoare triple {1733#true} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {1733#true} is VALID [2022-02-21 03:36:36,164 INFO L290 TraceCheckUtils]: 81: Hoare triple {1733#true} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {1733#true} is VALID [2022-02-21 03:36:36,164 INFO L290 TraceCheckUtils]: 82: Hoare triple {1733#true} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1733#true} is VALID [2022-02-21 03:36:36,164 INFO L290 TraceCheckUtils]: 83: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1733#true} is VALID [2022-02-21 03:36:36,164 INFO L290 TraceCheckUtils]: 84: Hoare triple {1733#true} assume !(0 == __VERIFIER_assert_~cond#1); {1733#true} is VALID [2022-02-21 03:36:36,164 INFO L290 TraceCheckUtils]: 85: Hoare triple {1733#true} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {1733#true} is VALID [2022-02-21 03:36:36,164 INFO L290 TraceCheckUtils]: 86: Hoare triple {1733#true} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {1733#true} is VALID [2022-02-21 03:36:36,164 INFO L290 TraceCheckUtils]: 87: Hoare triple {1733#true} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1733#true} is VALID [2022-02-21 03:36:36,164 INFO L290 TraceCheckUtils]: 88: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1733#true} is VALID [2022-02-21 03:36:36,164 INFO L290 TraceCheckUtils]: 89: Hoare triple {1733#true} assume !(0 == __VERIFIER_assert_~cond#1); {1733#true} is VALID [2022-02-21 03:36:36,165 INFO L290 TraceCheckUtils]: 90: Hoare triple {1733#true} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {1733#true} is VALID [2022-02-21 03:36:36,165 INFO L290 TraceCheckUtils]: 91: Hoare triple {1733#true} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {1733#true} is VALID [2022-02-21 03:36:36,165 INFO L290 TraceCheckUtils]: 92: Hoare triple {1733#true} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {1733#true} is VALID [2022-02-21 03:36:36,165 INFO L290 TraceCheckUtils]: 93: Hoare triple {1733#true} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1733#true} is VALID [2022-02-21 03:36:36,165 INFO L290 TraceCheckUtils]: 94: Hoare triple {1733#true} assume !(0 == __VERIFIER_assert_~cond#1); {1733#true} is VALID [2022-02-21 03:36:36,165 INFO L290 TraceCheckUtils]: 95: Hoare triple {1733#true} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {1733#true} is VALID [2022-02-21 03:36:36,173 INFO L290 TraceCheckUtils]: 96: Hoare triple {1733#true} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {2049#(<= 20 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4)))} is VALID [2022-02-21 03:36:36,173 INFO L290 TraceCheckUtils]: 97: Hoare triple {2049#(<= 20 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 4)))} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {2053#(<= 20 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))} is VALID [2022-02-21 03:36:36,174 INFO L290 TraceCheckUtils]: 98: Hoare triple {2053#(<= 20 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) (+ |ULTIMATE.start_main_~#a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))} assume !!(main_~i~0#1 < 100000);call main_#t~mem3#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem3#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2057#(= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0)} is VALID [2022-02-21 03:36:36,174 INFO L290 TraceCheckUtils]: 99: Hoare triple {2057#(= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0)} assume !(0 == __VERIFIER_assert_~cond#1); {1734#false} is VALID [2022-02-21 03:36:36,174 INFO L290 TraceCheckUtils]: 100: Hoare triple {1734#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem3#1; {1734#false} is VALID [2022-02-21 03:36:36,175 INFO L290 TraceCheckUtils]: 101: Hoare triple {1734#false} assume 15000 != 1 + main_~i~0#1;call write~int(20, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * (1 + main_~i~0#1), 4); {1734#false} is VALID [2022-02-21 03:36:36,175 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 700 trivial. 0 not checked. [2022-02-21 03:36:36,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:36:36,175 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060721523] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:36:36,175 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:36:36,175 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [25] total 28 [2022-02-21 03:36:36,175 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495000246] [2022-02-21 03:36:36,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:36:36,176 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:36,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:36,176 INFO L85 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 5 times [2022-02-21 03:36:36,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:36,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934821981] [2022-02-21 03:36:36,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:36,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:36,183 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:36,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:36,187 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:36,313 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:36,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:36:36,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=450, Unknown=0, NotChecked=0, Total=756 [2022-02-21 03:36:36,314 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. cyclomatic complexity: 4 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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:36,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:36,385 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-02-21 03:36:36,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:36:36,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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:36,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:36,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 55 transitions. [2022-02-21 03:36:36,400 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:36,400 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 0 states and 0 transitions. [2022-02-21 03:36:36,400 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:36:36,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:36:36,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:36:36,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:36,401 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:36:36,401 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:36:36,401 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:36:36,401 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:36:36,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:36:36,401 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:36,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:36,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:36:36 BoogieIcfgContainer [2022-02-21 03:36:36,406 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:36:36,407 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:36:36,407 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:36:36,407 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:36:36,407 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:36:30" (3/4) ... [2022-02-21 03:36:36,409 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:36:36,409 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:36:36,410 INFO L158 Benchmark]: Toolchain (without parser) took 6860.32ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 64.3MB in the beginning and 110.8MB in the end (delta: -46.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:36:36,410 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:36:36,411 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.00ms. Allocated memory is still 100.7MB. Free memory was 64.1MB in the beginning and 76.2MB in the end (delta: -12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:36:36,411 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.69ms. Allocated memory is still 100.7MB. Free memory was 76.2MB in the beginning and 74.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:36:36,411 INFO L158 Benchmark]: Boogie Preprocessor took 17.03ms. Allocated memory is still 100.7MB. Free memory was 74.5MB in the beginning and 73.4MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 03:36:36,411 INFO L158 Benchmark]: RCFGBuilder took 226.24ms. Allocated memory is still 100.7MB. Free memory was 73.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:36:36,411 INFO L158 Benchmark]: BuchiAutomizer took 6336.55ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 62.9MB in the beginning and 110.8MB in the end (delta: -47.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:36:36,411 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 146.8MB. Free memory is still 110.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:36:36,412 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.00ms. Allocated memory is still 100.7MB. Free memory was 64.1MB in the beginning and 76.2MB in the end (delta: -12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.69ms. Allocated memory is still 100.7MB. Free memory was 76.2MB in the beginning and 74.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.03ms. Allocated memory is still 100.7MB. Free memory was 74.5MB in the beginning and 73.4MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 226.24ms. Allocated memory is still 100.7MB. Free memory was 73.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 6336.55ms. Allocated memory was 100.7MB in the beginning and 146.8MB in the end (delta: 46.1MB). Free memory was 62.9MB in the beginning and 110.8MB in the end (delta: -47.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 146.8MB. Free memory is still 110.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (5 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 199999 * unknown-#length-unknown[a] + -8 * i and consists of 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.2s and 7 iterations. TraceHistogramMax:22. Analysis of lassos took 4.8s. Construction of modules took 0.3s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 83 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 107 states and ocurred in iteration 5. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 361 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 361 mSDsluCounter, 138 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 99 mSDsCounter, 149 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 260 IncrementalHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 149 mSolverCounterUnsat, 39 mSDtfsCounter, 260 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU5 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital121 mio100 ax100 hnf100 lsp95 ukn80 mio100 lsp41 div100 bol100 ite100 ukn100 eq157 hnf93 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 45ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:36:36,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:36,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-02-21 03:36:36,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-02-21 03:36:37,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-02-21 03:36:37,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE