./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 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-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-?-791161d [2022-07-23 14:34:28,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 14:34:28,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 14:34:28,952 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 14:34:28,952 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 14:34:28,954 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 14:34:28,956 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 14:34:28,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 14:34:28,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 14:34:28,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 14:34:28,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 14:34:28,966 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 14:34:28,967 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 14:34:28,968 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 14:34:28,969 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 14:34:28,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 14:34:28,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 14:34:28,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 14:34:28,976 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 14:34:28,981 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 14:34:28,982 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 14:34:28,983 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 14:34:28,984 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 14:34:28,984 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 14:34:28,986 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 14:34:28,992 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 14:34:28,993 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 14:34:28,993 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 14:34:28,995 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 14:34:28,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 14:34:28,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 14:34:28,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 14:34:28,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 14:34:28,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 14:34:28,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 14:34:29,000 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 14:34:29,000 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 14:34:29,001 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 14:34:29,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 14:34:29,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 14:34:29,002 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 14:34:29,003 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 14:34:29,005 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-23 14:34:29,028 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 14:34:29,029 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 14:34:29,029 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 14:34:29,029 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 14:34:29,030 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 14:34:29,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 14:34:29,031 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 14:34:29,031 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-23 14:34:29,031 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-23 14:34:29,032 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-23 14:34:29,032 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-23 14:34:29,032 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-23 14:34:29,033 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-23 14:34:29,033 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 14:34:29,033 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 14:34:29,033 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 14:34:29,033 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 14:34:29,033 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 14:34:29,034 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 14:34:29,034 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-23 14:34:29,034 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-23 14:34:29,034 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-23 14:34:29,034 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 14:34:29,034 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 14:34:29,035 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-23 14:34:29,035 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 14:34:29,035 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-23 14:34:29,035 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 14:34:29,036 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 14:34:29,036 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 14:34:29,036 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 14:34:29,037 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-23 14:34:29,038 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-23 14:34:29,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 14:34:29,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 14:34:29,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 14:34:29,255 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 14:34:29,255 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 14:34:29,257 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-23 14:34:29,335 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c58f8b33/577049cd60134c97ae5a0892fdf0fccf/FLAGd423d295a [2022-07-23 14:34:29,695 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 14:34:29,696 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_sentinel-2.i [2022-07-23 14:34:29,703 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c58f8b33/577049cd60134c97ae5a0892fdf0fccf/FLAGd423d295a [2022-07-23 14:34:29,714 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c58f8b33/577049cd60134c97ae5a0892fdf0fccf [2022-07-23 14:34:29,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 14:34:29,718 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 14:34:29,720 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 14:34:29,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 14:34:29,723 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 14:34:29,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:34:29" (1/1) ... [2022-07-23 14:34:29,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ffba902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:29, skipping insertion in model container [2022-07-23 14:34:29,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:34:29" (1/1) ... [2022-07-23 14:34:29,730 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 14:34:29,742 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 14:34:29,873 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-23 14:34:29,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 14:34:29,889 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 14:34:29,897 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-23 14:34:29,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 14:34:29,912 INFO L208 MainTranslator]: Completed translation [2022-07-23 14:34:29,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:29 WrapperNode [2022-07-23 14:34:29,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 14:34:29,913 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 14:34:29,914 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 14:34:29,914 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 14:34:29,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:29" (1/1) ... [2022-07-23 14:34:29,924 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:29" (1/1) ... [2022-07-23 14:34:29,939 INFO L137 Inliner]: procedures = 16, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2022-07-23 14:34:29,940 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 14:34:29,940 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 14:34:29,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 14:34:29,941 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 14:34:29,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:29" (1/1) ... [2022-07-23 14:34:29,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:29" (1/1) ... [2022-07-23 14:34:29,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:29" (1/1) ... [2022-07-23 14:34:29,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:29" (1/1) ... [2022-07-23 14:34:29,953 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:29" (1/1) ... [2022-07-23 14:34:29,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:29" (1/1) ... [2022-07-23 14:34:29,957 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:29" (1/1) ... [2022-07-23 14:34:29,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 14:34:29,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 14:34:29,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 14:34:29,960 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 14:34:29,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:29" (1/1) ... [2022-07-23 14:34:29,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:29,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:29,996 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:34:30,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-23 14:34:30,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 14:34:30,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 14:34:30,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 14:34:30,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 14:34:30,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 14:34:30,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 14:34:30,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 14:34:30,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 14:34:30,080 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 14:34:30,081 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 14:34:30,206 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 14:34:30,211 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 14:34:30,211 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-23 14:34:30,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:34:30 BoogieIcfgContainer [2022-07-23 14:34:30,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 14:34:30,220 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-23 14:34:30,220 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-23 14:34:30,223 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-23 14:34:30,223 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:34:30,224 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.07 02:34:29" (1/3) ... [2022-07-23 14:34:30,229 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75e7c017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 02:34:30, skipping insertion in model container [2022-07-23 14:34:30,229 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:34:30,229 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:34:29" (2/3) ... [2022-07-23 14:34:30,234 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75e7c017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 02:34:30, skipping insertion in model container [2022-07-23 14:34:30,234 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:34:30,235 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:34:30" (3/3) ... [2022-07-23 14:34:30,236 INFO L354 chiAutomizerObserver]: Analyzing ICFG standard_sentinel-2.i [2022-07-23 14:34:30,309 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-23 14:34:30,309 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-23 14:34:30,309 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-23 14:34:30,310 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-23 14:34:30,310 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-23 14:34:30,310 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-23 14:34:30,310 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-23 14:34:30,310 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-23 14:34:30,314 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-23 14:34:30,331 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-07-23 14:34:30,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:34:30,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:34:30,345 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 14:34:30,347 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:34:30,348 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-23 14:34:30,348 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-23 14:34:30,351 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-07-23 14:34:30,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:34:30,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:34:30,352 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-23 14:34:30,352 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:34:30,359 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-23 14:34:30,359 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-23 14:34:30,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:30,374 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-23 14:34:30,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:30,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976583975] [2022-07-23 14:34:30,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:30,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:30,494 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:34:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:30,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:34:30,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:30,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-07-23 14:34:30,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:30,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342775118] [2022-07-23 14:34:30,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:30,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:30,563 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:34:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:30,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:34:30,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:30,581 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-07-23 14:34:30,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:30,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253245127] [2022-07-23 14:34:30,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:30,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:30,621 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:34:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:30,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:34:30,993 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:34:30,994 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:34:30,994 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:34:30,995 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:34:30,995 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:34:30,995 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:30,996 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:34:30,996 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:34:30,996 INFO L133 ssoRankerPreferences]: Filename of dumped script: standard_sentinel-2.i_Iteration1_Lasso [2022-07-23 14:34:30,996 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:34:30,996 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:34:31,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:34:31,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:34:31,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:34:31,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:34:31,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:34:31,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:34:31,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:34:31,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:34:31,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:34:31,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:34:31,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:34:31,449 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:34:31,452 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:34:31,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:31,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:31,455 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:34:31,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:34:31,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:31,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:34:31,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:31,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:31,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:31,476 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:34:31,477 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:34:31,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-23 14:34:31,480 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:31,502 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-23 14:34:31,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:31,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:31,504 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:34:31,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-23 14:34:31,506 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:34:31,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:31,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:34:31,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:31,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:31,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:31,514 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:34:31,514 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:34:31,515 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:31,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-23 14:34:31,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:31,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:31,533 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:34:31,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-23 14:34:31,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:34:31,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:31,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:34:31,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:31,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:31,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:31,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:34:31,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:34:31,545 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:31,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-23 14:34:31,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:31,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:31,562 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:34:31,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-23 14:34:31,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:34:31,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:31,573 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:34:31,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:31,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:31,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:31,574 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:34:31,574 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:34:31,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:31,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-23 14:34:31,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:31,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:31,592 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:34:31,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-23 14:34:31,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:34:31,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:31,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:31,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:31,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:31,604 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:34:31,604 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:34:31,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:31,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-23 14:34:31,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:31,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:31,659 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:34:31,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:34:31,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:31,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:34:31,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:31,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:31,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:31,676 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:34:31,676 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:34:31,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-23 14:34:31,678 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:31,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-23 14:34:31,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:31,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:31,696 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:34:31,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-23 14:34:31,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:34:31,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:31,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:31,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:31,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:31,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:34:31,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:34:31,721 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:31,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-23 14:34:31,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:31,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:31,739 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:34:31,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-23 14:34:31,740 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:34:31,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:31,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:34:31,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:31,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:31,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:31,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:34:31,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:34:31,759 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:31,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-23 14:34:31,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:31,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:31,787 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:34:31,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-23 14:34:31,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:34:31,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:31,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:31,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:31,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:31,799 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:34:31,799 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:34:31,817 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:31,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-07-23 14:34:31,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:31,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:31,834 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:34:31,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-23 14:34:31,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:34:31,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:31,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:31,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:31,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:31,845 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:34:31,845 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:34:31,859 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:31,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-23 14:34:31,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:31,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:31,877 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:34:31,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-23 14:34:31,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:34:31,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:31,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:31,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:31,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:31,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:34:31,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:34:31,905 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:31,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-23 14:34:31,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:31,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:31,925 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:34:31,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-23 14:34:31,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:34:31,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:31,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:31,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:31,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:31,947 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:34:31,947 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:34:31,955 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:31,970 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-23 14:34:31,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:31,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:31,972 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:34:31,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-23 14:34:31,976 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:34:31,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:31,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:31,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:31,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:31,985 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:34:31,985 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:34:31,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:32,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-07-23 14:34:32,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:32,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:32,011 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:34:32,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-23 14:34:32,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:34:32,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:32,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:32,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:32,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:32,026 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:34:32,026 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:34:32,047 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:32,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-23 14:34:32,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:32,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:32,074 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:34:32,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-23 14:34:32,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:34:32,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:32,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:32,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:32,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:32,086 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:34:32,086 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:34:32,094 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:32,109 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-23 14:34:32,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:32,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:32,110 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:34:32,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-23 14:34:32,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:34:32,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:32,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:32,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:32,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:32,121 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:34:32,121 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:34:32,132 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:34:32,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-23 14:34:32,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:32,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:32,161 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:34:32,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:34:32,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:34:32,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:34:32,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:34:32,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:34:32,185 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:34:32,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 14:34:32,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-23 14:34:32,197 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 14:34:32,217 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2022-07-23 14:34:32,218 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-07-23 14:34:32,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:34:32,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:32,231 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:34:32,264 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 14:34:32,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-23 14:34:32,300 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-23 14:34:32,300 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 14:34:32,301 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-23 14:34:32,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-07-23 14:34:32,372 INFO L293 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2022-07-23 14:34:32,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:32,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 14:34:32,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:34:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:32,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 14:34:32,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:34:32,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:32,479 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-23 14:34:32,481 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-23 14:34:32,532 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-23 14:34:32,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-23 14:34:32,540 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-23 14:34:32,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-07-23 14:34:32,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-23 14:34:32,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:34:32,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-23 14:34:32,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:34:32,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 2 letters. Loop has 4 letters. [2022-07-23 14:34:32,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:34:32,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 50 transitions. [2022-07-23 14:34:32,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:34:32,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 8 states and 10 transitions. [2022-07-23 14:34:32,549 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-07-23 14:34:32,549 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-07-23 14:34:32,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2022-07-23 14:34:32,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:34:32,550 INFO L369 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-07-23 14:34:32,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2022-07-23 14:34:32,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-07-23 14:34:32,568 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-23 14:34:32,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2022-07-23 14:34:32,569 INFO L392 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-07-23 14:34:32,569 INFO L374 stractBuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-07-23 14:34:32,570 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-23 14:34:32,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2022-07-23 14:34:32,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:34:32,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:34:32,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:34:32,571 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-23 14:34:32,572 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:34:32,573 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-23 14:34:32,573 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-23 14:34:32,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:32,574 INFO L85 PathProgramCache]: Analyzing trace with hash 925709, now seen corresponding path program 1 times [2022-07-23 14:34:32,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:32,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049935635] [2022-07-23 14:34:32,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:32,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:32,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:32,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:34:32,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049935635] [2022-07-23 14:34:32,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049935635] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:34:32,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:34:32,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 14:34:32,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409888689] [2022-07-23 14:34:32,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:34:32,619 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:34:32,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:32,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 1 times [2022-07-23 14:34:32,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:32,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325795320] [2022-07-23 14:34:32,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:32,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:32,632 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:34:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:32,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:34:32,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:34:32,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 14:34:32,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 14:34:32,680 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-23 14:34:32,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:34:32,690 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2022-07-23 14:34:32,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 14:34:32,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2022-07-23 14:34:32,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:34:32,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2022-07-23 14:34:32,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-07-23 14:34:32,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-07-23 14:34:32,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2022-07-23 14:34:32,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:34:32,693 INFO L369 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-07-23 14:34:32,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2022-07-23 14:34:32,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2022-07-23 14:34:32,695 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-23 14:34:32,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2022-07-23 14:34:32,696 INFO L392 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-07-23 14:34:32,696 INFO L374 stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-07-23 14:34:32,696 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-23 14:34:32,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2022-07-23 14:34:32,699 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:34:32,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:34:32,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:34:32,699 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-23 14:34:32,699 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:34:32,700 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-23 14:34:32,700 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-23 14:34:32,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:32,700 INFO L85 PathProgramCache]: Analyzing trace with hash 889660431, now seen corresponding path program 1 times [2022-07-23 14:34:32,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:32,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081777899] [2022-07-23 14:34:32,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:32,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:32,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:32,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:34:32,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081777899] [2022-07-23 14:34:32,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081777899] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:34:32,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441638141] [2022-07-23 14:34:32,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:32,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:34:32,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:32,746 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-23 14:34:32,749 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-23 14:34:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:32,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 14:34:32,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:34:32,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:32,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:34:32,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:34:32,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441638141] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:34:32,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:34:32,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-23 14:34:32,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167109062] [2022-07-23 14:34:32,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:34:32,832 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:34:32,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:32,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 2 times [2022-07-23 14:34:32,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:32,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701223485] [2022-07-23 14:34:32,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:32,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:32,841 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:34:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:32,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:34:32,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:34:32,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 14:34:32,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-23 14:34:32,886 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-23 14:34:32,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:34:32,909 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-07-23 14:34:32,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 14:34:32,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2022-07-23 14:34:32,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:34:32,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 15 transitions. [2022-07-23 14:34:32,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-07-23 14:34:32,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-07-23 14:34:32,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions. [2022-07-23 14:34:32,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:34:32,916 INFO L369 hiAutomatonCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-07-23 14:34:32,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions. [2022-07-23 14:34:32,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-07-23 14:34:32,918 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-23 14:34:32,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-07-23 14:34:32,920 INFO L392 hiAutomatonCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-07-23 14:34:32,920 INFO L374 stractBuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-07-23 14:34:32,920 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-23 14:34:32,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 15 transitions. [2022-07-23 14:34:32,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:34:32,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:34:32,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:34:32,923 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2022-07-23 14:34:32,923 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:34:32,923 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-23 14:34:32,923 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-23 14:34:32,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:32,924 INFO L85 PathProgramCache]: Analyzing trace with hash 833936661, now seen corresponding path program 2 times [2022-07-23 14:34:32,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:32,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511677157] [2022-07-23 14:34:32,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:32,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:33,026 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-23 14:34:33,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:34:33,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511677157] [2022-07-23 14:34:33,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511677157] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:34:33,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707225678] [2022-07-23 14:34:33,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 14:34:33,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:34:33,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:33,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-23 14:34:33,035 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-23 14:34:33,037 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-23 14:34:33,085 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 14:34:33,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 14:34:33,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 14:34:33,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:34:33,115 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-23 14:34:33,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:34:33,173 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-23 14:34:33,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707225678] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:34:33,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:34:33,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-23 14:34:33,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013511636] [2022-07-23 14:34:33,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:34:33,174 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:34:33,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:33,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 3 times [2022-07-23 14:34:33,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:33,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455548177] [2022-07-23 14:34:33,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:33,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:33,179 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:34:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:33,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:34:33,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:34:33,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 14:34:33,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-23 14:34:33,209 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-23 14:34:33,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:34:33,246 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-07-23 14:34:33,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 14:34:33,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 27 transitions. [2022-07-23 14:34:33,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:34:33,254 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 27 transitions. [2022-07-23 14:34:33,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-07-23 14:34:33,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-07-23 14:34:33,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 27 transitions. [2022-07-23 14:34:33,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:34:33,255 INFO L369 hiAutomatonCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-07-23 14:34:33,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 27 transitions. [2022-07-23 14:34:33,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-23 14:34:33,257 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-23 14:34:33,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-07-23 14:34:33,258 INFO L392 hiAutomatonCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-07-23 14:34:33,258 INFO L374 stractBuchiCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-07-23 14:34:33,258 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-23 14:34:33,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 27 transitions. [2022-07-23 14:34:33,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:34:33,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:34:33,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:34:33,261 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2022-07-23 14:34:33,261 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:34:33,261 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-23 14:34:33,262 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-23 14:34:33,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:33,262 INFO L85 PathProgramCache]: Analyzing trace with hash 2127272353, now seen corresponding path program 3 times [2022-07-23 14:34:33,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:33,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414084814] [2022-07-23 14:34:33,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:33,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:33,404 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-23 14:34:33,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:34:33,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414084814] [2022-07-23 14:34:33,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414084814] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:34:33,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195911836] [2022-07-23 14:34:33,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 14:34:33,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:34:33,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:33,411 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-23 14:34:33,437 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-23 14:34:33,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-23 14:34:33,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 14:34:33,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 14:34:33,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:34:33,567 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-23 14:34:33,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:34:33,757 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-23 14:34:33,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195911836] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:34:33,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:34:33,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-07-23 14:34:33,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128581312] [2022-07-23 14:34:33,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:34:33,759 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:34:33,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:33,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 4 times [2022-07-23 14:34:33,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:33,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303521771] [2022-07-23 14:34:33,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:33,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:33,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:33,763 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:34:33,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:33,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:34:33,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:34:33,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-23 14:34:33,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-07-23 14:34:33,817 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-23 14:34:33,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:34:33,891 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-07-23 14:34:33,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-23 14:34:33,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 51 transitions. [2022-07-23 14:34:33,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:34:33,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 51 transitions. [2022-07-23 14:34:33,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-07-23 14:34:33,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-07-23 14:34:33,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 51 transitions. [2022-07-23 14:34:33,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:34:33,898 INFO L369 hiAutomatonCegarLoop]: Abstraction has 50 states and 51 transitions. [2022-07-23 14:34:33,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 51 transitions. [2022-07-23 14:34:33,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-07-23 14:34:33,902 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-23 14:34:33,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2022-07-23 14:34:33,903 INFO L392 hiAutomatonCegarLoop]: Abstraction has 50 states and 51 transitions. [2022-07-23 14:34:33,903 INFO L374 stractBuchiCegarLoop]: Abstraction has 50 states and 51 transitions. [2022-07-23 14:34:33,904 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-23 14:34:33,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 51 transitions. [2022-07-23 14:34:33,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:34:33,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:34:33,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:34:33,910 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1, 1] [2022-07-23 14:34:33,911 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:34:33,911 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-23 14:34:33,911 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-23 14:34:33,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:33,912 INFO L85 PathProgramCache]: Analyzing trace with hash 828161209, now seen corresponding path program 4 times [2022-07-23 14:34:33,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:33,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570118148] [2022-07-23 14:34:33,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:33,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:34,275 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-23 14:34:34,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:34:34,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570118148] [2022-07-23 14:34:34,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570118148] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:34:34,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037917772] [2022-07-23 14:34:34,276 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 14:34:34,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:34:34,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:34,284 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-23 14:34:34,308 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-23 14:34:34,380 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 14:34:34,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 14:34:34,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-23 14:34:34,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:34:34,468 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-23 14:34:34,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:34:35,150 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-23 14:34:35,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037917772] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:34:35,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:34:35,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-07-23 14:34:35,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512915604] [2022-07-23 14:34:35,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:34:35,152 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:34:35,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:35,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 5 times [2022-07-23 14:34:35,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:35,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363410815] [2022-07-23 14:34:35,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:35,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:35,157 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:34:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:35,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:34:35,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:34:35,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-23 14:34:35,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-07-23 14:34:35,186 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-23 14:34:35,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:34:35,329 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2022-07-23 14:34:35,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-23 14:34:35,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 99 transitions. [2022-07-23 14:34:35,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:34:35,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 98 states and 99 transitions. [2022-07-23 14:34:35,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-07-23 14:34:35,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-07-23 14:34:35,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 99 transitions. [2022-07-23 14:34:35,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:34:35,333 INFO L369 hiAutomatonCegarLoop]: Abstraction has 98 states and 99 transitions. [2022-07-23 14:34:35,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 99 transitions. [2022-07-23 14:34:35,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-23 14:34:35,337 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-23 14:34:35,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2022-07-23 14:34:35,338 INFO L392 hiAutomatonCegarLoop]: Abstraction has 98 states and 99 transitions. [2022-07-23 14:34:35,338 INFO L374 stractBuchiCegarLoop]: Abstraction has 98 states and 99 transitions. [2022-07-23 14:34:35,339 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-23 14:34:35,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 99 transitions. [2022-07-23 14:34:35,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:34:35,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:34:35,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:34:35,342 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1, 1] [2022-07-23 14:34:35,342 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:34:35,343 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-23 14:34:35,343 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-23 14:34:35,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:35,344 INFO L85 PathProgramCache]: Analyzing trace with hash 830581481, now seen corresponding path program 5 times [2022-07-23 14:34:35,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:35,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202247642] [2022-07-23 14:34:35,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:35,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:36,378 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-23 14:34:36,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:34:36,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202247642] [2022-07-23 14:34:36,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202247642] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:34:36,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49025570] [2022-07-23 14:34:36,379 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 14:34:36,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:34:36,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:36,381 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:34:36,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-23 14:34:38,801 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-07-23 14:34:38,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 14:34:38,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-23 14:34:38,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:34:38,972 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-23 14:34:38,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:34:41,471 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-23 14:34:41,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49025570] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:34:41,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:34:41,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2022-07-23 14:34:41,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944579382] [2022-07-23 14:34:41,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:34:41,473 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:34:41,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:41,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 6 times [2022-07-23 14:34:41,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:41,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487134436] [2022-07-23 14:34:41,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:41,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:41,480 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:34:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:34:41,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:34:41,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:34:41,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-07-23 14:34:41,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-07-23 14:34:41,514 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-23 14:34:41,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:34:41,913 INFO L93 Difference]: Finished difference Result 194 states and 195 transitions. [2022-07-23 14:34:41,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-07-23 14:34:41,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 195 transitions. [2022-07-23 14:34:41,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:34:41,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 194 states and 195 transitions. [2022-07-23 14:34:41,917 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-07-23 14:34:41,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-07-23 14:34:41,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 194 states and 195 transitions. [2022-07-23 14:34:41,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:34:41,918 INFO L369 hiAutomatonCegarLoop]: Abstraction has 194 states and 195 transitions. [2022-07-23 14:34:41,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states and 195 transitions. [2022-07-23 14:34:41,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2022-07-23 14:34:41,925 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-23 14:34:41,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 195 transitions. [2022-07-23 14:34:41,926 INFO L392 hiAutomatonCegarLoop]: Abstraction has 194 states and 195 transitions. [2022-07-23 14:34:41,926 INFO L374 stractBuchiCegarLoop]: Abstraction has 194 states and 195 transitions. [2022-07-23 14:34:41,926 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-23 14:34:41,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194 states and 195 transitions. [2022-07-23 14:34:41,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:34:41,927 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:34:41,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:34:41,929 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 1, 1, 1, 1] [2022-07-23 14:34:41,929 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:34:41,944 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-23 14:34:41,948 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-23 14:34:41,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:34:41,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1165371209, now seen corresponding path program 6 times [2022-07-23 14:34:41,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:34:41,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027861232] [2022-07-23 14:34:41,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:34:41,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:34:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:34:45,204 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-23 14:34:45,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:34:45,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027861232] [2022-07-23 14:34:45,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027861232] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:34:45,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928185349] [2022-07-23 14:34:45,204 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-23 14:34:45,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:34:45,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:34:45,206 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:34:45,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process