./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-examples/standard_sentinel-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 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-examples/standard_sentinel-2.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 590a845a219659d0ad58521e10c3551f2ec7e80ca70e994a8616abe765f6f296 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 15:06:58,714 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 15:06:58,716 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 15:06:58,751 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 15:06:58,752 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 15:06:58,753 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 15:06:58,754 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 15:06:58,755 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 15:06:58,757 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 15:06:58,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 15:06:58,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 15:06:58,762 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 15:06:58,763 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 15:06:58,764 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 15:06:58,765 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 15:06:58,767 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 15:06:58,768 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 15:06:58,769 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 15:06:58,770 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 15:06:58,775 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 15:06:58,776 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 15:06:58,777 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 15:06:58,777 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 15:06:58,778 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 15:06:58,779 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 15:06:58,784 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 15:06:58,784 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 15:06:58,785 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 15:06:58,785 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 15:06:58,786 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 15:06:58,787 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 15:06:58,787 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 15:06:58,789 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 15:06:58,789 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 15:06:58,790 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 15:06:58,790 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 15:06:58,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 15:06:58,791 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 15:06:58,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 15:06:58,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 15:06:58,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 15:06:58,793 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 15:06:58,794 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-14 15:06:58,816 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 15:06:58,817 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 15:06:58,817 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 15:06:58,817 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 15:06:58,819 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 15:06:58,819 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 15:06:58,819 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 15:06:58,819 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 15:06:58,819 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 15:06:58,820 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 15:06:58,820 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 15:06:58,820 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 15:06:58,821 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 15:06:58,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 15:06:58,821 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 15:06:58,821 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 15:06:58,821 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 15:06:58,821 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 15:06:58,822 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 15:06:58,822 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 15:06:58,822 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 15:06:58,822 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 15:06:58,822 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 15:06:58,822 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 15:06:58,823 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 15:06:58,823 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 15:06:58,823 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 15:06:58,823 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 15:06:58,823 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 15:06:58,824 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 15:06:58,824 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 15:06:58,825 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 15:06:58,825 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 -> 590a845a219659d0ad58521e10c3551f2ec7e80ca70e994a8616abe765f6f296 [2022-07-14 15:06:59,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 15:06:59,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 15:06:59,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 15:06:59,019 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 15:06:59,019 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 15:06:59,020 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_sentinel-2.i [2022-07-14 15:06:59,064 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9579409be/5c5e8b2516254a228ce24d9b67645963/FLAGa5943ed71 [2022-07-14 15:06:59,490 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 15:06:59,491 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_sentinel-2.i [2022-07-14 15:06:59,495 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9579409be/5c5e8b2516254a228ce24d9b67645963/FLAGa5943ed71 [2022-07-14 15:06:59,911 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9579409be/5c5e8b2516254a228ce24d9b67645963 [2022-07-14 15:06:59,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 15:06:59,913 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 15:06:59,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 15:06:59,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 15:06:59,917 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 15:06:59,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:06:59" (1/1) ... [2022-07-14 15:06:59,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@738ae1a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:06:59, skipping insertion in model container [2022-07-14 15:06:59,919 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:06:59" (1/1) ... [2022-07-14 15:06:59,923 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 15:06:59,931 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 15:07:00,050 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_sentinel-2.i[852,865] [2022-07-14 15:07:00,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:07:00,080 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 15:07:00,090 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_sentinel-2.i[852,865] [2022-07-14 15:07:00,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:07:00,116 INFO L208 MainTranslator]: Completed translation [2022-07-14 15:07:00,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:00 WrapperNode [2022-07-14 15:07:00,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 15:07:00,132 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 15:07:00,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 15:07:00,133 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 15:07:00,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:00" (1/1) ... [2022-07-14 15:07:00,143 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:00" (1/1) ... [2022-07-14 15:07:00,165 INFO L137 Inliner]: procedures = 16, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2022-07-14 15:07:00,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 15:07:00,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 15:07:00,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 15:07:00,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 15:07:00,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:00" (1/1) ... [2022-07-14 15:07:00,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:00" (1/1) ... [2022-07-14 15:07:00,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:00" (1/1) ... [2022-07-14 15:07:00,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:00" (1/1) ... [2022-07-14 15:07:00,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:00" (1/1) ... [2022-07-14 15:07:00,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:00" (1/1) ... [2022-07-14 15:07:00,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:00" (1/1) ... [2022-07-14 15:07:00,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 15:07:00,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 15:07:00,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 15:07:00,214 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 15:07:00,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:00" (1/1) ... [2022-07-14 15:07:00,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:00,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:00,260 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-14 15:07:00,267 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-14 15:07:00,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 15:07:00,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 15:07:00,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 15:07:00,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 15:07:00,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 15:07:00,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 15:07:00,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 15:07:00,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 15:07:00,338 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 15:07:00,339 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 15:07:00,460 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 15:07:00,479 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 15:07:00,479 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 15:07:00,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:07:00 BoogieIcfgContainer [2022-07-14 15:07:00,480 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 15:07:00,481 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 15:07:00,481 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 15:07:00,483 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 15:07:00,484 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:07:00,484 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 03:06:59" (1/3) ... [2022-07-14 15:07:00,485 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ffba19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:07:00, skipping insertion in model container [2022-07-14 15:07:00,485 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:07:00,485 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:00" (2/3) ... [2022-07-14 15:07:00,485 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ffba19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:07:00, skipping insertion in model container [2022-07-14 15:07:00,485 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:07:00,485 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:07:00" (3/3) ... [2022-07-14 15:07:00,486 INFO L354 chiAutomizerObserver]: Analyzing ICFG standard_sentinel-2.i [2022-07-14 15:07:00,560 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 15:07:00,560 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 15:07:00,560 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 15:07:00,560 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 15:07:00,560 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 15:07:00,560 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 15:07:00,560 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 15:07:00,561 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 15:07:00,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:00,574 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-07-14 15:07:00,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:00,587 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:00,591 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:07:00,591 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:07:00,592 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 15:07:00,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:00,593 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-07-14 15:07:00,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:00,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:00,594 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 15:07:00,594 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:07:00,599 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(22, 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~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; 10#L20-3true [2022-07-14 15:07:00,603 INFO L754 eck$LassoCheckResult]: Loop: 10#L20-3true assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 11#L20-2true main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 10#L20-3true [2022-07-14 15:07:00,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:00,612 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-14 15:07:00,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:00,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917895911] [2022-07-14 15:07:00,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:00,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:00,715 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:00,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:00,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:00,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-07-14 15:07:00,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:00,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823969882] [2022-07-14 15:07:00,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:00,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:00,771 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:00,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:00,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:00,785 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-07-14 15:07:00,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:00,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635691462] [2022-07-14 15:07:00,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:00,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:00,811 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:00,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:01,088 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:07:01,088 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:07:01,089 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:07:01,089 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:07:01,089 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:07:01,090 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:01,090 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:07:01,090 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:07:01,090 INFO L133 ssoRankerPreferences]: Filename of dumped script: standard_sentinel-2.i_Iteration1_Lasso [2022-07-14 15:07:01,090 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:07:01,090 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:07:01,104 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-14 15:07:01,109 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-14 15:07:01,110 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-14 15:07:01,112 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-14 15:07:01,114 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-14 15:07:01,117 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-14 15:07:01,118 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-14 15:07:01,229 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-14 15:07:01,231 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-14 15:07:01,233 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-14 15:07:01,234 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-14 15:07:01,397 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:07:01,399 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:07:01,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:01,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:01,402 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-14 15:07:01,403 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-14 15:07:01,404 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-14 15:07:01,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:01,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:01,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:01,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:01,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:01,412 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:07:01,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:01,428 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:01,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:01,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:01,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:01,448 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-14 15:07:01,449 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-14 15:07:01,450 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-14 15:07:01,456 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:01,456 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:01,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:01,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:01,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:01,457 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:07:01,457 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:01,472 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:01,490 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-14 15:07:01,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:01,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:01,492 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-14 15:07:01,493 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-14 15:07:01,494 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-14 15:07:01,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:01,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:01,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:01,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:01,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:01,500 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:07:01,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:01,509 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:01,527 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-14 15:07:01,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:01,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:01,529 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-14 15:07:01,532 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-14 15:07:01,533 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-14 15:07:01,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:01,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:01,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:01,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:01,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:01,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:07:01,539 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:01,540 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:01,558 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-14 15:07:01,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:01,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:01,559 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-14 15:07:01,560 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-14 15:07:01,561 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-14 15:07:01,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:01,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:01,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:01,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:01,569 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:07:01,569 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:07:01,582 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:01,597 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-14 15:07:01,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:01,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:01,599 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-14 15:07:01,600 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-14 15:07:01,601 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-14 15:07:01,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:01,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:01,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:01,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:01,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:01,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:07:01,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:01,623 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:01,641 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-14 15:07:01,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:01,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:01,642 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-14 15:07:01,646 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-14 15:07:01,647 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-14 15:07:01,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:01,663 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:01,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:01,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:01,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:07:01,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:07:01,675 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:01,690 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-14 15:07:01,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:01,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:01,697 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-14 15:07:01,698 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-14 15:07:01,699 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-14 15:07:01,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:01,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:01,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:01,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:01,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:01,705 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:07:01,705 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:01,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:01,730 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-14 15:07:01,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:01,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:01,732 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-14 15:07:01,732 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-14 15:07:01,734 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-14 15:07:01,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:01,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:01,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:01,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:01,741 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:07:01,741 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:07:01,751 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:01,767 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-14 15:07:01,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:01,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:01,768 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-14 15:07:01,770 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-14 15:07:01,771 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-14 15:07:01,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:01,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:01,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:01,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:01,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:07:01,779 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:07:01,795 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:01,814 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-14 15:07:01,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:01,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:01,822 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-14 15:07:01,823 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-14 15:07:01,824 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-14 15:07:01,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:01,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:01,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:01,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:01,832 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:07:01,832 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:07:01,848 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:01,865 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-14 15:07:01,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:01,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:01,867 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-14 15:07:01,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:01,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:01,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:01,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:01,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:01,894 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:07:01,894 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:07:01,898 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-14 15:07:01,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:01,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:01,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:01,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:01,924 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-14 15:07:01,924 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-14 15:07:01,926 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-14 15:07:01,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:01,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:01,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:01,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:01,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:07:01,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:07:01,949 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:01,966 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-14 15:07:01,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:01,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:01,967 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-14 15:07:02,020 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-14 15:07:02,020 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-14 15:07:02,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:02,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:02,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:02,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:02,028 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:07:02,028 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:07:02,044 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:02,059 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-14 15:07:02,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:02,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:02,061 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-14 15:07:02,063 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-14 15:07:02,064 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-14 15:07:02,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:02,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:02,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:02,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:02,071 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:07:02,071 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:07:02,085 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:02,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-07-14 15:07:02,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:02,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:02,103 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-14 15:07:02,104 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-14 15:07:02,105 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-14 15:07:02,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:02,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:02,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:02,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:02,123 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:07:02,123 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:07:02,139 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:02,156 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-14 15:07:02,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:02,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:02,157 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-14 15:07:02,158 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-14 15:07:02,160 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-14 15:07:02,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:02,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:02,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:02,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:02,177 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:07:02,177 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 15:07:02,209 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:07:02,260 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-07-14 15:07:02,260 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-07-14 15:07:02,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:02,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:02,268 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-14 15:07:02,299 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-14 15:07:02,300 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:07:02,326 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-14 15:07:02,326 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:07:02,326 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 199999*v_rep(select #length ULTIMATE.start_main_~#a~0#1.base)_1 - 8*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-07-14 15:07:02,353 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-14 15:07:02,363 INFO L293 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2022-07-14 15:07:02,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:02,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:07:02,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:07:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:02,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 15:07:02,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:07:02,419 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-14 15:07:02,439 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-14 15:07:02,439 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:02,469 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 36 states and 50 transitions. Complement of second has 8 states. [2022-07-14 15:07:02,470 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-14 15:07:02,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:02,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-07-14 15:07:02,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-14 15:07:02,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:07:02,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-14 15:07:02,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:07:02,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 2 letters. Loop has 4 letters. [2022-07-14 15:07:02,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:07:02,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 50 transitions. [2022-07-14 15:07:02,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-14 15:07:02,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 8 states and 10 transitions. [2022-07-14 15:07:02,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-07-14 15:07:02,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-07-14 15:07:02,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2022-07-14 15:07:02,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:02,497 INFO L369 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-07-14 15:07:02,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2022-07-14 15:07:02,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-07-14 15:07:02,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:02,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2022-07-14 15:07:02,512 INFO L392 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-07-14 15:07:02,512 INFO L374 stractBuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-07-14 15:07:02,512 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 15:07:02,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2022-07-14 15:07:02,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-14 15:07:02,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:02,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:02,512 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-14 15:07:02,512 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:07:02,513 INFO L752 eck$LassoCheckResult]: Stem: 111#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(22, 2); 112#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; 113#L20-3 assume !(main_~i~0#1 < 100000); 114#L20-4 assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; 118#L28-3 [2022-07-14 15:07:02,513 INFO L754 eck$LassoCheckResult]: Loop: 118#L28-3 call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); 117#L28-1 assume !!(main_#t~mem5#1 != main_~marker~0#1);havoc main_#t~mem5#1;main_~i~1#1 := 1 + main_~i~1#1; 118#L28-3 [2022-07-14 15:07:02,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:02,513 INFO L85 PathProgramCache]: Analyzing trace with hash 925709, now seen corresponding path program 1 times [2022-07-14 15:07:02,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:02,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947871836] [2022-07-14 15:07:02,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:02,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:02,537 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-14 15:07:02,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:02,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947871836] [2022-07-14 15:07:02,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947871836] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:07:02,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:07:02,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:07:02,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405070668] [2022-07-14 15:07:02,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:07:02,539 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:07:02,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:02,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 1 times [2022-07-14 15:07:02,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:02,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454817577] [2022-07-14 15:07:02,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:02,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:02,543 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:02,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:02,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:02,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:07:02,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:07:02,572 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 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-14 15:07:02,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:02,579 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2022-07-14 15:07:02,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:07:02,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2022-07-14 15:07:02,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-14 15:07:02,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2022-07-14 15:07:02,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-07-14 15:07:02,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-07-14 15:07:02,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2022-07-14 15:07:02,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:02,580 INFO L369 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-07-14 15:07:02,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2022-07-14 15:07:02,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2022-07-14 15:07:02,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 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-14 15:07:02,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2022-07-14 15:07:02,581 INFO L392 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-07-14 15:07:02,582 INFO L374 stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-07-14 15:07:02,582 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 15:07:02,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2022-07-14 15:07:02,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-14 15:07:02,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:02,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:02,583 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-14 15:07:02,583 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:07:02,583 INFO L752 eck$LassoCheckResult]: Stem: 134#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(22, 2); 135#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; 138#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 136#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 137#L20-3 assume !(main_~i~0#1 < 100000); 139#L20-4 assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; 141#L28-3 [2022-07-14 15:07:02,583 INFO L754 eck$LassoCheckResult]: Loop: 141#L28-3 call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); 140#L28-1 assume !!(main_#t~mem5#1 != main_~marker~0#1);havoc main_#t~mem5#1;main_~i~1#1 := 1 + main_~i~1#1; 141#L28-3 [2022-07-14 15:07:02,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:02,583 INFO L85 PathProgramCache]: Analyzing trace with hash 889660431, now seen corresponding path program 1 times [2022-07-14 15:07:02,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:02,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612517048] [2022-07-14 15:07:02,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:02,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:02,602 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-14 15:07:02,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:02,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612517048] [2022-07-14 15:07:02,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612517048] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:07:02,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731935443] [2022-07-14 15:07:02,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:02,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:07:02,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:02,604 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:07:02,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-14 15:07:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:02,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 15:07:02,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:07:02,703 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-14 15:07:02,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:07:02,720 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-14 15:07:02,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731935443] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:07:02,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:07:02,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-14 15:07:02,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598305712] [2022-07-14 15:07:02,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:07:02,722 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:07:02,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:02,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 2 times [2022-07-14 15:07:02,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:02,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682471278] [2022-07-14 15:07:02,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:02,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:02,731 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:02,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:02,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:02,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 15:07:02,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-14 15:07:02,770 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 3 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 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-14 15:07:02,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:02,783 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-07-14 15:07:02,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 15:07:02,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2022-07-14 15:07:02,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-14 15:07:02,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 15 transitions. [2022-07-14 15:07:02,785 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-07-14 15:07:02,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-07-14 15:07:02,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions. [2022-07-14 15:07:02,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:02,785 INFO L369 hiAutomatonCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-07-14 15:07:02,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions. [2022-07-14 15:07:02,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-07-14 15:07:02,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 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-14 15:07:02,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-07-14 15:07:02,786 INFO L392 hiAutomatonCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-07-14 15:07:02,786 INFO L374 stractBuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-07-14 15:07:02,786 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 15:07:02,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 15 transitions. [2022-07-14 15:07:02,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-14 15:07:02,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:02,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:02,787 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2022-07-14 15:07:02,787 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:07:02,787 INFO L752 eck$LassoCheckResult]: Stem: 196#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(22, 2); 197#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; 198#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 199#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 200#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 201#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 209#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 208#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 207#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 206#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 205#L20-3 assume !(main_~i~0#1 < 100000); 204#L20-4 assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; 203#L28-3 [2022-07-14 15:07:02,787 INFO L754 eck$LassoCheckResult]: Loop: 203#L28-3 call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); 202#L28-1 assume !!(main_#t~mem5#1 != main_~marker~0#1);havoc main_#t~mem5#1;main_~i~1#1 := 1 + main_~i~1#1; 203#L28-3 [2022-07-14 15:07:02,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:02,787 INFO L85 PathProgramCache]: Analyzing trace with hash 833936661, now seen corresponding path program 2 times [2022-07-14 15:07:02,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:02,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789124984] [2022-07-14 15:07:02,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:02,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:02,836 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:02,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:02,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789124984] [2022-07-14 15:07:02,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789124984] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:07:02,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934116461] [2022-07-14 15:07:02,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 15:07:02,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:07:02,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:02,841 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:07:02,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-14 15:07:02,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 15:07:02,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 15:07:02,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 15:07:02,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:07:02,901 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:02,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:07:02,947 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:02,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934116461] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:07:02,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:07:02,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-14 15:07:02,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954260306] [2022-07-14 15:07:02,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:07:02,948 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:07:02,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:02,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 3 times [2022-07-14 15:07:02,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:02,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47924619] [2022-07-14 15:07:02,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:02,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:02,952 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:02,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:02,996 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-14 15:07:03,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:03,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 15:07:03,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-14 15:07:03,010 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. cyclomatic complexity: 3 Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 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-14 15:07:03,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:03,048 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-07-14 15:07:03,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 15:07:03,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 27 transitions. [2022-07-14 15:07:03,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-14 15:07:03,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 27 transitions. [2022-07-14 15:07:03,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-07-14 15:07:03,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-07-14 15:07:03,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 27 transitions. [2022-07-14 15:07:03,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:03,052 INFO L369 hiAutomatonCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-07-14 15:07:03,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 27 transitions. [2022-07-14 15:07:03,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-14 15:07:03,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 25 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-14 15:07:03,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-07-14 15:07:03,055 INFO L392 hiAutomatonCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-07-14 15:07:03,055 INFO L374 stractBuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-07-14 15:07:03,056 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 15:07:03,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 27 transitions. [2022-07-14 15:07:03,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-14 15:07:03,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:03,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:03,059 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2022-07-14 15:07:03,059 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:07:03,059 INFO L752 eck$LassoCheckResult]: Stem: 318#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(22, 2); 319#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; 320#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 321#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 322#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 323#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 324#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 343#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 342#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 341#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 340#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 339#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 338#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 337#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 336#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 335#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 334#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 333#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 332#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 331#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 330#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 329#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 328#L20-3 assume !(main_~i~0#1 < 100000); 327#L20-4 assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; 326#L28-3 [2022-07-14 15:07:03,059 INFO L754 eck$LassoCheckResult]: Loop: 326#L28-3 call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); 325#L28-1 assume !!(main_#t~mem5#1 != main_~marker~0#1);havoc main_#t~mem5#1;main_~i~1#1 := 1 + main_~i~1#1; 326#L28-3 [2022-07-14 15:07:03,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:03,060 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272353, now seen corresponding path program 3 times [2022-07-14 15:07:03,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:03,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341763864] [2022-07-14 15:07:03,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:03,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:03,188 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:03,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:03,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341763864] [2022-07-14 15:07:03,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341763864] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:07:03,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685479918] [2022-07-14 15:07:03,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 15:07:03,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:07:03,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:03,204 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:07:03,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-14 15:07:03,277 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-14 15:07:03,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 15:07:03,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 15:07:03,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:07:03,315 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:03,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:07:03,455 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:03,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685479918] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:07:03,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:07:03,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-07-14 15:07:03,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046769358] [2022-07-14 15:07:03,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:07:03,456 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:07:03,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:03,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 4 times [2022-07-14 15:07:03,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:03,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964197084] [2022-07-14 15:07:03,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:03,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:03,459 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:03,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:03,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:03,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-14 15:07:03,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-07-14 15:07:03,481 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. cyclomatic complexity: 3 Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 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-14 15:07:03,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:03,534 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-07-14 15:07:03,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-14 15:07:03,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 51 transitions. [2022-07-14 15:07:03,536 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-14 15:07:03,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 51 transitions. [2022-07-14 15:07:03,536 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-07-14 15:07:03,536 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-07-14 15:07:03,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 51 transitions. [2022-07-14 15:07:03,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:03,537 INFO L369 hiAutomatonCegarLoop]: Abstraction has 50 states and 51 transitions. [2022-07-14 15:07:03,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 51 transitions. [2022-07-14 15:07:03,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-07-14 15:07:03,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.02) internal successors, (51), 49 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:03,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2022-07-14 15:07:03,539 INFO L392 hiAutomatonCegarLoop]: Abstraction has 50 states and 51 transitions. [2022-07-14 15:07:03,539 INFO L374 stractBuchiCegarLoop]: Abstraction has 50 states and 51 transitions. [2022-07-14 15:07:03,539 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-14 15:07:03,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 51 transitions. [2022-07-14 15:07:03,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-14 15:07:03,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:03,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:03,540 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1, 1] [2022-07-14 15:07:03,540 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:07:03,541 INFO L752 eck$LassoCheckResult]: Stem: 560#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(22, 2); 561#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; 562#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 563#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 564#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 565#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 566#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 609#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 608#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 607#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 606#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 605#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 604#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 603#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 602#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 601#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 600#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 599#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 598#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 597#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 596#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 595#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 594#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 593#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 592#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 591#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 590#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 589#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 588#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 587#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 586#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 585#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 584#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 583#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 582#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 581#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 580#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 579#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 578#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 577#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 576#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 575#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 574#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 573#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 572#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 571#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 570#L20-3 assume !(main_~i~0#1 < 100000); 569#L20-4 assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; 568#L28-3 [2022-07-14 15:07:03,541 INFO L754 eck$LassoCheckResult]: Loop: 568#L28-3 call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); 567#L28-1 assume !!(main_#t~mem5#1 != main_~marker~0#1);havoc main_#t~mem5#1;main_~i~1#1 := 1 + main_~i~1#1; 568#L28-3 [2022-07-14 15:07:03,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:03,541 INFO L85 PathProgramCache]: Analyzing trace with hash 828161209, now seen corresponding path program 4 times [2022-07-14 15:07:03,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:03,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72239525] [2022-07-14 15:07:03,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:03,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:03,790 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:03,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:03,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72239525] [2022-07-14 15:07:03,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72239525] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:07:03,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483434064] [2022-07-14 15:07:03,790 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 15:07:03,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:07:03,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:03,808 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:07:03,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-14 15:07:03,893 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 15:07:03,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 15:07:03,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-14 15:07:03,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:07:03,957 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:03,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:07:04,521 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:04,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483434064] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:07:04,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:07:04,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-07-14 15:07:04,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145130392] [2022-07-14 15:07:04,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:07:04,523 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:07:04,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:04,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 5 times [2022-07-14 15:07:04,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:04,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431843502] [2022-07-14 15:07:04,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:04,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:04,526 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:04,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:04,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:04,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-14 15:07:04,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-07-14 15:07:04,551 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. cyclomatic complexity: 3 Second operand has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 49 states have internal predecessors, (97), 0 states have call successors, (0), 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-14 15:07:04,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:04,653 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2022-07-14 15:07:04,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-14 15:07:04,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 99 transitions. [2022-07-14 15:07:04,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-14 15:07:04,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 98 states and 99 transitions. [2022-07-14 15:07:04,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-07-14 15:07:04,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-07-14 15:07:04,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 99 transitions. [2022-07-14 15:07:04,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:04,656 INFO L369 hiAutomatonCegarLoop]: Abstraction has 98 states and 99 transitions. [2022-07-14 15:07:04,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 99 transitions. [2022-07-14 15:07:04,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-14 15:07:04,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.010204081632653) internal successors, (99), 97 states have internal predecessors, (99), 0 states have call successors, (0), 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-14 15:07:04,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2022-07-14 15:07:04,659 INFO L392 hiAutomatonCegarLoop]: Abstraction has 98 states and 99 transitions. [2022-07-14 15:07:04,659 INFO L374 stractBuchiCegarLoop]: Abstraction has 98 states and 99 transitions. [2022-07-14 15:07:04,659 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-14 15:07:04,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 99 transitions. [2022-07-14 15:07:04,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-14 15:07:04,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:04,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:04,662 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1, 1] [2022-07-14 15:07:04,662 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:07:04,662 INFO L752 eck$LassoCheckResult]: Stem: 1042#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(22, 2); 1043#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; 1044#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1045#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1046#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1047#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1048#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1139#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1138#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1137#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1136#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1135#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1134#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1133#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1132#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1131#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1130#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1129#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1128#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1127#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1126#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1125#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1124#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1123#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1122#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1121#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1120#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1119#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1118#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1117#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1116#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1115#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1114#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1113#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1112#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1111#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1110#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1109#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1108#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1107#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1106#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1105#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1104#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1103#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1102#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1101#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1100#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1099#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1098#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1097#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1096#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1095#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1094#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1093#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1092#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1091#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1090#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1089#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1088#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1087#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1086#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1085#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1084#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1083#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1082#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1081#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1080#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1079#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1078#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1077#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1076#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1075#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1074#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1073#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1072#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1071#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1070#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1069#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1068#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1067#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1066#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1065#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1064#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1063#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1062#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1061#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1060#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1059#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1058#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1057#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1056#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1055#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1054#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 1053#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 1052#L20-3 assume !(main_~i~0#1 < 100000); 1051#L20-4 assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; 1050#L28-3 [2022-07-14 15:07:04,662 INFO L754 eck$LassoCheckResult]: Loop: 1050#L28-3 call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); 1049#L28-1 assume !!(main_#t~mem5#1 != main_~marker~0#1);havoc main_#t~mem5#1;main_~i~1#1 := 1 + main_~i~1#1; 1050#L28-3 [2022-07-14 15:07:04,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:04,663 INFO L85 PathProgramCache]: Analyzing trace with hash 830581481, now seen corresponding path program 5 times [2022-07-14 15:07:04,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:04,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864021306] [2022-07-14 15:07:04,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:04,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:05,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:05,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:05,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864021306] [2022-07-14 15:07:05,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864021306] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:07:05,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346384713] [2022-07-14 15:07:05,514 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 15:07:05,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:07:05,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:05,515 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-14 15:07:05,516 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-14 15:07:07,917 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-07-14 15:07:07,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 15:07:07,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-14 15:07:07,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:07:08,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:08,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:07:10,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:10,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346384713] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:07:10,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:07:10,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2022-07-14 15:07:10,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660208406] [2022-07-14 15:07:10,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:07:10,148 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:07:10,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:10,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 6 times [2022-07-14 15:07:10,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:10,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878330821] [2022-07-14 15:07:10,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:10,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:10,152 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:10,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:10,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:10,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-07-14 15:07:10,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-07-14 15:07:10,180 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. cyclomatic complexity: 3 Second operand has 97 states, 97 states have (on average 1.9896907216494846) internal successors, (193), 97 states have internal predecessors, (193), 0 states have call successors, (0), 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-14 15:07:10,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:10,419 INFO L93 Difference]: Finished difference Result 194 states and 195 transitions. [2022-07-14 15:07:10,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-07-14 15:07:10,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 195 transitions. [2022-07-14 15:07:10,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-14 15:07:10,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 194 states and 195 transitions. [2022-07-14 15:07:10,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-07-14 15:07:10,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-07-14 15:07:10,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 194 states and 195 transitions. [2022-07-14 15:07:10,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:10,424 INFO L369 hiAutomatonCegarLoop]: Abstraction has 194 states and 195 transitions. [2022-07-14 15:07:10,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states and 195 transitions. [2022-07-14 15:07:10,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2022-07-14 15:07:10,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 194 states have (on average 1.0051546391752577) internal successors, (195), 193 states have internal predecessors, (195), 0 states have call successors, (0), 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-14 15:07:10,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2022-07-14 15:07:10,429 INFO L392 hiAutomatonCegarLoop]: Abstraction has 194 states and 195 transitions. [2022-07-14 15:07:10,430 INFO L374 stractBuchiCegarLoop]: Abstraction has 194 states and 195 transitions. [2022-07-14 15:07:10,430 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-14 15:07:10,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194 states and 195 transitions. [2022-07-14 15:07:10,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-14 15:07:10,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:10,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:10,432 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 1, 1, 1, 1] [2022-07-14 15:07:10,432 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-14 15:07:10,433 INFO L752 eck$LassoCheckResult]: Stem: 2004#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(22, 2); 2005#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet4#1, main_#t~post3#1, main_~i~0#1, main_#t~mem5#1, main_~i~1#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~marker~0#1, main_~pos~0#1;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(400000);main_~marker~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~pos~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~i~0#1 := 0; 2006#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2007#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2008#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2009#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2010#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2197#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2196#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2195#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2194#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2193#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2192#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2191#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2190#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2189#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2188#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2187#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2186#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2185#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2184#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2183#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2182#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2181#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2180#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2179#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2178#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2177#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2176#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2175#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2174#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2173#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2172#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2171#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2170#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2169#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2168#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2167#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2166#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2165#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2164#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2163#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2162#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2161#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2160#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2159#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2158#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2157#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2156#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2155#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2154#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2153#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2152#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2151#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2150#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2149#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2148#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2147#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2146#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2145#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2144#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2143#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2142#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2141#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2140#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2139#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2138#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2137#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2136#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2135#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2134#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2133#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2132#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2131#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2130#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2129#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2128#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2127#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2126#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2125#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2124#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2123#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2122#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2121#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2120#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2119#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2118#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2117#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2116#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2115#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2114#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2113#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2112#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2111#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2110#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2109#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2108#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2107#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2106#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2105#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2104#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2103#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2102#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2101#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2100#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2099#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2098#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2097#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2096#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2095#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2094#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2093#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2092#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2091#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2090#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2089#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2088#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2087#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2086#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2085#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2084#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2083#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2082#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2081#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2080#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2079#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2078#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2077#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2076#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2075#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2074#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2073#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2072#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2071#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2070#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2069#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2068#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2067#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2066#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2065#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2064#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2063#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2062#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2061#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2060#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2059#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2058#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2057#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2056#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2055#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2054#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2053#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2052#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2051#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2050#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2049#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2048#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2047#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2046#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2045#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2044#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2043#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2042#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2041#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2040#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2039#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2038#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2037#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2036#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2035#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2034#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2033#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2032#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2031#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2030#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2029#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2028#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2027#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2026#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2025#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2024#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2023#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2022#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2021#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2020#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2019#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2018#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2017#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2016#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet4#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet4#1; 2015#L20-2 main_#t~post3#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post3#1;havoc main_#t~post3#1; 2014#L20-3 assume !(main_~i~0#1 < 100000); 2013#L20-4 assume main_~pos~0#1 >= 0 && main_~pos~0#1 < 100000;call write~int(main_~marker~0#1, main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~pos~0#1, 4);main_~i~1#1 := 0; 2012#L28-3 [2022-07-14 15:07:10,433 INFO L754 eck$LassoCheckResult]: Loop: 2012#L28-3 call main_#t~mem5#1 := read~int(main_~#a~0#1.base, main_~#a~0#1.offset + 4 * main_~i~1#1, 4); 2011#L28-1 assume !!(main_#t~mem5#1 != main_~marker~0#1);havoc main_#t~mem5#1;main_~i~1#1 := 1 + main_~i~1#1; 2012#L28-3 [2022-07-14 15:07:10,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:10,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1165371209, now seen corresponding path program 6 times [2022-07-14 15:07:10,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:10,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650812481] [2022-07-14 15:07:10,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:10,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:12,676 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:12,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:12,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650812481] [2022-07-14 15:07:12,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650812481] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:07:12,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309084596] [2022-07-14 15:07:12,676 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-14 15:07:12,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:07:12,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:12,678 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-14 15:07:12,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process