./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-examples/standard_vararg_ground.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c 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_vararg_ground.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 28ac72543f751666908cbd68a77fa11ffe4dd886016c3996df45b97bb42d5078 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 03:25:55,997 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 03:25:55,999 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 03:25:56,048 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 03:25:56,049 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 03:25:56,050 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 03:25:56,052 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 03:25:56,054 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 03:25:56,056 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 03:25:56,060 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 03:25:56,061 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 03:25:56,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 03:25:56,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 03:25:56,065 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 03:25:56,066 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 03:25:56,068 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 03:25:56,069 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 03:25:56,071 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 03:25:56,072 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 03:25:56,077 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 03:25:56,079 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 03:25:56,080 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 03:25:56,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 03:25:56,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 03:25:56,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 03:25:56,086 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 03:25:56,086 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 03:25:56,087 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 03:25:56,088 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 03:25:56,088 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 03:25:56,089 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 03:25:56,090 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 03:25:56,091 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 03:25:56,092 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 03:25:56,092 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 03:25:56,093 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 03:25:56,093 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 03:25:56,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 03:25:56,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 03:25:56,095 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 03:25:56,096 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 03:25:56,097 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 03:25:56,099 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 03:25:56,131 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 03:25:56,131 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 03:25:56,132 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 03:25:56,132 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 03:25:56,133 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 03:25:56,133 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 03:25:56,134 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 03:25:56,134 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 03:25:56,134 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 03:25:56,135 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 03:25:56,135 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 03:25:56,135 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 03:25:56,135 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 03:25:56,136 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 03:25:56,136 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 03:25:56,136 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 03:25:56,136 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 03:25:56,136 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 03:25:56,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 03:25:56,137 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 03:25:56,138 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 03:25:56,138 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 03:25:56,138 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 03:25:56,138 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 03:25:56,138 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 03:25:56,139 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 03:25:56,139 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 03:25:56,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 03:25:56,139 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 03:25:56,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 03:25:56,140 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 03:25:56,141 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 03:25:56,141 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 -> 28ac72543f751666908cbd68a77fa11ffe4dd886016c3996df45b97bb42d5078 [2022-07-13 03:25:56,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 03:25:56,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 03:25:56,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 03:25:56,399 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 03:25:56,400 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 03:25:56,401 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/standard_vararg_ground.i [2022-07-13 03:25:56,453 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7ade8b86/bba9bd5ddf924ef9bb4200596930e725/FLAGe0b55f6bf [2022-07-13 03:25:56,818 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 03:25:56,818 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/standard_vararg_ground.i [2022-07-13 03:25:56,822 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7ade8b86/bba9bd5ddf924ef9bb4200596930e725/FLAGe0b55f6bf [2022-07-13 03:25:56,832 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7ade8b86/bba9bd5ddf924ef9bb4200596930e725 [2022-07-13 03:25:56,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 03:25:56,834 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 03:25:56,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 03:25:56,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 03:25:56,843 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 03:25:56,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:25:56" (1/1) ... [2022-07-13 03:25:56,845 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@727deb08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:25:56, skipping insertion in model container [2022-07-13 03:25:56,846 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:25:56" (1/1) ... [2022-07-13 03:25:56,852 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 03:25:56,865 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 03:25:56,988 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_vararg_ground.i[815,828] [2022-07-13 03:25:57,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:25:57,008 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 03:25:57,018 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_vararg_ground.i[815,828] [2022-07-13 03:25:57,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:25:57,037 INFO L208 MainTranslator]: Completed translation [2022-07-13 03:25:57,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:25:57 WrapperNode [2022-07-13 03:25:57,037 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 03:25:57,038 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 03:25:57,038 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 03:25:57,039 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 03:25:57,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:25:57" (1/1) ... [2022-07-13 03:25:57,052 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:25:57" (1/1) ... [2022-07-13 03:25:57,073 INFO L137 Inliner]: procedures = 16, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2022-07-13 03:25:57,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 03:25:57,075 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 03:25:57,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 03:25:57,075 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 03:25:57,081 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:25:57" (1/1) ... [2022-07-13 03:25:57,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:25:57" (1/1) ... [2022-07-13 03:25:57,092 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:25:57" (1/1) ... [2022-07-13 03:25:57,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:25:57" (1/1) ... [2022-07-13 03:25:57,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:25:57" (1/1) ... [2022-07-13 03:25:57,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:25:57" (1/1) ... [2022-07-13 03:25:57,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:25:57" (1/1) ... [2022-07-13 03:25:57,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 03:25:57,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 03:25:57,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 03:25:57,117 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 03:25:57,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:25:57" (1/1) ... [2022-07-13 03:25:57,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:57,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:57,148 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-13 03:25:57,164 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-13 03:25:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 03:25:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 03:25:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 03:25:57,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 03:25:57,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 03:25:57,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 03:25:57,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 03:25:57,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 03:25:57,228 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 03:25:57,229 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 03:25:57,322 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 03:25:57,327 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 03:25:57,328 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-13 03:25:57,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:25:57 BoogieIcfgContainer [2022-07-13 03:25:57,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 03:25:57,330 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 03:25:57,330 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 03:25:57,333 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 03:25:57,334 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:25:57,334 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 03:25:56" (1/3) ... [2022-07-13 03:25:57,335 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10b63411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:25:57, skipping insertion in model container [2022-07-13 03:25:57,335 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:25:57,335 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:25:57" (2/3) ... [2022-07-13 03:25:57,335 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10b63411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:25:57, skipping insertion in model container [2022-07-13 03:25:57,336 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:25:57,336 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:25:57" (3/3) ... [2022-07-13 03:25:57,337 INFO L354 chiAutomizerObserver]: Analyzing ICFG standard_vararg_ground.i [2022-07-13 03:25:57,396 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 03:25:57,397 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 03:25:57,403 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 03:25:57,403 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 03:25:57,403 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 03:25:57,403 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 03:25:57,403 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 03:25:57,404 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 03:25:57,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:25:57,425 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-07-13 03:25:57,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:25:57,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:25:57,430 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:25:57,430 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:25:57,430 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 03:25:57,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:25:57,444 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-07-13 03:25:57,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:25:57,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:25:57,445 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:25:57,445 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:25:57,452 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(25, 2); 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~post4#1, main_#t~mem3#1, main_#t~mem6#1, main_#t~post5#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 14#L20-3true [2022-07-13 03:25:57,452 INFO L754 eck$LassoCheckResult]: Loop: 14#L20-3true assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 15#L20-2true main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 14#L20-3true [2022-07-13 03:25:57,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:57,457 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-13 03:25:57,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:57,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768635498] [2022-07-13 03:25:57,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:57,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:57,538 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:57,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:57,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:57,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-07-13 03:25:57,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:57,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785073816] [2022-07-13 03:25:57,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:57,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:57,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:57,603 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:57,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:57,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:57,620 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-07-13 03:25:57,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:57,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264946604] [2022-07-13 03:25:57,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:57,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:57,644 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:57,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:57,955 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:25:57,956 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:25:57,957 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:25:57,957 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:25:57,957 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:25:57,957 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:57,958 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:25:57,958 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:25:57,958 INFO L133 ssoRankerPreferences]: Filename of dumped script: standard_vararg_ground.i_Iteration1_Lasso [2022-07-13 03:25:57,958 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:25:57,959 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:25:57,977 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-13 03:25:57,985 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-13 03:25:57,987 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-13 03:25:57,990 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-13 03:25:57,993 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-13 03:25:57,995 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-13 03:25:57,998 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-13 03:25:58,002 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-13 03:25:58,007 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-13 03:25:58,187 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-13 03:25:58,190 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-13 03:25:58,429 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:25:58,433 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:25:58,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:58,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:58,446 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-13 03:25:58,449 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-13 03:25:58,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:58,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:58,457 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:58,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:58,461 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-13 03:25:58,467 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:25:58,467 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:25:58,479 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:58,498 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-13 03:25:58,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:58,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:58,500 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-13 03:25:58,501 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-13 03:25:58,502 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:25:58,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:58,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:58,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:58,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:58,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:58,514 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:58,514 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:58,535 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:58,554 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-13 03:25:58,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:58,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:58,555 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-13 03:25:58,560 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-13 03:25:58,560 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-13 03:25:58,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:58,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:58,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:58,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:58,573 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:25:58,573 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:25:58,585 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:58,603 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-13 03:25:58,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:58,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:58,604 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-13 03:25:58,605 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-13 03:25:58,617 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-13 03:25:58,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:58,623 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:58,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:58,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:58,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:58,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:58,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:58,636 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:58,657 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-13 03:25:58,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:58,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:58,659 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-13 03:25:58,660 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-13 03:25:58,664 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-13 03:25:58,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:58,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:58,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:58,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:58,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:58,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:58,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:58,672 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:58,690 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-13 03:25:58,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:58,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:58,692 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-13 03:25:58,692 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-13 03:25:58,693 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-13 03:25:58,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:58,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:58,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:58,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:58,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:25:58,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:25:58,717 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:58,733 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-13 03:25:58,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:58,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:58,735 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-13 03:25:58,735 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-13 03:25:58,738 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-13 03:25:58,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:58,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:58,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:58,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:58,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:58,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:58,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:58,771 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:58,797 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-13 03:25:58,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:58,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:58,799 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-13 03:25:58,806 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-13 03:25:58,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:58,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:58,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:58,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:58,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:58,815 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:58,815 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:58,823 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-13 03:25:58,831 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:58,848 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-13 03:25:58,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:58,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:58,850 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-13 03:25:58,850 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-13 03:25:58,852 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-13 03:25:58,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:58,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:58,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:58,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:58,861 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:25:58,861 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:25:58,868 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:58,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:58,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:58,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:58,885 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-13 03:25:58,885 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-13 03:25:58,887 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-13 03:25:58,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:58,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:58,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:58,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:58,896 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:25:58,896 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:25:58,906 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:58,931 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-13 03:25:58,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:58,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:58,933 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-13 03:25:58,935 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-13 03:25:58,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-13 03:25:58,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:58,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:58,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:58,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:58,946 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:25:58,946 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:25:58,963 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:58,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-07-13 03:25:58,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:58,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:58,986 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-13 03:25:58,987 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-13 03:25:58,987 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-13 03:25:58,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:58,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:58,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:58,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:58,997 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:25:58,997 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:25:59,014 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:59,030 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-13 03:25:59,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:59,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:59,031 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-13 03:25:59,032 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-13 03:25:59,034 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-13 03:25:59,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:59,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:59,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:59,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:59,044 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:25:59,044 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:25:59,053 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:59,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:59,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:59,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:59,072 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-13 03:25:59,073 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-13 03:25:59,074 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-13 03:25:59,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:59,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:59,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:59,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:59,083 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:25:59,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:25:59,115 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:59,140 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-13 03:25:59,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:59,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:59,142 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-13 03:25:59,150 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-13 03:25:59,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:59,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:59,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:59,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:59,160 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:25:59,160 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:25:59,163 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-13 03:25:59,175 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:59,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:59,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:59,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:59,196 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-13 03:25:59,197 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-13 03:25:59,199 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-13 03:25:59,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:59,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:59,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:59,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:59,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:59,206 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:59,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:59,207 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:59,225 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-13 03:25:59,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:59,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:59,226 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-13 03:25:59,227 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-13 03:25:59,229 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-13 03:25:59,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:59,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:59,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:59,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:59,240 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:25:59,240 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:25:59,263 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:59,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:59,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:59,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:59,289 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-13 03:25:59,295 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-13 03:25:59,295 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-13 03:25:59,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:59,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:59,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:59,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:59,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:25:59,305 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:25:59,311 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:59,326 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-13 03:25:59,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:59,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:59,331 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:59,335 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-13 03:25:59,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-13 03:25:59,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:59,342 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:25:59,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:59,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:59,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:59,342 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:25:59,343 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:25:59,344 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:25:59,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:59,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:59,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:59,361 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:59,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-13 03:25:59,365 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-13 03:25:59,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:25:59,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:25:59,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:25:59,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:25:59,376 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:25:59,376 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:25:59,392 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:25:59,414 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-13 03:25:59,414 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-07-13 03:25:59,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:25:59,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:59,420 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:25:59,452 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:25:59,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-13 03:25:59,469 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-13 03:25:59,469 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:25:59,470 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#aa~0#1.base)_1) = -8*ULTIMATE.start_main_~i~0#1 + 199999*v_rep(select #length ULTIMATE.start_main_~#aa~0#1.base)_1 Supporting invariants [] [2022-07-13 03:25:59,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-13 03:25:59,527 INFO L293 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2022-07-13 03:25:59,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:59,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:25:59,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:25:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:59,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 03:25:59,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:25:59,642 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-13 03:25:59,676 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-13 03:25:59,677 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 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-13 03:25:59,725 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 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 40 states and 56 transitions. Complement of second has 8 states. [2022-07-13 03:25:59,728 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-13 03:25:59,734 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-13 03:25:59,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-07-13 03:25:59,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-13 03:25:59,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:25:59,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-13 03:25:59,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:25:59,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 2 letters. Loop has 4 letters. [2022-07-13 03:25:59,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:25:59,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 56 transitions. [2022-07-13 03:25:59,747 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-13 03:25:59,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 13 states and 16 transitions. [2022-07-13 03:25:59,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-07-13 03:25:59,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-07-13 03:25:59,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2022-07-13 03:25:59,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:25:59,751 INFO L369 hiAutomatonCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-07-13 03:25:59,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2022-07-13 03:25:59,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2022-07-13 03:25:59,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 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-13 03:25:59,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2022-07-13 03:25:59,773 INFO L392 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-07-13 03:25:59,773 INFO L374 stractBuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-07-13 03:25:59,773 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 03:25:59,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2022-07-13 03:25:59,775 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-13 03:25:59,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:25:59,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:25:59,775 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-13 03:25:59,775 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:25:59,776 INFO L752 eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(25, 2); 119#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~post4#1, main_#t~mem3#1, main_#t~mem6#1, main_#t~post5#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 123#L20-3 assume !(main_~i~0#1 < 100000); 116#L25-2 [2022-07-13 03:25:59,776 INFO L754 eck$LassoCheckResult]: Loop: 116#L25-2 call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 117#L25 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 116#L25-2 [2022-07-13 03:25:59,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:59,780 INFO L85 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2022-07-13 03:25:59,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:59,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761418195] [2022-07-13 03:25:59,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:59,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:59,838 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-13 03:25:59,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:25:59,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761418195] [2022-07-13 03:25:59,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761418195] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:25:59,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:25:59,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 03:25:59,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715843320] [2022-07-13 03:25:59,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:25:59,842 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:25:59,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:59,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 1 times [2022-07-13 03:25:59,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:59,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801481357] [2022-07-13 03:25:59,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:59,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:59,848 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:25:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:25:59,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:25:59,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:25:59,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:25:59,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:25:59,882 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. cyclomatic complexity: 6 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-13 03:25:59,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:25:59,893 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-07-13 03:25:59,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:25:59,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2022-07-13 03:25:59,896 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-13 03:25:59,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 15 transitions. [2022-07-13 03:25:59,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-07-13 03:25:59,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-07-13 03:25:59,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2022-07-13 03:25:59,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:25:59,900 INFO L369 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-07-13 03:25:59,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2022-07-13 03:25:59,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2022-07-13 03:25:59,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 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-13 03:25:59,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2022-07-13 03:25:59,903 INFO L392 hiAutomatonCegarLoop]: Abstraction has 12 states and 14 transitions. [2022-07-13 03:25:59,903 INFO L374 stractBuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2022-07-13 03:25:59,903 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 03:25:59,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2022-07-13 03:25:59,904 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-13 03:25:59,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:25:59,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:25:59,904 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-13 03:25:59,904 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:25:59,905 INFO L752 eck$LassoCheckResult]: Stem: 149#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(25, 2); 150#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~post4#1, main_#t~mem3#1, main_#t~mem6#1, main_#t~post5#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 154#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 155#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 156#L20-3 assume !(main_~i~0#1 < 100000); 147#L25-2 [2022-07-13 03:25:59,905 INFO L754 eck$LassoCheckResult]: Loop: 147#L25-2 call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 148#L25 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 147#L25-2 [2022-07-13 03:25:59,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:25:59,905 INFO L85 PathProgramCache]: Analyzing trace with hash 28698723, now seen corresponding path program 1 times [2022-07-13 03:25:59,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:25:59,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187702804] [2022-07-13 03:25:59,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:59,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:25:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:25:59,959 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-13 03:25:59,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:25:59,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187702804] [2022-07-13 03:25:59,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187702804] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:25:59,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851821750] [2022-07-13 03:25:59,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:25:59,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:25:59,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:25:59,968 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-13 03:25:59,979 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-13 03:26:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:00,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 03:26:00,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:00,030 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-13 03:26:00,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:26:00,078 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-13 03:26:00,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851821750] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:26:00,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:26:00,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-07-13 03:26:00,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118438599] [2022-07-13 03:26:00,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:26:00,079 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:26:00,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:00,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 2 times [2022-07-13 03:26:00,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:00,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183310449] [2022-07-13 03:26:00,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:00,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:00,085 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:00,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:00,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:00,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:00,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 03:26:00,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-13 03:26:00,122 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. cyclomatic complexity: 5 Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 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-13 03:26:00,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:00,141 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-07-13 03:26:00,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 03:26:00,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2022-07-13 03:26:00,142 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-13 03:26:00,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 20 transitions. [2022-07-13 03:26:00,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-07-13 03:26:00,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-07-13 03:26:00,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2022-07-13 03:26:00,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:00,143 INFO L369 hiAutomatonCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-07-13 03:26:00,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2022-07-13 03:26:00,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-07-13 03:26:00,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 17 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-13 03:26:00,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-07-13 03:26:00,145 INFO L392 hiAutomatonCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-07-13 03:26:00,145 INFO L374 stractBuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-07-13 03:26:00,145 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 03:26:00,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2022-07-13 03:26:00,146 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-13 03:26:00,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:00,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:00,146 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1] [2022-07-13 03:26:00,146 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:26:00,146 INFO L752 eck$LassoCheckResult]: Stem: 213#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(25, 2); 214#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~post4#1, main_#t~mem3#1, main_#t~mem6#1, main_#t~post5#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 218#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 219#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 220#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 221#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 228#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 227#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 226#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 225#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 224#L20-3 assume !(main_~i~0#1 < 100000); 211#L25-2 [2022-07-13 03:26:00,146 INFO L754 eck$LassoCheckResult]: Loop: 211#L25-2 call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 212#L25 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 211#L25-2 [2022-07-13 03:26:00,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:00,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1081477475, now seen corresponding path program 2 times [2022-07-13 03:26:00,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:00,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791774031] [2022-07-13 03:26:00,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:00,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:00,194 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-13 03:26:00,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:00,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791774031] [2022-07-13 03:26:00,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791774031] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:00,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980019800] [2022-07-13 03:26:00,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 03:26:00,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:00,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:00,196 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-13 03:26:00,218 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-13 03:26:00,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 03:26:00,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:26:00,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 03:26:00,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:00,270 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-13 03:26:00,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:26:00,328 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-13 03:26:00,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980019800] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:26:00,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:26:00,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-07-13 03:26:00,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502829357] [2022-07-13 03:26:00,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:26:00,330 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:26:00,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:00,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 3 times [2022-07-13 03:26:00,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:00,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945085701] [2022-07-13 03:26:00,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:00,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:00,341 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:00,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:00,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:00,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 03:26:00,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-13 03:26:00,382 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 5 Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:00,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:00,427 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-07-13 03:26:00,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 03:26:00,428 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 32 transitions. [2022-07-13 03:26:00,430 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-13 03:26:00,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 32 transitions. [2022-07-13 03:26:00,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-07-13 03:26:00,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-07-13 03:26:00,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 32 transitions. [2022-07-13 03:26:00,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:00,433 INFO L369 hiAutomatonCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-07-13 03:26:00,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 32 transitions. [2022-07-13 03:26:00,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-13 03:26:00,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 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-13 03:26:00,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-07-13 03:26:00,443 INFO L392 hiAutomatonCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-07-13 03:26:00,443 INFO L374 stractBuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-07-13 03:26:00,443 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 03:26:00,443 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 32 transitions. [2022-07-13 03:26:00,444 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-13 03:26:00,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:00,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:00,445 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1] [2022-07-13 03:26:00,445 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:26:00,446 INFO L752 eck$LassoCheckResult]: Stem: 340#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(25, 2); 341#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~post4#1, main_#t~mem3#1, main_#t~mem6#1, main_#t~post5#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 344#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 345#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 346#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 342#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 343#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 364#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 363#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 362#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 361#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 360#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 359#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 358#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 357#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 356#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 355#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 354#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 353#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 352#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 351#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 350#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 349#L20-3 assume !(main_~i~0#1 < 100000); 335#L25-2 [2022-07-13 03:26:00,446 INFO L754 eck$LassoCheckResult]: Loop: 335#L25-2 call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 336#L25 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 335#L25-2 [2022-07-13 03:26:00,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:00,446 INFO L85 PathProgramCache]: Analyzing trace with hash 899905681, now seen corresponding path program 3 times [2022-07-13 03:26:00,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:00,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425754451] [2022-07-13 03:26:00,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:00,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:00,576 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-13 03:26:00,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:00,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425754451] [2022-07-13 03:26:00,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425754451] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:00,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361989173] [2022-07-13 03:26:00,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 03:26:00,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:00,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:00,587 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-13 03:26:00,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-13 03:26:00,679 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-13 03:26:00,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:26:00,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 03:26:00,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:00,727 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-13 03:26:00,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:26:00,932 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-13 03:26:00,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361989173] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:26:00,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:26:00,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2022-07-13 03:26:00,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460260732] [2022-07-13 03:26:00,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:26:00,933 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:26:00,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:00,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 4 times [2022-07-13 03:26:00,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:00,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759824983] [2022-07-13 03:26:00,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:00,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:00,937 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:00,940 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:00,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:00,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-13 03:26:00,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-07-13 03:26:00,970 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. cyclomatic complexity: 5 Second operand has 25 states, 24 states have (on average 2.0) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 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-13 03:26:01,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:01,043 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-07-13 03:26:01,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-13 03:26:01,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 56 transitions. [2022-07-13 03:26:01,048 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-13 03:26:01,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 56 transitions. [2022-07-13 03:26:01,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-07-13 03:26:01,049 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-07-13 03:26:01,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 56 transitions. [2022-07-13 03:26:01,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:01,049 INFO L369 hiAutomatonCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-07-13 03:26:01,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 56 transitions. [2022-07-13 03:26:01,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-07-13 03:26:01,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.037037037037037) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 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-13 03:26:01,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2022-07-13 03:26:01,052 INFO L392 hiAutomatonCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-07-13 03:26:01,052 INFO L374 stractBuchiCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-07-13 03:26:01,052 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 03:26:01,053 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 56 transitions. [2022-07-13 03:26:01,053 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-13 03:26:01,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:01,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:01,054 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [22, 22, 1, 1, 1] [2022-07-13 03:26:01,054 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:26:01,055 INFO L752 eck$LassoCheckResult]: Stem: 581#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(25, 2); 582#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~post4#1, main_#t~mem3#1, main_#t~mem6#1, main_#t~post5#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 586#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 587#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 588#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 589#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 590#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 632#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 631#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 630#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 629#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 628#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 627#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 626#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 625#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 624#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 623#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 622#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 621#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 620#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 619#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 618#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 617#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 616#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 615#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 614#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 613#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 612#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 611#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 610#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 609#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 608#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 607#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 606#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 605#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 604#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 603#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 602#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 601#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 600#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 599#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 598#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 597#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 596#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 595#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 594#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 593#L20-3 assume !(main_~i~0#1 < 100000); 579#L25-2 [2022-07-13 03:26:01,055 INFO L754 eck$LassoCheckResult]: Loop: 579#L25-2 call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 580#L25 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 579#L25-2 [2022-07-13 03:26:01,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:01,055 INFO L85 PathProgramCache]: Analyzing trace with hash -111832455, now seen corresponding path program 4 times [2022-07-13 03:26:01,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:01,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47144612] [2022-07-13 03:26:01,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:01,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:01,409 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-13 03:26:01,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:01,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47144612] [2022-07-13 03:26:01,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47144612] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:01,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901016575] [2022-07-13 03:26:01,410 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 03:26:01,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:01,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:01,415 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:26:01,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-07-13 03:26:01,512 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 03:26:01,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:26:01,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-13 03:26:01,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:01,605 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-13 03:26:01,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:26:02,323 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-13 03:26:02,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901016575] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:26:02,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:26:02,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2022-07-13 03:26:02,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903034501] [2022-07-13 03:26:02,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:26:02,325 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:26:02,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:02,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 5 times [2022-07-13 03:26:02,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:02,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523458437] [2022-07-13 03:26:02,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:02,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:02,329 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:02,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:02,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:02,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-13 03:26:02,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-07-13 03:26:02,371 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. cyclomatic complexity: 5 Second operand has 49 states, 48 states have (on average 2.0) internal successors, (96), 49 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:26:02,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:02,505 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2022-07-13 03:26:02,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-13 03:26:02,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 104 transitions. [2022-07-13 03:26:02,507 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-13 03:26:02,508 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 102 states and 104 transitions. [2022-07-13 03:26:02,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-07-13 03:26:02,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-07-13 03:26:02,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 104 transitions. [2022-07-13 03:26:02,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:02,509 INFO L369 hiAutomatonCegarLoop]: Abstraction has 102 states and 104 transitions. [2022-07-13 03:26:02,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 104 transitions. [2022-07-13 03:26:02,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-13 03:26:02,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 101 states have internal predecessors, (104), 0 states have call successors, (0), 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-13 03:26:02,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2022-07-13 03:26:02,514 INFO L392 hiAutomatonCegarLoop]: Abstraction has 102 states and 104 transitions. [2022-07-13 03:26:02,514 INFO L374 stractBuchiCegarLoop]: Abstraction has 102 states and 104 transitions. [2022-07-13 03:26:02,515 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-13 03:26:02,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 104 transitions. [2022-07-13 03:26:02,515 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-13 03:26:02,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:02,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:02,518 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [46, 46, 1, 1, 1] [2022-07-13 03:26:02,518 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:26:02,518 INFO L752 eck$LassoCheckResult]: Stem: 1068#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(25, 2); 1069#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~post4#1, main_#t~mem3#1, main_#t~mem6#1, main_#t~post5#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 1072#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1073#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1074#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1070#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1071#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1164#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1163#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1162#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1161#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1160#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1159#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1158#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1157#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1156#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1155#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1154#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1153#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1152#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1151#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1150#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1149#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1148#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1147#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1146#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1145#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1144#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1143#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1142#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1141#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1140#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1139#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1138#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1137#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1136#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1135#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1134#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1133#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1132#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1131#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1130#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1129#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1128#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1127#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1126#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1125#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1124#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1123#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1122#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1121#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1120#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1119#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1118#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1117#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1116#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1115#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1114#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1113#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1112#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1111#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1110#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1109#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1108#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1107#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1106#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1105#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1104#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1103#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1102#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1101#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1100#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1099#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1098#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1097#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1096#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1095#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1094#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1093#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1092#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1091#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1090#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1089#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1088#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1087#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1086#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1085#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1084#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1083#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1082#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1081#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1080#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1079#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 1078#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 1077#L20-3 assume !(main_~i~0#1 < 100000); 1063#L25-2 [2022-07-13 03:26:02,518 INFO L754 eck$LassoCheckResult]: Loop: 1063#L25-2 call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 1064#L25 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 1063#L25-2 [2022-07-13 03:26:02,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:02,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1497227703, now seen corresponding path program 5 times [2022-07-13 03:26:02,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:02,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402936598] [2022-07-13 03:26:02,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:02,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:03,507 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-13 03:26:03,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:03,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402936598] [2022-07-13 03:26:03,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402936598] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:03,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671159460] [2022-07-13 03:26:03,508 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 03:26:03,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:03,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:03,512 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:26:03,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-07-13 03:26:22,572 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-07-13 03:26:22,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:26:22,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-13 03:26:22,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:22,755 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-13 03:26:22,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:26:25,256 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-13 03:26:25,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671159460] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:26:25,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:26:25,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 96 [2022-07-13 03:26:25,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832225542] [2022-07-13 03:26:25,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:26:25,258 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:26:25,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:25,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1574, now seen corresponding path program 6 times [2022-07-13 03:26:25,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:25,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442949288] [2022-07-13 03:26:25,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:25,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:25,263 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:25,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:25,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:25,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-07-13 03:26:25,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-07-13 03:26:25,294 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. cyclomatic complexity: 5 Second operand has 97 states, 96 states have (on average 2.0) internal successors, (192), 97 states have internal predecessors, (192), 0 states have call successors, (0), 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-13 03:26:25,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:25,635 INFO L93 Difference]: Finished difference Result 198 states and 200 transitions. [2022-07-13 03:26:25,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-07-13 03:26:25,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 200 transitions. [2022-07-13 03:26:25,637 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-13 03:26:25,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 198 states and 200 transitions. [2022-07-13 03:26:25,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-07-13 03:26:25,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-07-13 03:26:25,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 200 transitions. [2022-07-13 03:26:25,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:25,640 INFO L369 hiAutomatonCegarLoop]: Abstraction has 198 states and 200 transitions. [2022-07-13 03:26:25,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 200 transitions. [2022-07-13 03:26:25,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-07-13 03:26:25,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 198 states have (on average 1.0101010101010102) internal successors, (200), 197 states have internal predecessors, (200), 0 states have call successors, (0), 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-13 03:26:25,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 200 transitions. [2022-07-13 03:26:25,647 INFO L392 hiAutomatonCegarLoop]: Abstraction has 198 states and 200 transitions. [2022-07-13 03:26:25,648 INFO L374 stractBuchiCegarLoop]: Abstraction has 198 states and 200 transitions. [2022-07-13 03:26:25,648 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-13 03:26:25,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 198 states and 200 transitions. [2022-07-13 03:26:25,649 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-07-13 03:26:25,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:25,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:25,655 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [94, 94, 1, 1, 1] [2022-07-13 03:26:25,655 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:26:25,655 INFO L752 eck$LassoCheckResult]: Stem: 2029#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(25, 2); 2030#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~post1#1, main_~i~0#1, main_#t~post4#1, main_#t~mem3#1, main_#t~mem6#1, main_#t~post5#1, main_~#aa~0#1.base, main_~#aa~0#1.offset, main_~a~0#1, main_~x~0#1;call main_~#aa~0#1.base, main_~#aa~0#1.offset := #Ultimate.allocOnStack(400000);main_~a~0#1 := 0;main_~i~0#1 := 0; 2034#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2035#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2036#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2037#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2038#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2224#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2223#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2222#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2221#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2220#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2219#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2218#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2217#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2216#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2215#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2214#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2213#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2212#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2211#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2210#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2209#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2208#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2207#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2206#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2205#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2204#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2203#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2202#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2201#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2200#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2199#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2198#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2197#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2196#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2195#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2194#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2193#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2192#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2191#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2190#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2189#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2188#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2187#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2186#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2185#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2184#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2183#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2182#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2181#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2180#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2179#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2178#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2177#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2176#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2175#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2174#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2173#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2172#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2171#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2170#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2169#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2168#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2167#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2166#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2165#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2164#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2163#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2162#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2161#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2160#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2159#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2158#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2157#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2156#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2155#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2154#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2153#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2152#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2151#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2150#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2149#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2148#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2147#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2146#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2145#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2144#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2143#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2142#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2141#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2140#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2139#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2138#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2137#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2136#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2135#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2134#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2133#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2132#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2131#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2130#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2129#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2128#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2127#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2126#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2125#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2124#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2123#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2122#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2121#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2120#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2119#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2118#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2117#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2116#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2115#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2114#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2113#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2112#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2111#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2110#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2109#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2108#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2107#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2106#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2105#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2104#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2103#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2102#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2101#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2100#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2099#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2098#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2097#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2096#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2095#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2094#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2093#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2092#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2091#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2090#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2089#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2088#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2087#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2086#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2085#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2084#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2083#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2082#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2081#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2080#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2079#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2078#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2077#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2076#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2075#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2074#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2073#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2072#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2071#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2070#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2069#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2068#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2067#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2066#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2065#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2064#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2063#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2062#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2061#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2060#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2059#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2058#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2057#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2056#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2055#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2054#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2053#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2052#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2051#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2050#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2049#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2048#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2047#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2046#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2045#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2044#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2043#L20-3 assume !!(main_~i~0#1 < 100000);call write~int(main_#t~nondet2#1, main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet2#1; 2042#L20-2 main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; 2041#L20-3 assume !(main_~i~0#1 < 100000); 2027#L25-2 [2022-07-13 03:26:25,656 INFO L754 eck$LassoCheckResult]: Loop: 2027#L25-2 call main_#t~mem3#1 := read~int(main_~#aa~0#1.base, main_~#aa~0#1.offset + 4 * main_~a~0#1, 4); 2028#L25 assume !!(main_#t~mem3#1 >= 0);havoc main_#t~mem3#1;main_#t~post4#1 := main_~a~0#1;main_~a~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; 2027#L25-2 [2022-07-13 03:26:25,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:25,656 INFO L85 PathProgramCache]: Analyzing trace with hash 2115802601, now seen corresponding path program 6 times [2022-07-13 03:26:25,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:25,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311821287] [2022-07-13 03:26:25,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:25,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:28,944 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-13 03:26:28,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:28,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311821287] [2022-07-13 03:26:28,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311821287] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:28,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348989677] [2022-07-13 03:26:28,945 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-13 03:26:28,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:28,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:28,946 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:26:28,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process