./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-industry-pattern/array_monotonic.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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_monotonic.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 5e947ce3cb6be538c3110154d89a790a98803ec545aa8464d99fb543118ea442 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 14:34:39,600 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 14:34:39,601 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 14:34:39,640 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 14:34:39,640 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 14:34:39,641 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 14:34:39,643 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 14:34:39,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 14:34:39,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 14:34:39,655 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 14:34:39,656 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 14:34:39,658 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 14:34:39,658 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 14:34:39,660 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 14:34:39,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 14:34:39,663 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 14:34:39,664 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 14:34:39,664 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 14:34:39,666 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 14:34:39,667 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 14:34:39,668 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 14:34:39,670 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 14:34:39,672 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 14:34:39,672 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 14:34:39,674 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 14:34:39,679 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 14:34:39,680 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 14:34:39,680 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 14:34:39,681 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 14:34:39,681 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 14:34:39,682 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 14:34:39,682 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 14:34:39,683 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 14:34:39,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 14:34:39,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 14:34:39,685 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 14:34:39,685 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 14:34:39,686 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 14:34:39,686 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 14:34:39,687 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 14:34:39,687 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 14:34:39,689 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 14:34:39,689 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-23 14:34:39,710 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 14:34:39,710 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 14:34:39,710 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 14:34:39,710 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 14:34:39,711 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 14:34:39,711 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 14:34:39,711 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 14:34:39,712 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-23 14:34:39,712 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-23 14:34:39,712 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-23 14:34:39,712 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-23 14:34:39,712 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-23 14:34:39,712 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-23 14:34:39,712 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 14:34:39,712 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 14:34:39,713 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 14:34:39,713 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 14:34:39,713 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 14:34:39,713 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 14:34:39,713 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-23 14:34:39,713 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-23 14:34:39,713 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-23 14:34:39,714 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 14:34:39,714 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 14:34:39,714 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-23 14:34:39,714 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 14:34:39,714 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-23 14:34:39,714 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 14:34:39,714 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 14:34:39,715 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 14:34:39,715 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 14:34:39,715 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-23 14:34:39,715 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 -> 5e947ce3cb6be538c3110154d89a790a98803ec545aa8464d99fb543118ea442 [2022-07-23 14:34:39,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 14:34:39,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 14:34:39,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 14:34:39,941 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 14:34:39,941 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 14:34:39,942 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2022-07-23 14:34:40,011 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e5ad8a8e/f1510d3e2f6d468089a95e74ac80ea60/FLAG7377106cf [2022-07-23 14:34:40,420 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 14:34:40,421 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_monotonic.i [2022-07-23 14:34:40,428 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e5ad8a8e/f1510d3e2f6d468089a95e74ac80ea60/FLAG7377106cf [2022-07-23 14:34:40,440 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e5ad8a8e/f1510d3e2f6d468089a95e74ac80ea60 [2022-07-23 14:34:40,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 14:34:40,443 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 14:34:40,448 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 14:34:40,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 14:34:40,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 14:34:40,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:34:40" (1/1) ... [2022-07-23 14:34:40,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@756586c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:40, skipping insertion in model container [2022-07-23 14:34:40,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:34:40" (1/1) ... [2022-07-23 14:34:40,460 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 14:34:40,472 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 14:34:40,597 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_monotonic.i[808,821] [2022-07-23 14:34:40,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 14:34:40,611 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 14:34:40,622 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_monotonic.i[808,821] [2022-07-23 14:34:40,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 14:34:40,636 INFO L208 MainTranslator]: Completed translation [2022-07-23 14:34:40,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:40 WrapperNode [2022-07-23 14:34:40,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 14:34:40,638 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 14:34:40,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 14:34:40,638 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 14:34:40,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:40" (1/1) ... [2022-07-23 14:34:40,652 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:40" (1/1) ... [2022-07-23 14:34:40,672 INFO L137 Inliner]: procedures = 16, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2022-07-23 14:34:40,672 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 14:34:40,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 14:34:40,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 14:34:40,673 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 14:34:40,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:40" (1/1) ... [2022-07-23 14:34:40,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:40" (1/1) ... [2022-07-23 14:34:40,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:40" (1/1) ... [2022-07-23 14:34:40,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:40" (1/1) ... [2022-07-23 14:34:40,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:40" (1/1) ... [2022-07-23 14:34:40,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:40" (1/1) ... [2022-07-23 14:34:40,687 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:40" (1/1) ... [2022-07-23 14:34:40,689 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 14:34:40,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 14:34:40,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 14:34:40,690 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 14:34:40,690 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:40" (1/1) ... [2022-07-23 14:34:40,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:40,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:40,720 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-07-23 14:34:40,725 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-07-23 14:34:40,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 14:34:40,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 14:34:40,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 14:34:40,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 14:34:40,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 14:34:40,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 14:34:40,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 14:34:40,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 14:34:40,797 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 14:34:40,798 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 14:34:40,885 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 14:34:40,891 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 14:34:40,891 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-23 14:34:40,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:34:40 BoogieIcfgContainer [2022-07-23 14:34:40,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 14:34:40,894 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-23 14:34:40,894 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-23 14:34:40,896 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-23 14:34:40,897 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:34:40,897 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.07 02:34:40" (1/3) ... [2022-07-23 14:34:40,898 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@275b34b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 02:34:40, skipping insertion in model container [2022-07-23 14:34:40,898 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:34:40,899 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:40" (2/3) ... [2022-07-23 14:34:40,899 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@275b34b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 02:34:40, skipping insertion in model container [2022-07-23 14:34:40,899 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:34:40,899 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:34:40" (3/3) ... [2022-07-23 14:34:40,900 INFO L354 chiAutomizerObserver]: Analyzing ICFG array_monotonic.i [2022-07-23 14:34:40,944 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-23 14:34:40,944 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-23 14:34:40,944 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-23 14:34:40,945 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-23 14:34:40,945 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-23 14:34:40,945 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-23 14:34:40,945 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-23 14:34:40,945 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-23 14:34:40,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:34:40,962 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-23 14:34:40,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:34:40,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:34:40,968 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 14:34:40,968 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:34:40,968 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-23 14:34:40,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:34:40,970 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-23 14:34:40,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:34:40,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:34:40,971 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 14:34:40,971 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:34:40,976 INFO L752 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 12#L20-3true [2022-07-23 14:34:40,976 INFO L754 eck$LassoCheckResult]: Loop: 12#L20-3true assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 15#L23true assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 13#L20-2true main_~i~0#1 := 2 + main_~i~0#1; 12#L20-3true [2022-07-23 14:34:40,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:40,981 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-23 14:34:40,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:40,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040027724] [2022-07-23 14:34:40,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:40,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:41,115 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:34:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:41,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:34:41,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:41,162 INFO L85 PathProgramCache]: Analyzing trace with hash 39821, now seen corresponding path program 1 times [2022-07-23 14:34:41,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:41,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581312679] [2022-07-23 14:34:41,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:41,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:41,196 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:34:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:41,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:34:41,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:41,225 INFO L85 PathProgramCache]: Analyzing trace with hash 28698763, now seen corresponding path program 1 times [2022-07-23 14:34:41,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:41,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528851174] [2022-07-23 14:34:41,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:41,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:41,283 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:34:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:41,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:34:41,788 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:34:41,788 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:34:41,789 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:34:41,789 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:34:41,789 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:34:41,789 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:41,789 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:34:41,789 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:34:41,790 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_monotonic.i_Iteration1_Lasso [2022-07-23 14:34:41,790 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:34:41,790 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:34:41,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:34:41,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:34:41,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:34:41,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:34:41,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:34:41,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:34:42,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:34:42,334 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:34:42,337 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:34:42,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:42,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:42,341 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-07-23 14:34:42,342 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-07-23 14:34:42,343 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-07-23 14:34:42,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:42,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:34:42,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:42,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:42,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:42,355 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:34:42,355 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:34:42,358 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:42,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-23 14:34:42,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:42,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:42,376 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-07-23 14:34:42,377 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-07-23 14:34:42,378 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-07-23 14:34:42,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:42,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:42,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:42,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:42,386 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:34:42,386 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:34:42,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:42,421 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-07-23 14:34:42,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:42,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:42,422 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-07-23 14:34:42,423 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-07-23 14:34:42,428 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-07-23 14:34:42,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:42,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:42,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:42,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:42,440 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:34:42,440 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:34:42,455 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:42,472 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-07-23 14:34:42,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:42,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:42,474 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-07-23 14:34:42,475 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-07-23 14:34:42,476 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-07-23 14:34:42,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:42,482 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:34:42,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:42,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:42,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:42,482 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:34:42,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:34:42,484 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:42,499 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-07-23 14:34:42,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:42,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:42,501 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-07-23 14:34:42,502 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-07-23 14:34:42,503 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-07-23 14:34:42,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:42,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:34:42,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:42,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:42,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:42,509 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:34:42,509 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:34:42,535 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:42,551 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-07-23 14:34:42,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:42,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:42,553 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-07-23 14:34:42,553 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-07-23 14:34:42,555 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-07-23 14:34:42,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:42,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:42,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:42,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:42,563 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:34:42,563 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:34:42,579 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:42,594 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-07-23 14:34:42,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:42,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:42,596 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-07-23 14:34:42,596 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-07-23 14:34:42,599 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-07-23 14:34:42,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:42,606 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:34:42,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:42,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:42,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:42,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:34:42,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:34:42,620 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:42,637 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-07-23 14:34:42,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:42,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:42,639 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-07-23 14:34:42,639 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-07-23 14:34:42,641 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-07-23 14:34:42,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:42,648 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:34:42,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:42,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:42,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:42,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:34:42,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:34:42,657 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:42,674 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-07-23 14:34:42,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:42,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:42,675 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-07-23 14:34:42,678 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-07-23 14:34:42,678 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-07-23 14:34:42,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:42,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:42,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:42,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:42,688 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:34:42,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:34:42,696 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:42,712 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-07-23 14:34:42,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:42,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:42,713 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-07-23 14:34:42,714 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-07-23 14:34:42,716 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-07-23 14:34:42,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:42,723 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:42,723 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:42,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:42,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:34:42,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:34:42,736 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:42,752 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-07-23 14:34:42,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:42,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:42,753 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:34:42,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-23 14:34:42,756 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-07-23 14:34:42,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:42,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:42,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:42,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:42,771 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:34:42,771 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:34:42,803 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 14:34:42,843 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2022-07-23 14:34:42,843 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 16 variables to zero. [2022-07-23 14:34:42,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:42,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:42,848 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:34:42,892 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 14:34:42,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-23 14:34:42,927 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-23 14:34:42,927 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 14:34:42,928 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#b~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 25000*v_rep(select #length ULTIMATE.start_main_~#b~0#1.base)_1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-07-23 14:34:42,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-23 14:34:43,051 INFO L293 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-07-23 14:34:43,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-07-23 14:34:43,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:43,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 14:34:43,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:34:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:43,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 14:34:43,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:34:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:43,198 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-23 14:34:43,200 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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-07-23 14:34:43,249 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 37 states and 55 transitions. Complement of second has 10 states. [2022-07-23 14:34:43,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-23 14:34:43,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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-07-23 14:34:43,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-07-23 14:34:43,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 2 letters. Loop has 3 letters. [2022-07-23 14:34:43,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:34:43,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 5 letters. Loop has 3 letters. [2022-07-23 14:34:43,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:34:43,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 26 transitions. Stem has 2 letters. Loop has 6 letters. [2022-07-23 14:34:43,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:34:43,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 55 transitions. [2022-07-23 14:34:43,261 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-23 14:34:43,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 20 states and 28 transitions. [2022-07-23 14:34:43,265 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-07-23 14:34:43,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-23 14:34:43,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2022-07-23 14:34:43,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:34:43,266 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 28 transitions. [2022-07-23 14:34:43,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2022-07-23 14:34:43,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-07-23 14:34:43,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 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-07-23 14:34:43,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2022-07-23 14:34:43,292 INFO L392 hiAutomatonCegarLoop]: Abstraction has 18 states and 26 transitions. [2022-07-23 14:34:43,293 INFO L374 stractBuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2022-07-23 14:34:43,293 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-23 14:34:43,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2022-07-23 14:34:43,294 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-07-23 14:34:43,294 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:34:43,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:34:43,294 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-23 14:34:43,294 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:34:43,295 INFO L752 eck$LassoCheckResult]: Stem: 147#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 148#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 160#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 153#L23 [2022-07-23 14:34:43,295 INFO L754 eck$LassoCheckResult]: Loop: 153#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 156#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 151#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 153#L23 [2022-07-23 14:34:43,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:43,296 INFO L85 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times [2022-07-23 14:34:43,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:43,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174647732] [2022-07-23 14:34:43,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:43,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:43,310 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:34:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:43,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:34:43,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:43,321 INFO L85 PathProgramCache]: Analyzing trace with hash 44743, now seen corresponding path program 1 times [2022-07-23 14:34:43,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:43,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192504193] [2022-07-23 14:34:43,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:43,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:43,327 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:34:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:43,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:34:43,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:43,332 INFO L85 PathProgramCache]: Analyzing trace with hash 889663585, now seen corresponding path program 1 times [2022-07-23 14:34:43,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:43,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535871273] [2022-07-23 14:34:43,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:43,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:43,345 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:34:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:43,356 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:34:43,626 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:34:43,627 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:34:43,627 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:34:43,627 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:34:43,627 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:34:43,627 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:43,627 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:34:43,627 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:34:43,627 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_monotonic.i_Iteration2_Lasso [2022-07-23 14:34:43,627 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:34:43,627 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:34:43,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:34:43,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:34:43,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:34:43,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:34:43,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:34:43,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:34:43,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:34:44,049 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:34:44,049 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:34:44,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:44,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:44,050 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:34:44,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-23 14:34:44,053 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-07-23 14:34:44,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:44,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:44,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:44,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:44,064 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:34:44,064 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:34:44,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:44,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-23 14:34:44,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:44,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:44,104 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:34:44,110 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-07-23 14:34:44,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:44,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:34:44,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:44,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:44,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:44,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:34:44,121 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:34:44,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-23 14:34:44,139 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:44,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-23 14:34:44,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:44,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:44,173 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:34:44,182 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-07-23 14:34:44,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:44,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:44,190 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 14:34:44,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:44,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-23 14:34:44,203 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-07-23 14:34:44,203 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-23 14:34:44,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:44,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-23 14:34:44,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:44,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:44,254 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:34:44,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-23 14:34:44,256 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-07-23 14:34:44,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:44,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:44,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:44,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:44,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:34:44,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:34:44,280 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:44,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-23 14:34:44,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:44,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:44,307 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:34:44,314 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-07-23 14:34:44,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:44,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:44,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:44,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:44,325 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:34:44,325 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:34:44,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-23 14:34:44,343 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:44,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-23 14:34:44,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:44,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:44,370 INFO L229 MonitoredProcess]: Starting monitored process 19 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-07-23 14:34:44,373 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-07-23 14:34:44,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:44,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:44,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:44,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:44,382 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:34:44,383 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:34:44,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-23 14:34:44,392 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:44,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-23 14:34:44,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:44,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:44,420 INFO L229 MonitoredProcess]: Starting monitored process 20 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-07-23 14:34:44,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-23 14:34:44,423 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-07-23 14:34:44,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:44,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:44,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:44,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:44,433 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:34:44,433 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:34:44,451 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:44,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-23 14:34:44,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:44,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:44,478 INFO L229 MonitoredProcess]: Starting monitored process 21 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-07-23 14:34:44,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-23 14:34:44,482 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-07-23 14:34:44,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:44,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:44,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:44,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:44,491 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:34:44,491 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:34:44,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:44,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-23 14:34:44,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:44,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:44,531 INFO L229 MonitoredProcess]: Starting monitored process 22 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-07-23 14:34:44,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-23 14:34:44,582 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-07-23 14:34:44,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:44,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:44,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:44,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:44,594 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:34:44,594 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:34:44,603 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 14:34:44,616 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2022-07-23 14:34:44,616 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-07-23 14:34:44,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:44,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:44,617 INFO L229 MonitoredProcess]: Starting monitored process 23 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-07-23 14:34:44,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-23 14:34:44,619 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 14:34:44,640 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-23 14:34:44,640 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 14:34:44,641 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_2, ULTIMATE.start_main_~i~0#1) = 49999*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_2 - 2*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-07-23 14:34:44,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-23 14:34:44,681 INFO L293 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2022-07-23 14:34:44,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:44,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 14:34:44,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:34:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:44,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 14:34:44,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:34:44,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:44,739 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-07-23 14:34:44,739 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:34:44,765 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 41 states and 54 transitions. Complement of second has 8 states. [2022-07-23 14:34:44,765 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-07-23 14:34:44,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:34:44,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-07-23 14:34:44,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 3 letters. Loop has 3 letters. [2022-07-23 14:34:44,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:34:44,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 6 letters. Loop has 3 letters. [2022-07-23 14:34:44,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:34:44,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 3 letters. Loop has 6 letters. [2022-07-23 14:34:44,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:34:44,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 54 transitions. [2022-07-23 14:34:44,769 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2022-07-23 14:34:44,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 29 states and 39 transitions. [2022-07-23 14:34:44,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-07-23 14:34:44,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-07-23 14:34:44,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 39 transitions. [2022-07-23 14:34:44,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:34:44,770 INFO L369 hiAutomatonCegarLoop]: Abstraction has 29 states and 39 transitions. [2022-07-23 14:34:44,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 39 transitions. [2022-07-23 14:34:44,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-07-23 14:34:44,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 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-07-23 14:34:44,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2022-07-23 14:34:44,773 INFO L392 hiAutomatonCegarLoop]: Abstraction has 27 states and 37 transitions. [2022-07-23 14:34:44,773 INFO L374 stractBuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2022-07-23 14:34:44,773 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-23 14:34:44,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 37 transitions. [2022-07-23 14:34:44,773 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2022-07-23 14:34:44,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:34:44,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:34:44,774 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-23 14:34:44,774 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:34:44,774 INFO L752 eck$LassoCheckResult]: Stem: 282#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 283#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 295#L20-3 assume !(main_~i~0#1 < 100000); 296#L20-4 main_~i~0#1 := 0; 304#L26-3 [2022-07-23 14:34:44,774 INFO L754 eck$LassoCheckResult]: Loop: 304#L26-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); 301#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 302#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 304#L26-3 [2022-07-23 14:34:44,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:44,775 INFO L85 PathProgramCache]: Analyzing trace with hash 925712, now seen corresponding path program 1 times [2022-07-23 14:34:44,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:44,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307120849] [2022-07-23 14:34:44,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:44,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:44,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:44,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:34:44,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307120849] [2022-07-23 14:34:44,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307120849] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:34:44,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:34:44,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 14:34:44,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16545822] [2022-07-23 14:34:44,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:34:44,806 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:34:44,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:44,807 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 1 times [2022-07-23 14:34:44,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:44,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847784523] [2022-07-23 14:34:44,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:44,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:44,811 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:34:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:44,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:34:44,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:34:44,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 14:34:44,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 14:34:44,846 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. cyclomatic complexity: 14 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-07-23 14:34:44,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:34:44,864 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-07-23 14:34:44,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 14:34:44,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 44 transitions. [2022-07-23 14:34:44,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-23 14:34:44,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 42 transitions. [2022-07-23 14:34:44,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-07-23 14:34:44,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-07-23 14:34:44,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 42 transitions. [2022-07-23 14:34:44,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:34:44,867 INFO L369 hiAutomatonCegarLoop]: Abstraction has 31 states and 42 transitions. [2022-07-23 14:34:44,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 42 transitions. [2022-07-23 14:34:44,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2022-07-23 14:34:44,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 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-07-23 14:34:44,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2022-07-23 14:34:44,869 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-07-23 14:34:44,869 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-07-23 14:34:44,869 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-23 14:34:44,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2022-07-23 14:34:44,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-23 14:34:44,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:34:44,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:34:44,870 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:34:44,870 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:34:44,870 INFO L752 eck$LassoCheckResult]: Stem: 346#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 347#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 350#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 352#L23 assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 355#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 356#L20-3 assume !(main_~i~0#1 < 100000); 361#L20-4 main_~i~0#1 := 0; 349#L26-3 [2022-07-23 14:34:44,871 INFO L754 eck$LassoCheckResult]: Loop: 349#L26-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); 359#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 348#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 349#L26-3 [2022-07-23 14:34:44,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:44,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1809707736, now seen corresponding path program 1 times [2022-07-23 14:34:44,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:44,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785430407] [2022-07-23 14:34:44,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:44,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:44,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:44,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:34:44,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785430407] [2022-07-23 14:34:44,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785430407] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:34:44,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746409106] [2022-07-23 14:34:44,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:44,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:34:44,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:44,896 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:34:44,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-23 14:34:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:44,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 14:34:44,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:34:44,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:44,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:34:44,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:44,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746409106] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:34:44,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:34:44,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-23 14:34:44,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130332843] [2022-07-23 14:34:44,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:34:44,973 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:34:44,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:44,973 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 2 times [2022-07-23 14:34:44,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:44,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937944021] [2022-07-23 14:34:44,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:44,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:44,980 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:34:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:44,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:34:45,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:34:45,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 14:34:45,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-23 14:34:45,023 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 10 Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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-07-23 14:34:45,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:34:45,088 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2022-07-23 14:34:45,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 14:34:45,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 89 transitions. [2022-07-23 14:34:45,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-23 14:34:45,093 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 62 states and 78 transitions. [2022-07-23 14:34:45,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2022-07-23 14:34:45,093 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2022-07-23 14:34:45,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 78 transitions. [2022-07-23 14:34:45,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:34:45,093 INFO L369 hiAutomatonCegarLoop]: Abstraction has 62 states and 78 transitions. [2022-07-23 14:34:45,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 78 transitions. [2022-07-23 14:34:45,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 40. [2022-07-23 14:34:45,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.3) internal successors, (52), 39 states have internal predecessors, (52), 0 states have call successors, (0), 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-07-23 14:34:45,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2022-07-23 14:34:45,097 INFO L392 hiAutomatonCegarLoop]: Abstraction has 40 states and 52 transitions. [2022-07-23 14:34:45,097 INFO L374 stractBuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2022-07-23 14:34:45,097 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-23 14:34:45,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 52 transitions. [2022-07-23 14:34:45,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-23 14:34:45,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:34:45,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:34:45,098 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1, 1, 1, 1] [2022-07-23 14:34:45,099 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:34:45,099 INFO L752 eck$LassoCheckResult]: Stem: 478#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 479#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 484#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 485#L23 assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 517#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 515#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 513#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 510#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 508#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 506#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 500#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 502#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 501#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 489#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 490#L20-3 assume !(main_~i~0#1 < 100000); 497#L20-4 main_~i~0#1 := 0; 483#L26-3 [2022-07-23 14:34:45,099 INFO L754 eck$LassoCheckResult]: Loop: 483#L26-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); 493#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 482#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 483#L26-3 [2022-07-23 14:34:45,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:45,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1239058546, now seen corresponding path program 1 times [2022-07-23 14:34:45,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:45,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403539174] [2022-07-23 14:34:45,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:45,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:45,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-23 14:34:45,148 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:45,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:34:45,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403539174] [2022-07-23 14:34:45,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403539174] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:34:45,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854995821] [2022-07-23 14:34:45,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:45,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:34:45,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:45,151 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:34:45,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-23 14:34:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:45,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 14:34:45,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:34:45,235 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:45,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:34:45,295 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:45,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854995821] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:34:45,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:34:45,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-23 14:34:45,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918415531] [2022-07-23 14:34:45,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:34:45,296 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:34:45,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:45,297 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 3 times [2022-07-23 14:34:45,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:45,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582425980] [2022-07-23 14:34:45,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:45,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:45,301 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:34:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:45,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:34:45,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:34:45,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 14:34:45,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-23 14:34:45,339 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. cyclomatic complexity: 15 Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 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-07-23 14:34:45,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:34:45,456 INFO L93 Difference]: Finished difference Result 158 states and 204 transitions. [2022-07-23 14:34:45,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 14:34:45,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 204 transitions. [2022-07-23 14:34:45,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-23 14:34:45,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 146 states and 180 transitions. [2022-07-23 14:34:45,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2022-07-23 14:34:45,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2022-07-23 14:34:45,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 180 transitions. [2022-07-23 14:34:45,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:34:45,474 INFO L369 hiAutomatonCegarLoop]: Abstraction has 146 states and 180 transitions. [2022-07-23 14:34:45,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states and 180 transitions. [2022-07-23 14:34:45,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 94. [2022-07-23 14:34:45,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 93 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:34:45,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 118 transitions. [2022-07-23 14:34:45,484 INFO L392 hiAutomatonCegarLoop]: Abstraction has 94 states and 118 transitions. [2022-07-23 14:34:45,485 INFO L374 stractBuchiCegarLoop]: Abstraction has 94 states and 118 transitions. [2022-07-23 14:34:45,485 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-23 14:34:45,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 118 transitions. [2022-07-23 14:34:45,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-23 14:34:45,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:34:45,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:34:45,487 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 9, 1, 1, 1, 1, 1] [2022-07-23 14:34:45,487 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:34:45,488 INFO L752 eck$LassoCheckResult]: Stem: 784#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 785#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 788#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 789#L23 assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 867#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 875#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 874#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 797#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 873#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 870#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 869#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 868#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 862#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 859#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 856#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 849#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 847#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 844#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 832#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 830#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 828#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 826#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 822#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 819#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 815#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 813#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 810#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 808#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 803#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 805#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 804#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 793#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 794#L20-3 assume !(main_~i~0#1 < 100000); 798#L20-4 main_~i~0#1 := 0; 787#L26-3 [2022-07-23 14:34:45,488 INFO L754 eck$LassoCheckResult]: Loop: 787#L26-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); 796#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 786#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 787#L26-3 [2022-07-23 14:34:45,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:45,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1906777394, now seen corresponding path program 2 times [2022-07-23 14:34:45,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:45,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660799403] [2022-07-23 14:34:45,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:45,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:45,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:34:45,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660799403] [2022-07-23 14:34:45,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660799403] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:34:45,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146392710] [2022-07-23 14:34:45,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 14:34:45,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:34:45,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:45,635 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:34:45,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-07-23 14:34:45,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 14:34:45,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 14:34:45,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 14:34:45,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:34:45,749 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:45,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:34:45,952 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:45,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146392710] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:34:45,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:34:45,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-07-23 14:34:45,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389965108] [2022-07-23 14:34:45,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:34:45,953 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:34:45,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:45,953 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 4 times [2022-07-23 14:34:45,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:45,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801815022] [2022-07-23 14:34:45,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:45,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:45,957 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:34:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:45,960 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:34:45,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:34:45,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-23 14:34:45,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-07-23 14:34:45,997 INFO L87 Difference]: Start difference. First operand 94 states and 118 transitions. cyclomatic complexity: 27 Second operand has 25 states, 25 states have (on average 2.8) internal successors, (70), 25 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:34:46,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:34:46,218 INFO L93 Difference]: Finished difference Result 338 states and 432 transitions. [2022-07-23 14:34:46,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-23 14:34:46,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 432 transitions. [2022-07-23 14:34:46,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-23 14:34:46,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 314 states and 384 transitions. [2022-07-23 14:34:46,229 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2022-07-23 14:34:46,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2022-07-23 14:34:46,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 314 states and 384 transitions. [2022-07-23 14:34:46,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:34:46,230 INFO L369 hiAutomatonCegarLoop]: Abstraction has 314 states and 384 transitions. [2022-07-23 14:34:46,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states and 384 transitions. [2022-07-23 14:34:46,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 202. [2022-07-23 14:34:46,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 202 states have (on average 1.2376237623762376) internal successors, (250), 201 states have internal predecessors, (250), 0 states have call successors, (0), 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-07-23 14:34:46,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 250 transitions. [2022-07-23 14:34:46,249 INFO L392 hiAutomatonCegarLoop]: Abstraction has 202 states and 250 transitions. [2022-07-23 14:34:46,249 INFO L374 stractBuchiCegarLoop]: Abstraction has 202 states and 250 transitions. [2022-07-23 14:34:46,249 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-23 14:34:46,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 202 states and 250 transitions. [2022-07-23 14:34:46,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-23 14:34:46,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:34:46,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:34:46,252 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 21, 1, 1, 1, 1, 1] [2022-07-23 14:34:46,252 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:34:46,252 INFO L752 eck$LassoCheckResult]: Stem: 1440#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 1441#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 1446#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1447#L23 assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 1453#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1454#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1639#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1636#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1634#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1632#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1631#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1630#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1621#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1618#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1616#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1614#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1613#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1612#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1603#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1600#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1598#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1595#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1593#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1590#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1588#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1586#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1585#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1576#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1573#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1571#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1569#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1568#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1567#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1558#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1555#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1553#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1551#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1550#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1549#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1540#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1537#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1535#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1533#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1532#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1531#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1522#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1519#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1517#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1515#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1514#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1513#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1504#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1501#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1499#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1497#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1496#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1495#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1484#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1482#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1480#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1478#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1474#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1472#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1470#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1463#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1467#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 1462#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 1451#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 1452#L20-3 assume !(main_~i~0#1 < 100000); 1458#L20-4 main_~i~0#1 := 0; 1445#L26-3 [2022-07-23 14:34:46,253 INFO L754 eck$LassoCheckResult]: Loop: 1445#L26-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); 1455#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 1444#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 1445#L26-3 [2022-07-23 14:34:46,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:46,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1957770930, now seen corresponding path program 3 times [2022-07-23 14:34:46,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:46,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218201922] [2022-07-23 14:34:46,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:46,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:46,609 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:46,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:34:46,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218201922] [2022-07-23 14:34:46,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218201922] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:34:46,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145998466] [2022-07-23 14:34:46,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 14:34:46,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:34:46,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:46,615 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:34:46,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-07-23 14:34:47,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2022-07-23 14:34:47,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 14:34:47,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-23 14:34:47,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:34:47,611 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:47,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:34:48,314 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:48,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145998466] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:34:48,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:34:48,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-07-23 14:34:48,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542198199] [2022-07-23 14:34:48,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:34:48,316 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:34:48,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:48,316 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 5 times [2022-07-23 14:34:48,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:48,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934514611] [2022-07-23 14:34:48,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:48,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:48,322 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:34:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:48,325 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:34:48,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:34:48,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-23 14:34:48,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-07-23 14:34:48,355 INFO L87 Difference]: Start difference. First operand 202 states and 250 transitions. cyclomatic complexity: 51 Second operand has 49 states, 49 states have (on average 2.8979591836734695) internal successors, (142), 49 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:34:48,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:34:48,947 INFO L93 Difference]: Finished difference Result 698 states and 888 transitions. [2022-07-23 14:34:48,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-23 14:34:48,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 698 states and 888 transitions. [2022-07-23 14:34:48,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-23 14:34:48,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 698 states to 650 states and 792 transitions. [2022-07-23 14:34:48,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 283 [2022-07-23 14:34:48,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 283 [2022-07-23 14:34:48,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 650 states and 792 transitions. [2022-07-23 14:34:48,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:34:48,956 INFO L369 hiAutomatonCegarLoop]: Abstraction has 650 states and 792 transitions. [2022-07-23 14:34:48,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states and 792 transitions. [2022-07-23 14:34:48,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 418. [2022-07-23 14:34:48,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 418 states have (on average 1.229665071770335) internal successors, (514), 417 states have internal predecessors, (514), 0 states have call successors, (0), 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-07-23 14:34:48,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 514 transitions. [2022-07-23 14:34:48,966 INFO L392 hiAutomatonCegarLoop]: Abstraction has 418 states and 514 transitions. [2022-07-23 14:34:48,966 INFO L374 stractBuchiCegarLoop]: Abstraction has 418 states and 514 transitions. [2022-07-23 14:34:48,966 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-23 14:34:48,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 418 states and 514 transitions. [2022-07-23 14:34:48,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-23 14:34:48,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:34:48,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:34:48,972 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 44, 2, 1, 1, 1, 1] [2022-07-23 14:34:48,972 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:34:48,972 INFO L752 eck$LassoCheckResult]: Stem: 2806#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 2807#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 2812#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2813#L23 assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 2824#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3222#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3220#L23 assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 3218#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3216#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3214#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3210#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3208#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3206#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3205#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3204#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3195#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3192#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3190#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3188#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3187#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3186#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3177#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3174#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3172#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3170#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3169#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3168#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3157#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3155#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3153#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3151#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3147#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3145#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3143#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3142#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3141#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3132#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3129#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3127#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3125#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3124#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3123#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3114#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3111#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3109#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3107#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3106#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3105#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3096#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3093#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3091#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3089#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3088#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3087#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3078#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3075#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3073#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3071#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3070#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3069#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3060#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3057#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3055#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3053#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3052#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3051#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3042#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3039#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3037#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3035#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3034#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3033#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3024#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3021#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3019#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3017#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3016#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3015#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 3006#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 3003#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 3001#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2999#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2998#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2997#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2988#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2985#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2983#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2981#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2980#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2979#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2968#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2966#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2964#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2962#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2958#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2956#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2954#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2953#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2952#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2941#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2939#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2937#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2935#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2931#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2929#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2927#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2926#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2925#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2916#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2913#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2911#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2909#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2908#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2907#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2898#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2895#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2893#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2891#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2890#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2889#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2880#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2877#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2875#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2873#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2872#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2871#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2862#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2859#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2857#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2855#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2854#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2853#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2844#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2841#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2839#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2837#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2830#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2834#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 2829#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 2817#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 2818#L20-3 assume !(main_~i~0#1 < 100000); 2825#L20-4 main_~i~0#1 := 0; 2811#L26-3 [2022-07-23 14:34:48,972 INFO L754 eck$LassoCheckResult]: Loop: 2811#L26-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); 2821#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 2810#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 2811#L26-3 [2022-07-23 14:34:48,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:48,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1136763760, now seen corresponding path program 4 times [2022-07-23 14:34:48,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:48,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133411790] [2022-07-23 14:34:48,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:48,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:50,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:50,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:34:50,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133411790] [2022-07-23 14:34:50,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133411790] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:34:50,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633783506] [2022-07-23 14:34:50,023 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 14:34:50,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:34:50,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:50,028 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:34:50,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-23 14:34:50,186 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 14:34:50,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 14:34:50,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-23 14:34:50,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:34:50,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:50,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:34:52,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:52,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633783506] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:34:52,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:34:52,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2022-07-23 14:34:52,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84797122] [2022-07-23 14:34:52,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:34:52,853 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:34:52,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:52,853 INFO L85 PathProgramCache]: Analyzing trace with hash 59038, now seen corresponding path program 6 times [2022-07-23 14:34:52,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:52,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854915751] [2022-07-23 14:34:52,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:52,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:52,858 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:34:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:52,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:34:52,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:34:52,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-07-23 14:34:52,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-07-23 14:34:52,897 INFO L87 Difference]: Start difference. First operand 418 states and 514 transitions. cyclomatic complexity: 99 Second operand has 97 states, 97 states have (on average 2.948453608247423) internal successors, (286), 97 states have internal predecessors, (286), 0 states have call successors, (0), 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-07-23 14:34:55,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:34:55,225 INFO L93 Difference]: Finished difference Result 1418 states and 1800 transitions. [2022-07-23 14:34:55,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-07-23 14:34:55,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1418 states and 1800 transitions. [2022-07-23 14:34:55,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-23 14:34:55,260 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1418 states to 1322 states and 1608 transitions. [2022-07-23 14:34:55,261 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 571 [2022-07-23 14:34:55,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 571 [2022-07-23 14:34:55,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1322 states and 1608 transitions. [2022-07-23 14:34:55,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:34:55,262 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1322 states and 1608 transitions. [2022-07-23 14:34:55,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states and 1608 transitions. [2022-07-23 14:34:55,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 850. [2022-07-23 14:34:55,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 850 states have (on average 1.2258823529411764) internal successors, (1042), 849 states have internal predecessors, (1042), 0 states have call successors, (0), 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-07-23 14:34:55,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1042 transitions. [2022-07-23 14:34:55,277 INFO L392 hiAutomatonCegarLoop]: Abstraction has 850 states and 1042 transitions. [2022-07-23 14:34:55,277 INFO L374 stractBuchiCegarLoop]: Abstraction has 850 states and 1042 transitions. [2022-07-23 14:34:55,277 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-23 14:34:55,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 850 states and 1042 transitions. [2022-07-23 14:34:55,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-23 14:34:55,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:34:55,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:34:55,295 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 92, 2, 1, 1, 1, 1] [2022-07-23 14:34:55,296 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 14:34:55,298 INFO L752 eck$LassoCheckResult]: Stem: 5588#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); 5589#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~mem2#1, main_#t~mem3#1, main_#t~mem4#1, main_~i~0#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset;havoc main_~i~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(400000);main_~i~0#1 := 0; 5594#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5595#L23 assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 5606#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6436#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6434#L23 assume 10 == main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(20, main_~#b~0#1.base, main_~#b~0#1.offset + 4 * main_~i~0#1, 4); 6432#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6430#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6428#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6424#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6422#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6420#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6419#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6418#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6409#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6406#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6404#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6402#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6401#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6400#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6391#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6388#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6386#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6384#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6383#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6382#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6373#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6370#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6368#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6366#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6365#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6364#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6353#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6351#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6349#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6347#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6343#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6341#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6339#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6338#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6337#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6328#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6325#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6323#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6321#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6320#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6319#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6310#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6307#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6305#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6303#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6302#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6301#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6292#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6289#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6287#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6285#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6284#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6283#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6274#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6271#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6269#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6267#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6266#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6265#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6256#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6253#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6251#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6249#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6248#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6247#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6238#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6235#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6233#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6231#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6230#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6229#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6220#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6217#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6215#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6212#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6210#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6207#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6205#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6203#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6202#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6193#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6190#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6188#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6186#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6185#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6184#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6175#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6172#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6170#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6168#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6167#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6166#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6157#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6154#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6152#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6150#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6149#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6148#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6139#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6136#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6134#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6132#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6131#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6130#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6121#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6118#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6116#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6114#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6113#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6112#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6103#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6100#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6098#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6096#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6095#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6094#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6085#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6082#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6080#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6078#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6077#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6076#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6065#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6063#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6061#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6059#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6055#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6053#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6051#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6050#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6049#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6040#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6037#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6035#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6033#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6032#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6031#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6022#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6019#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6017#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6015#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6014#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 6013#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 6004#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 6001#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5999#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5997#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5996#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5995#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5984#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5982#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5980#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5978#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5974#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5972#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5970#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5969#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5968#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5957#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5955#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5953#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5951#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5947#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5945#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5943#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5942#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5941#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5932#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5929#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5927#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5925#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5924#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5923#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5914#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5911#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5909#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5907#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5906#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5905#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5896#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5893#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5891#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5889#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5888#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5887#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5878#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5875#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5873#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5871#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5870#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5869#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5860#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5857#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5855#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5853#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5852#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5851#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5840#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5838#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5836#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5834#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5830#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5828#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5826#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5825#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5824#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5813#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5811#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5809#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5807#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5803#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5801#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5799#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5798#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5797#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5788#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5785#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5783#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5781#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5780#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5779#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5770#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5767#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5765#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5763#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5762#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5761#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5752#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5749#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5747#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5745#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5744#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5743#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5734#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5731#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5729#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5727#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5726#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5725#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5716#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5713#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5711#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5709#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5708#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5707#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5696#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5694#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5692#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5690#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5686#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5684#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5682#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5681#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5680#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5669#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5667#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5665#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5663#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5659#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5657#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5655#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5654#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5653#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5644#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5641#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5639#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5637#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5636#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5635#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5626#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5623#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5621#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5619#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5612#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5616#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet1#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet1#1;call main_#t~mem2#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4); 5611#L23 assume !(10 == main_#t~mem2#1);havoc main_#t~mem2#1; 5599#L20-2 main_~i~0#1 := 2 + main_~i~0#1; 5600#L20-3 assume !(main_~i~0#1 < 100000); 5607#L20-4 main_~i~0#1 := 0; 5593#L26-3 [2022-07-23 14:34:55,299 INFO L754 eck$LassoCheckResult]: Loop: 5593#L26-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); 5603#L28 assume !(10 == main_#t~mem3#1);havoc main_#t~mem3#1; 5592#L26-2 main_~i~0#1 := 2 + main_~i~0#1; 5593#L26-3 [2022-07-23 14:34:55,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:55,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1178112656, now seen corresponding path program 5 times [2022-07-23 14:34:55,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:55,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464881800] [2022-07-23 14:34:55,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:55,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:58,668 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 13207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:58,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:34:58,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464881800] [2022-07-23 14:34:58,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464881800] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:34:58,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741244051] [2022-07-23 14:34:58,668 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 14:34:58,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:34:58,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:58,670 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:34:58,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process