./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 35987657 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/termination-memory-alloca/a.06-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 0e00bd958aa9fbd5730471fb19c0f431fb9410b6f9738fcfd6ac5e9594f9dc7f --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 01:38:01,981 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 01:38:01,983 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 01:38:02,019 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 01:38:02,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 01:38:02,021 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 01:38:02,026 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 01:38:02,029 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 01:38:02,031 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 01:38:02,035 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 01:38:02,046 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 01:38:02,051 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 01:38:02,051 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 01:38:02,053 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 01:38:02,055 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 01:38:02,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 01:38:02,057 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 01:38:02,059 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 01:38:02,062 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 01:38:02,067 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 01:38:02,069 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 01:38:02,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 01:38:02,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 01:38:02,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 01:38:02,075 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 01:38:02,081 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 01:38:02,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 01:38:02,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 01:38:02,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 01:38:02,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 01:38:02,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 01:38:02,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 01:38:02,086 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 01:38:02,087 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 01:38:02,088 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 01:38:02,089 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 01:38:02,090 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 01:38:02,090 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 01:38:02,090 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 01:38:02,091 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 01:38:02,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 01:38:02,093 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 01:38:02,098 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-22 01:38:02,133 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 01:38:02,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 01:38:02,135 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 01:38:02,135 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 01:38:02,136 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 01:38:02,136 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 01:38:02,137 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 01:38:02,137 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 01:38:02,137 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 01:38:02,138 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 01:38:02,138 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 01:38:02,139 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 01:38:02,139 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 01:38:02,139 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 01:38:02,139 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 01:38:02,140 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 01:38:02,140 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 01:38:02,140 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 01:38:02,140 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 01:38:02,141 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 01:38:02,141 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 01:38:02,141 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 01:38:02,141 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 01:38:02,141 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 01:38:02,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 01:38:02,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 01:38:02,142 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 01:38:02,142 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 01:38:02,145 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 01:38:02,145 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0e00bd958aa9fbd5730471fb19c0f431fb9410b6f9738fcfd6ac5e9594f9dc7f [2022-07-22 01:38:02,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 01:38:02,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 01:38:02,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 01:38:02,495 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 01:38:02,496 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 01:38:02,498 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i [2022-07-22 01:38:02,555 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e666bf2a/cf74d683e3ba45cdaa46be543b51bd83/FLAGae3a3c0c0 [2022-07-22 01:38:03,002 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 01:38:03,002 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/a.06-alloca.i [2022-07-22 01:38:03,035 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e666bf2a/cf74d683e3ba45cdaa46be543b51bd83/FLAGae3a3c0c0 [2022-07-22 01:38:03,541 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e666bf2a/cf74d683e3ba45cdaa46be543b51bd83 [2022-07-22 01:38:03,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 01:38:03,545 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 01:38:03,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 01:38:03,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 01:38:03,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 01:38:03,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:38:03" (1/1) ... [2022-07-22 01:38:03,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40e10cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:03, skipping insertion in model container [2022-07-22 01:38:03,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:38:03" (1/1) ... [2022-07-22 01:38:03,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 01:38:03,601 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 01:38:03,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:38:03,857 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 01:38:03,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:38:03,918 INFO L208 MainTranslator]: Completed translation [2022-07-22 01:38:03,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:03 WrapperNode [2022-07-22 01:38:03,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 01:38:03,920 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 01:38:03,920 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 01:38:03,920 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 01:38:03,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:03" (1/1) ... [2022-07-22 01:38:03,950 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:03" (1/1) ... [2022-07-22 01:38:03,982 INFO L137 Inliner]: procedures = 111, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 120 [2022-07-22 01:38:03,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 01:38:03,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 01:38:03,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 01:38:03,985 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 01:38:03,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:03" (1/1) ... [2022-07-22 01:38:03,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:03" (1/1) ... [2022-07-22 01:38:04,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:03" (1/1) ... [2022-07-22 01:38:04,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:03" (1/1) ... [2022-07-22 01:38:04,021 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:03" (1/1) ... [2022-07-22 01:38:04,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:03" (1/1) ... [2022-07-22 01:38:04,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:03" (1/1) ... [2022-07-22 01:38:04,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 01:38:04,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 01:38:04,036 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 01:38:04,036 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 01:38:04,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:03" (1/1) ... [2022-07-22 01:38:04,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:04,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:04,065 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-22 01:38:04,071 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-22 01:38:04,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 01:38:04,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 01:38:04,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 01:38:04,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 01:38:04,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 01:38:04,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 01:38:04,271 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 01:38:04,273 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 01:38:04,542 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 01:38:04,547 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 01:38:04,549 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 01:38:04,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:38:04 BoogieIcfgContainer [2022-07-22 01:38:04,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 01:38:04,554 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 01:38:04,554 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 01:38:04,556 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 01:38:04,557 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:38:04,557 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 01:38:03" (1/3) ... [2022-07-22 01:38:04,558 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a8b7070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:38:04, skipping insertion in model container [2022-07-22 01:38:04,558 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:38:04,558 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:38:03" (2/3) ... [2022-07-22 01:38:04,559 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a8b7070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:38:04, skipping insertion in model container [2022-07-22 01:38:04,559 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:38:04,559 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:38:04" (3/3) ... [2022-07-22 01:38:04,560 INFO L354 chiAutomizerObserver]: Analyzing ICFG a.06-alloca.i [2022-07-22 01:38:04,616 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 01:38:04,616 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 01:38:04,616 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 01:38:04,617 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 01:38:04,617 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 01:38:04,617 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 01:38:04,617 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 01:38:04,617 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 01:38:04,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:38:04,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-22 01:38:04,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:38:04,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:38:04,647 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:38:04,647 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:38:04,648 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 01:38:04,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:38:04,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-22 01:38:04,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:38:04,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:38:04,651 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:38:04,651 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:38:04,657 INFO L752 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~ret29#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~short13#1, test_fun_#t~short14#1, test_fun_#t~mem17#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~short18#1, test_fun_#t~mem19#1, test_fun_#t~short20#1, test_fun_#t~mem21#1, test_fun_#t~short22#1, test_fun_#t~mem25#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 19#L557-20true [2022-07-22 01:38:04,658 INFO L754 eck$LassoCheckResult]: Loop: 19#L557-20true call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 17#L557-1true assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 2147483647 - test_fun_#t~mem7#1; 16#L557-3true test_fun_#t~short14#1 := test_fun_#t~short9#1; 8#L557-4true assume test_fun_#t~short14#1; 15#L557-9true test_fun_#t~short18#1 := test_fun_#t~short14#1; 14#L557-10true assume !test_fun_#t~short18#1; 12#L557-12true test_fun_#t~short20#1 := test_fun_#t~short18#1; 18#L557-13true assume test_fun_#t~short20#1;call test_fun_#t~mem19#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short20#1 := test_fun_#t~mem19#1 < 2147483647; 10#L557-15true test_fun_#t~short22#1 := test_fun_#t~short20#1; 6#L557-16true assume test_fun_#t~short22#1;call test_fun_#t~mem21#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short22#1 := test_fun_#t~mem21#1 < 2147483647; 20#L557-18true assume !!test_fun_#t~short22#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~short14#1;havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~mem16#1;havoc test_fun_#t~short18#1;havoc test_fun_#t~mem19#1;havoc test_fun_#t~short20#1;havoc test_fun_#t~mem21#1;havoc test_fun_#t~short22#1;call test_fun_#t~mem23#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem23#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;call test_fun_#t~mem24#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem24#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);havoc test_fun_#t~mem24#1; 19#L557-20true [2022-07-22 01:38:04,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:04,663 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-22 01:38:04,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:04,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66864772] [2022-07-22 01:38:04,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:04,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:04,886 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:38:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:04,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:38:04,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:04,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1442805661, now seen corresponding path program 1 times [2022-07-22 01:38:04,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:04,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563055569] [2022-07-22 01:38:04,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:04,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:38:05,034 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-22 01:38:05,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:38:05,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563055569] [2022-07-22 01:38:05,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563055569] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:38:05,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:38:05,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 01:38:05,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708849735] [2022-07-22 01:38:05,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:38:05,040 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:38:05,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:38:05,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 01:38:05,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 01:38:05,074 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-22 01:38:05,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:38:05,130 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-07-22 01:38:05,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 01:38:05,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2022-07-22 01:38:05,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2022-07-22 01:38:05,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 22 states and 30 transitions. [2022-07-22 01:38:05,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2022-07-22 01:38:05,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2022-07-22 01:38:05,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2022-07-22 01:38:05,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:38:05,147 INFO L369 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-07-22 01:38:05,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2022-07-22 01:38:05,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2022-07-22 01:38:05,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-22 01:38:05,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2022-07-22 01:38:05,165 INFO L392 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-07-22 01:38:05,165 INFO L374 stractBuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-07-22 01:38:05,166 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 01:38:05,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2022-07-22 01:38:05,167 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2022-07-22 01:38:05,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:38:05,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:38:05,167 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 01:38:05,168 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:38:05,168 INFO L752 eck$LassoCheckResult]: Stem: 61#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 62#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~ret29#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~short13#1, test_fun_#t~short14#1, test_fun_#t~mem17#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~short18#1, test_fun_#t~mem19#1, test_fun_#t~short20#1, test_fun_#t~mem21#1, test_fun_#t~short22#1, test_fun_#t~mem25#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 65#L557-20 [2022-07-22 01:38:05,168 INFO L754 eck$LassoCheckResult]: Loop: 65#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 74#L557-1 assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 2147483647 - test_fun_#t~mem7#1; 73#L557-3 test_fun_#t~short14#1 := test_fun_#t~short9#1; 66#L557-4 assume test_fun_#t~short14#1; 67#L557-9 test_fun_#t~short18#1 := test_fun_#t~short14#1; 72#L557-10 assume test_fun_#t~short18#1;call test_fun_#t~mem17#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem16#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short18#1 := test_fun_#t~mem17#1 > test_fun_#t~mem15#1 + test_fun_#t~mem16#1; 70#L557-12 test_fun_#t~short20#1 := test_fun_#t~short18#1; 71#L557-13 assume test_fun_#t~short20#1;call test_fun_#t~mem19#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short20#1 := test_fun_#t~mem19#1 < 2147483647; 69#L557-15 test_fun_#t~short22#1 := test_fun_#t~short20#1; 63#L557-16 assume test_fun_#t~short22#1;call test_fun_#t~mem21#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short22#1 := test_fun_#t~mem21#1 < 2147483647; 64#L557-18 assume !!test_fun_#t~short22#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~short14#1;havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~mem16#1;havoc test_fun_#t~short18#1;havoc test_fun_#t~mem19#1;havoc test_fun_#t~short20#1;havoc test_fun_#t~mem21#1;havoc test_fun_#t~short22#1;call test_fun_#t~mem23#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem23#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;call test_fun_#t~mem24#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem24#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);havoc test_fun_#t~mem24#1; 65#L557-20 [2022-07-22 01:38:05,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:05,169 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-22 01:38:05,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:05,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215081362] [2022-07-22 01:38:05,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:05,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:05,207 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:38:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:05,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:38:05,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:05,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1500063963, now seen corresponding path program 1 times [2022-07-22 01:38:05,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:05,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633004115] [2022-07-22 01:38:05,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:05,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:05,248 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:38:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:05,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:38:05,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:05,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1876539869, now seen corresponding path program 1 times [2022-07-22 01:38:05,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:05,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58280102] [2022-07-22 01:38:05,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:05,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:05,353 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:38:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:05,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:38:06,921 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:38:06,921 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:38:06,922 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:38:06,922 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:38:06,922 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:38:06,922 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:06,922 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:38:06,922 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:38:06,923 INFO L133 ssoRankerPreferences]: Filename of dumped script: a.06-alloca.i_Iteration2_Lasso [2022-07-22 01:38:06,923 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:38:06,923 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:38:06,942 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-22 01:38:06,947 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-22 01:38:06,949 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-22 01:38:06,951 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-22 01:38:06,953 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-22 01:38:06,955 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-22 01:38:06,958 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-22 01:38:06,962 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-22 01:38:06,966 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-22 01:38:06,968 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-22 01:38:06,970 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-22 01:38:06,972 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-22 01:38:06,975 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-22 01:38:06,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-22 01:38:06,980 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-22 01:38:07,788 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-22 01:38:07,790 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-22 01:38:07,793 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-22 01:38:07,795 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-22 01:38:07,797 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-22 01:38:07,799 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-22 01:38:07,800 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-22 01:38:07,802 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-22 01:38:07,804 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-22 01:38:07,806 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-22 01:38:07,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:07,810 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-22 01:38:07,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:07,814 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-22 01:38:08,305 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:38:08,308 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:38:08,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:08,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:08,314 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-22 01:38:08,315 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-22 01:38:08,316 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-22 01:38:08,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:08,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:38:08,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:08,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:08,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:08,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:38:08,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:38:08,331 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:08,348 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-22 01:38:08,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:08,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:08,350 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-22 01:38:08,351 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-22 01:38:08,352 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-22 01:38:08,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:08,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:38:08,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:08,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:08,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:08,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:38:08,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:38:08,369 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:08,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-07-22 01:38:08,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:08,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:08,388 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-22 01:38:08,389 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-22 01:38:08,390 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-22 01:38:08,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:08,397 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:38:08,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:08,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:08,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:08,398 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:38:08,398 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:38:08,409 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:08,437 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-22 01:38:08,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:08,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:08,438 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-22 01:38:08,439 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-22 01:38:08,441 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-22 01:38:08,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:08,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:38:08,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:08,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:08,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:08,450 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:38:08,450 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:38:08,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:08,487 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-22 01:38:08,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:08,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:08,489 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-22 01:38:08,490 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-22 01:38:08,490 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-22 01:38:08,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:08,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:38:08,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:08,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:08,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:08,498 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:38:08,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:38:08,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:08,521 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-22 01:38:08,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:08,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:08,522 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-22 01:38:08,523 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-22 01:38:08,527 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-22 01:38:08,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:08,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:38:08,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:08,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:08,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:08,535 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:38:08,535 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:38:08,540 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:08,558 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-22 01:38:08,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:08,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:08,560 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-22 01:38:08,561 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-22 01:38:08,562 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-22 01:38:08,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:08,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:08,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:08,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:08,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:38:08,572 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:38:08,591 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:08,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-07-22 01:38:08,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:08,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:08,614 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-22 01:38:08,615 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-22 01:38:08,616 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-22 01:38:08,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:08,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:08,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:08,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:08,625 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:38:08,625 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:38:08,638 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:08,665 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-22 01:38:08,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:08,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:08,669 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-22 01:38:08,670 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-22 01:38:08,671 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-22 01:38:08,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:08,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:38:08,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:08,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:08,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:08,680 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:38:08,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:38:08,694 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:08,721 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-22 01:38:08,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:08,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:08,724 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-22 01:38:08,741 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-22 01:38:08,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:08,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:38:08,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:08,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:08,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:08,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:38:08,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:38:08,754 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-22 01:38:08,756 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:08,772 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-22 01:38:08,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:08,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:08,774 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-22 01:38:08,775 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-22 01:38:08,776 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-22 01:38:08,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:08,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:38:08,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:08,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:08,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:08,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:38:08,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:38:08,803 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:08,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 01:38:08,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:08,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:08,832 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-22 01:38:08,835 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-22 01:38:08,838 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-22 01:38:08,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:08,846 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:38:08,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:08,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:08,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:08,847 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:38:08,847 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:38:08,863 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:08,890 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-22 01:38:08,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:08,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:08,892 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-22 01:38:08,898 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-22 01:38:08,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:08,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:38:08,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:08,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:08,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:08,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:38:08,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:38:08,908 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-22 01:38:08,919 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:08,946 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-22 01:38:08,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:08,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:08,948 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-22 01:38:08,956 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-22 01:38:08,963 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-22 01:38:08,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:08,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:08,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:08,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:08,965 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:38:08,965 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:38:08,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:08,983 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-22 01:38:08,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:08,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:08,985 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-22 01:38:08,986 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-22 01:38:08,988 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-22 01:38:08,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:08,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:08,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:08,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:09,008 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:38:09,009 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:38:09,020 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:38:09,056 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-07-22 01:38:09,056 INFO L444 ModelExtractionUtils]: 13 out of 40 variables were initially zero. Simplification set additionally 24 variables to zero. [2022-07-22 01:38:09,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:09,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:09,080 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-22 01:38:09,095 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:38:09,103 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-22 01:38:09,117 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 01:38:09,117 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:38:09,117 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0#1.base) ULTIMATE.start_test_fun_~z_ref~0#1.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0#1.base) ULTIMATE.start_test_fun_~z_ref~0#1.offset)_1 + 4294967293 Supporting invariants [] [2022-07-22 01:38:09,145 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-22 01:38:09,294 INFO L293 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2022-07-22 01:38:09,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:38:09,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:38:09,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:38:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:38:09,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-22 01:38:09,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:38:09,480 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-22 01:38:09,644 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-22 01:38:09,647 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2022-07-22 01:38:09,648 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 7 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:38:09,825 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 7. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 73 states and 101 transitions. Complement of second has 12 states. [2022-07-22 01:38:09,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2022-07-22 01:38:09,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:38:09,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-07-22 01:38:09,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 2 letters. Loop has 11 letters. [2022-07-22 01:38:09,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:38:09,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 13 letters. Loop has 11 letters. [2022-07-22 01:38:09,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:38:09,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 48 transitions. Stem has 2 letters. Loop has 22 letters. [2022-07-22 01:38:09,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:38:09,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 101 transitions. [2022-07-22 01:38:09,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2022-07-22 01:38:09,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 66 states and 92 transitions. [2022-07-22 01:38:09,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2022-07-22 01:38:09,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2022-07-22 01:38:09,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 92 transitions. [2022-07-22 01:38:09,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:38:09,848 INFO L369 hiAutomatonCegarLoop]: Abstraction has 66 states and 92 transitions. [2022-07-22 01:38:09,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 92 transitions. [2022-07-22 01:38:09,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 45. [2022-07-22 01:38:09,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 44 states have internal predecessors, (62), 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-22 01:38:09,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 62 transitions. [2022-07-22 01:38:09,859 INFO L392 hiAutomatonCegarLoop]: Abstraction has 45 states and 62 transitions. [2022-07-22 01:38:09,859 INFO L374 stractBuchiCegarLoop]: Abstraction has 45 states and 62 transitions. [2022-07-22 01:38:09,859 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 01:38:09,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 62 transitions. [2022-07-22 01:38:09,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2022-07-22 01:38:09,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:38:09,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:38:09,862 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 01:38:09,862 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:38:09,862 INFO L752 eck$LassoCheckResult]: Stem: 376#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 377#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~ret29#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~short13#1, test_fun_#t~short14#1, test_fun_#t~mem17#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~short18#1, test_fun_#t~mem19#1, test_fun_#t~short20#1, test_fun_#t~mem21#1, test_fun_#t~short22#1, test_fun_#t~mem25#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 382#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 401#L557-1 [2022-07-22 01:38:09,862 INFO L754 eck$LassoCheckResult]: Loop: 401#L557-1 assume !test_fun_#t~short9#1; 397#L557-3 test_fun_#t~short14#1 := test_fun_#t~short9#1; 398#L557-4 assume test_fun_#t~short14#1; 416#L557-9 test_fun_#t~short18#1 := test_fun_#t~short14#1; 394#L557-10 assume test_fun_#t~short18#1;call test_fun_#t~mem17#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem16#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short18#1 := test_fun_#t~mem17#1 > test_fun_#t~mem15#1 + test_fun_#t~mem16#1; 390#L557-12 test_fun_#t~short20#1 := test_fun_#t~short18#1; 391#L557-13 assume test_fun_#t~short20#1;call test_fun_#t~mem19#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short20#1 := test_fun_#t~mem19#1 < 2147483647; 388#L557-15 test_fun_#t~short22#1 := test_fun_#t~short20#1; 378#L557-16 assume test_fun_#t~short22#1;call test_fun_#t~mem21#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short22#1 := test_fun_#t~mem21#1 < 2147483647; 379#L557-18 assume !!test_fun_#t~short22#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~short14#1;havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~mem16#1;havoc test_fun_#t~short18#1;havoc test_fun_#t~mem19#1;havoc test_fun_#t~short20#1;havoc test_fun_#t~mem21#1;havoc test_fun_#t~short22#1;call test_fun_#t~mem23#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem23#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;call test_fun_#t~mem24#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem24#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);havoc test_fun_#t~mem24#1; 405#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 401#L557-1 [2022-07-22 01:38:09,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:09,863 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2022-07-22 01:38:09,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:09,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126342535] [2022-07-22 01:38:09,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:09,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:09,927 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:38:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:09,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:38:09,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:09,943 INFO L85 PathProgramCache]: Analyzing trace with hash 962628681, now seen corresponding path program 1 times [2022-07-22 01:38:09,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:09,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639878129] [2022-07-22 01:38:09,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:09,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:38:09,969 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-22 01:38:09,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:38:09,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639878129] [2022-07-22 01:38:09,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639878129] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:38:09,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:38:09,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 01:38:09,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097727798] [2022-07-22 01:38:09,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:38:09,971 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:38:09,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:38:09,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 01:38:09,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 01:38:09,972 INFO L87 Difference]: Start difference. First operand 45 states and 62 transitions. cyclomatic complexity: 19 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-22 01:38:09,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:38:09,998 INFO L93 Difference]: Finished difference Result 59 states and 82 transitions. [2022-07-22 01:38:09,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 01:38:09,999 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 82 transitions. [2022-07-22 01:38:10,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2022-07-22 01:38:10,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 59 states and 82 transitions. [2022-07-22 01:38:10,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2022-07-22 01:38:10,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2022-07-22 01:38:10,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 82 transitions. [2022-07-22 01:38:10,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:38:10,001 INFO L369 hiAutomatonCegarLoop]: Abstraction has 59 states and 82 transitions. [2022-07-22 01:38:10,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 82 transitions. [2022-07-22 01:38:10,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2022-07-22 01:38:10,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:38:10,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2022-07-22 01:38:10,004 INFO L392 hiAutomatonCegarLoop]: Abstraction has 39 states and 54 transitions. [2022-07-22 01:38:10,005 INFO L374 stractBuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2022-07-22 01:38:10,005 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 01:38:10,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 54 transitions. [2022-07-22 01:38:10,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-22 01:38:10,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:38:10,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:38:10,006 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 01:38:10,006 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:38:10,006 INFO L752 eck$LassoCheckResult]: Stem: 489#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 490#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~ret29#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~short13#1, test_fun_#t~short14#1, test_fun_#t~mem17#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~short18#1, test_fun_#t~mem19#1, test_fun_#t~short20#1, test_fun_#t~mem21#1, test_fun_#t~short22#1, test_fun_#t~mem25#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 495#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 510#L557-1 [2022-07-22 01:38:10,006 INFO L754 eck$LassoCheckResult]: Loop: 510#L557-1 assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 2147483647 - test_fun_#t~mem7#1; 508#L557-3 test_fun_#t~short14#1 := test_fun_#t~short9#1; 496#L557-4 assume !test_fun_#t~short14#1;call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short13#1 := test_fun_#t~mem10#1 < 0; 497#L557-6 assume test_fun_#t~short13#1;call test_fun_#t~mem12#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short13#1 := test_fun_#t~mem12#1 > -2147483648 - test_fun_#t~mem11#1; 485#L557-8 test_fun_#t~short14#1 := test_fun_#t~short13#1; 486#L557-9 test_fun_#t~short18#1 := test_fun_#t~short14#1; 506#L557-10 assume !test_fun_#t~short18#1; 502#L557-12 test_fun_#t~short20#1 := test_fun_#t~short18#1; 503#L557-13 assume test_fun_#t~short20#1;call test_fun_#t~mem19#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short20#1 := test_fun_#t~mem19#1 < 2147483647; 500#L557-15 test_fun_#t~short22#1 := test_fun_#t~short20#1; 491#L557-16 assume test_fun_#t~short22#1;call test_fun_#t~mem21#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short22#1 := test_fun_#t~mem21#1 < 2147483647; 492#L557-18 assume !!test_fun_#t~short22#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~short14#1;havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~mem16#1;havoc test_fun_#t~short18#1;havoc test_fun_#t~mem19#1;havoc test_fun_#t~short20#1;havoc test_fun_#t~mem21#1;havoc test_fun_#t~short22#1;call test_fun_#t~mem23#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem23#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;call test_fun_#t~mem24#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem24#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);havoc test_fun_#t~mem24#1; 513#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 510#L557-1 [2022-07-22 01:38:10,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:10,007 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2022-07-22 01:38:10,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:10,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230936145] [2022-07-22 01:38:10,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:10,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:10,026 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:38:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:10,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:38:10,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:10,053 INFO L85 PathProgramCache]: Analyzing trace with hash 623036047, now seen corresponding path program 1 times [2022-07-22 01:38:10,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:10,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656662340] [2022-07-22 01:38:10,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:10,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:38:10,078 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-22 01:38:10,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:38:10,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656662340] [2022-07-22 01:38:10,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656662340] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:38:10,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:38:10,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 01:38:10,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607624728] [2022-07-22 01:38:10,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:38:10,080 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:38:10,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:38:10,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 01:38:10,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 01:38:10,081 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. cyclomatic complexity: 17 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:38:10,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:38:10,106 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2022-07-22 01:38:10,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 01:38:10,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 78 transitions. [2022-07-22 01:38:10,108 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2022-07-22 01:38:10,108 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 78 transitions. [2022-07-22 01:38:10,108 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-07-22 01:38:10,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-07-22 01:38:10,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 78 transitions. [2022-07-22 01:38:10,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:38:10,109 INFO L369 hiAutomatonCegarLoop]: Abstraction has 58 states and 78 transitions. [2022-07-22 01:38:10,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 78 transitions. [2022-07-22 01:38:10,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 43. [2022-07-22 01:38:10,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 42 states have internal predecessors, (58), 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-22 01:38:10,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2022-07-22 01:38:10,112 INFO L392 hiAutomatonCegarLoop]: Abstraction has 43 states and 58 transitions. [2022-07-22 01:38:10,112 INFO L374 stractBuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2022-07-22 01:38:10,113 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 01:38:10,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 58 transitions. [2022-07-22 01:38:10,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2022-07-22 01:38:10,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:38:10,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:38:10,114 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 01:38:10,114 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:38:10,114 INFO L752 eck$LassoCheckResult]: Stem: 595#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 596#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~ret29#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~short13#1, test_fun_#t~short14#1, test_fun_#t~mem17#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~short18#1, test_fun_#t~mem19#1, test_fun_#t~short20#1, test_fun_#t~mem21#1, test_fun_#t~short22#1, test_fun_#t~mem25#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 601#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 621#L557-1 [2022-07-22 01:38:10,114 INFO L754 eck$LassoCheckResult]: Loop: 621#L557-1 assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 2147483647 - test_fun_#t~mem7#1; 618#L557-3 test_fun_#t~short14#1 := test_fun_#t~short9#1; 602#L557-4 assume !test_fun_#t~short14#1;call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short13#1 := test_fun_#t~mem10#1 < 0; 603#L557-6 assume test_fun_#t~short13#1;call test_fun_#t~mem12#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short13#1 := test_fun_#t~mem12#1 > -2147483648 - test_fun_#t~mem11#1; 591#L557-8 test_fun_#t~short14#1 := test_fun_#t~short13#1; 592#L557-9 test_fun_#t~short18#1 := test_fun_#t~short14#1; 612#L557-10 assume test_fun_#t~short18#1;call test_fun_#t~mem17#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem16#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short18#1 := test_fun_#t~mem17#1 > test_fun_#t~mem15#1 + test_fun_#t~mem16#1; 608#L557-12 test_fun_#t~short20#1 := test_fun_#t~short18#1; 609#L557-13 assume test_fun_#t~short20#1;call test_fun_#t~mem19#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short20#1 := test_fun_#t~mem19#1 < 2147483647; 606#L557-15 test_fun_#t~short22#1 := test_fun_#t~short20#1; 597#L557-16 assume test_fun_#t~short22#1;call test_fun_#t~mem21#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short22#1 := test_fun_#t~mem21#1 < 2147483647; 598#L557-18 assume !!test_fun_#t~short22#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~short14#1;havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~mem16#1;havoc test_fun_#t~short18#1;havoc test_fun_#t~mem19#1;havoc test_fun_#t~short20#1;havoc test_fun_#t~mem21#1;havoc test_fun_#t~short22#1;call test_fun_#t~mem23#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem23#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;call test_fun_#t~mem24#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem24#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);havoc test_fun_#t~mem24#1; 626#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 621#L557-1 [2022-07-22 01:38:10,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:10,115 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 3 times [2022-07-22 01:38:10,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:10,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18648555] [2022-07-22 01:38:10,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:10,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:10,136 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:38:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:10,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:38:10,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:10,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1151971315, now seen corresponding path program 1 times [2022-07-22 01:38:10,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:10,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915617662] [2022-07-22 01:38:10,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:10,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:38:10,236 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-22 01:38:10,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:38:10,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915617662] [2022-07-22 01:38:10,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915617662] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:38:10,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:38:10,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 01:38:10,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978790143] [2022-07-22 01:38:10,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:38:10,239 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:38:10,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:38:10,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 01:38:10,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 01:38:10,240 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. cyclomatic complexity: 17 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:38:10,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:38:10,454 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-07-22 01:38:10,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 01:38:10,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 140 transitions. [2022-07-22 01:38:10,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2022-07-22 01:38:10,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 87 states and 107 transitions. [2022-07-22 01:38:10,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2022-07-22 01:38:10,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2022-07-22 01:38:10,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 107 transitions. [2022-07-22 01:38:10,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:38:10,458 INFO L369 hiAutomatonCegarLoop]: Abstraction has 87 states and 107 transitions. [2022-07-22 01:38:10,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 107 transitions. [2022-07-22 01:38:10,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 47. [2022-07-22 01:38:10,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 46 states have internal predecessors, (59), 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-22 01:38:10,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2022-07-22 01:38:10,461 INFO L392 hiAutomatonCegarLoop]: Abstraction has 47 states and 59 transitions. [2022-07-22 01:38:10,461 INFO L374 stractBuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2022-07-22 01:38:10,461 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 01:38:10,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 59 transitions. [2022-07-22 01:38:10,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2022-07-22 01:38:10,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:38:10,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:38:10,462 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 01:38:10,462 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:38:10,462 INFO L752 eck$LassoCheckResult]: Stem: 780#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 781#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~ret29#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~short13#1, test_fun_#t~short14#1, test_fun_#t~mem17#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~short18#1, test_fun_#t~mem19#1, test_fun_#t~short20#1, test_fun_#t~mem21#1, test_fun_#t~short22#1, test_fun_#t~mem25#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 786#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 806#L557-1 [2022-07-22 01:38:10,462 INFO L754 eck$LassoCheckResult]: Loop: 806#L557-1 assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 2147483647 - test_fun_#t~mem7#1; 803#L557-3 test_fun_#t~short14#1 := test_fun_#t~short9#1; 804#L557-4 assume !test_fun_#t~short14#1;call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short13#1 := test_fun_#t~mem10#1 < 0; 793#L557-6 assume !test_fun_#t~short13#1; 776#L557-8 test_fun_#t~short14#1 := test_fun_#t~short13#1; 777#L557-9 test_fun_#t~short18#1 := test_fun_#t~short14#1; 799#L557-10 assume !test_fun_#t~short18#1; 800#L557-12 test_fun_#t~short20#1 := test_fun_#t~short18#1; 810#L557-13 assume !test_fun_#t~short20#1; 791#L557-15 test_fun_#t~short22#1 := test_fun_#t~short20#1; 782#L557-16 assume test_fun_#t~short22#1;call test_fun_#t~mem21#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short22#1 := test_fun_#t~mem21#1 < 2147483647; 783#L557-18 assume !!test_fun_#t~short22#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~short14#1;havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~mem16#1;havoc test_fun_#t~short18#1;havoc test_fun_#t~mem19#1;havoc test_fun_#t~short20#1;havoc test_fun_#t~mem21#1;havoc test_fun_#t~short22#1;call test_fun_#t~mem23#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem23#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;call test_fun_#t~mem24#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem24#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);havoc test_fun_#t~mem24#1; 811#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 806#L557-1 [2022-07-22 01:38:10,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:10,463 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 4 times [2022-07-22 01:38:10,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:10,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812355161] [2022-07-22 01:38:10,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:10,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:10,505 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:38:10,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:10,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:38:10,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:10,527 INFO L85 PathProgramCache]: Analyzing trace with hash 231856079, now seen corresponding path program 1 times [2022-07-22 01:38:10,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:10,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865500929] [2022-07-22 01:38:10,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:10,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:38:10,553 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-22 01:38:10,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:38:10,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865500929] [2022-07-22 01:38:10,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865500929] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:38:10,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:38:10,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 01:38:10,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111906494] [2022-07-22 01:38:10,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:38:10,555 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:38:10,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:38:10,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 01:38:10,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 01:38:10,556 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. cyclomatic complexity: 14 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:38:10,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:38:10,575 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-07-22 01:38:10,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 01:38:10,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 62 transitions. [2022-07-22 01:38:10,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-07-22 01:38:10,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 43 states and 50 transitions. [2022-07-22 01:38:10,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-07-22 01:38:10,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-07-22 01:38:10,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 50 transitions. [2022-07-22 01:38:10,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:38:10,579 INFO L369 hiAutomatonCegarLoop]: Abstraction has 43 states and 50 transitions. [2022-07-22 01:38:10,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 50 transitions. [2022-07-22 01:38:10,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-22 01:38:10,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 42 states have internal predecessors, (50), 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-22 01:38:10,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2022-07-22 01:38:10,583 INFO L392 hiAutomatonCegarLoop]: Abstraction has 43 states and 50 transitions. [2022-07-22 01:38:10,583 INFO L374 stractBuchiCegarLoop]: Abstraction has 43 states and 50 transitions. [2022-07-22 01:38:10,583 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 01:38:10,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 50 transitions. [2022-07-22 01:38:10,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-07-22 01:38:10,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:38:10,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:38:10,584 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 01:38:10,585 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:38:10,585 INFO L752 eck$LassoCheckResult]: Stem: 889#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 890#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~ret29#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~short13#1, test_fun_#t~short14#1, test_fun_#t~mem17#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~short18#1, test_fun_#t~mem19#1, test_fun_#t~short20#1, test_fun_#t~mem21#1, test_fun_#t~short22#1, test_fun_#t~mem25#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 895#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 913#L557-1 [2022-07-22 01:38:10,585 INFO L754 eck$LassoCheckResult]: Loop: 913#L557-1 assume test_fun_#t~short9#1;call test_fun_#t~mem8#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem7#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem8#1 < 2147483647 - test_fun_#t~mem7#1; 914#L557-3 test_fun_#t~short14#1 := test_fun_#t~short9#1; 922#L557-4 assume !test_fun_#t~short14#1;call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short13#1 := test_fun_#t~mem10#1 < 0; 903#L557-6 assume !test_fun_#t~short13#1; 885#L557-8 test_fun_#t~short14#1 := test_fun_#t~short13#1; 886#L557-9 test_fun_#t~short18#1 := test_fun_#t~short14#1; 908#L557-10 assume test_fun_#t~short18#1;call test_fun_#t~mem17#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem16#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short18#1 := test_fun_#t~mem17#1 > test_fun_#t~mem15#1 + test_fun_#t~mem16#1; 904#L557-12 test_fun_#t~short20#1 := test_fun_#t~short18#1; 905#L557-13 assume test_fun_#t~short20#1;call test_fun_#t~mem19#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short20#1 := test_fun_#t~mem19#1 < 2147483647; 901#L557-15 test_fun_#t~short22#1 := test_fun_#t~short20#1; 891#L557-16 assume test_fun_#t~short22#1;call test_fun_#t~mem21#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short22#1 := test_fun_#t~mem21#1 < 2147483647; 892#L557-18 assume !!test_fun_#t~short22#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~short14#1;havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~mem16#1;havoc test_fun_#t~short18#1;havoc test_fun_#t~mem19#1;havoc test_fun_#t~short20#1;havoc test_fun_#t~mem21#1;havoc test_fun_#t~short22#1;call test_fun_#t~mem23#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem23#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;call test_fun_#t~mem24#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem24#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);havoc test_fun_#t~mem24#1; 917#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 913#L557-1 [2022-07-22 01:38:10,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:10,585 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 5 times [2022-07-22 01:38:10,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:10,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775350139] [2022-07-22 01:38:10,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:10,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:10,612 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:38:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:10,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:38:10,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:10,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1544998325, now seen corresponding path program 1 times [2022-07-22 01:38:10,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:10,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739073712] [2022-07-22 01:38:10,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:10,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:38:10,685 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-22 01:38:10,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:38:10,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739073712] [2022-07-22 01:38:10,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739073712] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:38:10,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:38:10,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 01:38:10,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685620] [2022-07-22 01:38:10,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:38:10,691 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:38:10,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:38:10,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 01:38:10,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 01:38:10,694 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:38:10,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:38:10,723 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-07-22 01:38:10,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 01:38:10,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 54 transitions. [2022-07-22 01:38:10,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-22 01:38:10,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 39 states and 42 transitions. [2022-07-22 01:38:10,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-07-22 01:38:10,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-07-22 01:38:10,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 42 transitions. [2022-07-22 01:38:10,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:38:10,725 INFO L369 hiAutomatonCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-07-22 01:38:10,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 42 transitions. [2022-07-22 01:38:10,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-07-22 01:38:10,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 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-22 01:38:10,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-07-22 01:38:10,728 INFO L392 hiAutomatonCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-07-22 01:38:10,728 INFO L374 stractBuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-07-22 01:38:10,728 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 01:38:10,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 42 transitions. [2022-07-22 01:38:10,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-22 01:38:10,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:38:10,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:38:10,729 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 01:38:10,729 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:38:10,729 INFO L752 eck$LassoCheckResult]: Stem: 993#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 994#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~ret29#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1, test_fun_#in~z#1 := main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset, test_fun_#t~mem23#1, test_fun_#t~mem24#1, test_fun_#t~mem6#1, test_fun_#t~mem8#1, test_fun_#t~mem7#1, test_fun_#t~short9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem11#1, test_fun_#t~short13#1, test_fun_#t~short14#1, test_fun_#t~mem17#1, test_fun_#t~mem15#1, test_fun_#t~mem16#1, test_fun_#t~short18#1, test_fun_#t~mem19#1, test_fun_#t~short20#1, test_fun_#t~mem21#1, test_fun_#t~short22#1, test_fun_#t~mem25#1, test_fun_~x#1, test_fun_~y#1, test_fun_~z#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;test_fun_~z#1 := test_fun_#in~z#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc5#1.base, test_fun_#t~malloc5#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(test_fun_~z#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 999#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 1015#L557-1 [2022-07-22 01:38:10,729 INFO L754 eck$LassoCheckResult]: Loop: 1015#L557-1 assume !test_fun_#t~short9#1; 1013#L557-3 test_fun_#t~short14#1 := test_fun_#t~short9#1; 1000#L557-4 assume !test_fun_#t~short14#1;call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short13#1 := test_fun_#t~mem10#1 < 0; 1001#L557-6 assume test_fun_#t~short13#1;call test_fun_#t~mem12#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short13#1 := test_fun_#t~mem12#1 > -2147483648 - test_fun_#t~mem11#1; 989#L557-8 test_fun_#t~short14#1 := test_fun_#t~short13#1; 990#L557-9 test_fun_#t~short18#1 := test_fun_#t~short14#1; 1011#L557-10 assume test_fun_#t~short18#1;call test_fun_#t~mem17#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem15#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call test_fun_#t~mem16#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short18#1 := test_fun_#t~mem17#1 > test_fun_#t~mem15#1 + test_fun_#t~mem16#1; 1006#L557-12 test_fun_#t~short20#1 := test_fun_#t~short18#1; 1007#L557-13 assume test_fun_#t~short20#1;call test_fun_#t~mem19#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short20#1 := test_fun_#t~mem19#1 < 2147483647; 1004#L557-15 test_fun_#t~short22#1 := test_fun_#t~short20#1; 995#L557-16 assume test_fun_#t~short22#1;call test_fun_#t~mem21#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);test_fun_#t~short22#1 := test_fun_#t~mem21#1 < 2147483647; 996#L557-18 assume !!test_fun_#t~short22#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~mem8#1;havoc test_fun_#t~mem7#1;havoc test_fun_#t~short9#1;havoc test_fun_#t~mem10#1;havoc test_fun_#t~mem12#1;havoc test_fun_#t~mem11#1;havoc test_fun_#t~short13#1;havoc test_fun_#t~short14#1;havoc test_fun_#t~mem17#1;havoc test_fun_#t~mem15#1;havoc test_fun_#t~mem16#1;havoc test_fun_#t~short18#1;havoc test_fun_#t~mem19#1;havoc test_fun_#t~short20#1;havoc test_fun_#t~mem21#1;havoc test_fun_#t~short22#1;call test_fun_#t~mem23#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem23#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem23#1;call test_fun_#t~mem24#1 := read~int(test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem24#1, test_fun_~z_ref~0#1.base, test_fun_~z_ref~0#1.offset, 4);havoc test_fun_#t~mem24#1; 1018#L557-20 call test_fun_#t~mem6#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);test_fun_#t~short9#1 := test_fun_#t~mem6#1 >= 0; 1015#L557-1 [2022-07-22 01:38:10,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:10,730 INFO L85 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 6 times [2022-07-22 01:38:10,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:10,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327608070] [2022-07-22 01:38:10,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:10,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:10,745 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:38:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:10,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:38:10,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:10,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1738777329, now seen corresponding path program 1 times [2022-07-22 01:38:10,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:10,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592198494] [2022-07-22 01:38:10,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:10,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:10,771 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:38:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:10,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:38:10,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:10,781 INFO L85 PathProgramCache]: Analyzing trace with hash -403715764, now seen corresponding path program 1 times [2022-07-22 01:38:10,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:38:10,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488606350] [2022-07-22 01:38:10,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:38:10,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:38:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:10,811 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:38:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:38:10,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:38:12,330 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:38:12,330 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:38:12,330 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:38:12,330 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:38:12,330 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:38:12,330 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:12,330 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:38:12,330 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:38:12,330 INFO L133 ssoRankerPreferences]: Filename of dumped script: a.06-alloca.i_Iteration8_Lasso [2022-07-22 01:38:12,331 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:38:12,331 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:38:12,335 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-22 01:38:12,337 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-22 01:38:12,339 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-22 01:38:13,195 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-22 01:38:13,198 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-22 01:38:13,200 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-22 01:38:13,201 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-22 01:38:13,203 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-22 01:38:13,204 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-22 01:38:13,206 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-22 01:38:13,208 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-22 01:38:13,209 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-22 01:38:13,212 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-22 01:38:13,213 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-22 01:38:13,216 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-22 01:38:13,218 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-22 01:38:13,220 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-22 01:38:13,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:13,223 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-22 01:38:13,224 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-22 01:38:13,226 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-22 01:38:13,228 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-22 01:38:13,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:13,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:13,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:13,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:38:13,235 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-22 01:38:13,237 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-22 01:38:13,242 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-22 01:38:13,891 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:38:13,891 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:38:13,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:13,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:13,897 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-22 01:38:13,898 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-22 01:38:13,899 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-22 01:38:13,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:13,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:38:13,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:13,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:13,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:13,905 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:38:13,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:38:13,906 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:13,921 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-22 01:38:13,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:13,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:13,923 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-22 01:38:13,923 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-22 01:38:13,925 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-22 01:38:13,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:13,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:38:13,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:13,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:13,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:13,932 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:38:13,932 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:38:13,943 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:13,969 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-22 01:38:13,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:13,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:13,970 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-22 01:38:13,982 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-22 01:38:13,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:13,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:13,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:13,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:13,991 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:38:13,992 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:38:13,995 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-22 01:38:14,002 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:14,018 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-22 01:38:14,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:14,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:14,019 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-22 01:38:14,020 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-22 01:38:14,021 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-22 01:38:14,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:14,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:14,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:14,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:14,035 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:38:14,035 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:38:14,050 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:14,066 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-22 01:38:14,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:14,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:14,068 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-22 01:38:14,068 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-22 01:38:14,069 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-22 01:38:14,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:14,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:14,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:14,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:14,084 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:38:14,084 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:38:14,111 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:14,138 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-22 01:38:14,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:14,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:14,140 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:38:14,143 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-22 01:38:14,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:14,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:14,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:14,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:14,152 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:38:14,152 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:38:14,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-22 01:38:14,165 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:14,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-22 01:38:14,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:14,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:14,183 INFO L229 MonitoredProcess]: Starting monitored process 24 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-22 01:38:14,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-22 01:38:14,185 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-22 01:38:14,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:14,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:14,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:14,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:14,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:38:14,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:38:14,234 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:14,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-22 01:38:14,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:14,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:14,262 INFO L229 MonitoredProcess]: Starting monitored process 25 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-22 01:38:14,268 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-22 01:38:14,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:14,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:14,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:14,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:14,278 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:38:14,278 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:38:14,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-22 01:38:14,291 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:14,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-22 01:38:14,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:14,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:14,311 INFO L229 MonitoredProcess]: Starting monitored process 26 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-22 01:38:14,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-22 01:38:14,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:38:14,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:14,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:38:14,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:38:14,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:14,322 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:38:14,322 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:38:14,325 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:38:14,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-22 01:38:14,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:14,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:14,344 INFO L229 MonitoredProcess]: Starting monitored process 27 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-22 01:38:14,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-22 01:38:14,345 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-22 01:38:14,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:38:14,352 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-07-22 01:38:14,352 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 01:38:14,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:38:14,385 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2022-07-22 01:38:14,386 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-22 01:38:14,433 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:38:14,649 INFO L443 ModelExtractionUtils]: Simplification made 26 calls to the SMT solver. [2022-07-22 01:38:14,649 INFO L444 ModelExtractionUtils]: 35 out of 76 variables were initially zero. Simplification set additionally 34 variables to zero. [2022-07-22 01:38:14,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:38:14,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:38:14,652 INFO L229 MonitoredProcess]: Starting monitored process 28 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-22 01:38:14,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-22 01:38:14,653 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:38:14,661 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2022-07-22 01:38:14,661 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:38:14,661 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0#1.base) ULTIMATE.start_test_fun_~z_ref~0#1.offset)_2, ULTIMATE.start_test_fun_~y#1) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0#1.base) ULTIMATE.start_test_fun_~z_ref~0#1.offset)_2 - 4294967293*ULTIMATE.start_test_fun_~y#1 Supporting invariants [-1*ULTIMATE.start_test_fun_~y#1 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_2 >= 0] [2022-07-22 01:38:14,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-22 01:38:14,841 INFO L293 tatePredicateManager]: 37 out of 38 supporting invariants were superfluous and have been removed [2022-07-22 01:38:14,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:38:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:38:14,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-22 01:38:14,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:38:14,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 01:38:14,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 01:38:15,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-22 01:38:15,028 INFO L356 Elim1Store]: treesize reduction 104, result has 32.0 percent of original size [2022-07-22 01:38:15,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 134 [2022-07-22 01:38:15,054 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 01:38:15,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 195 treesize of output 197 [2022-07-22 01:38:15,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-22 01:38:15,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-22 01:38:15,705 INFO L356 Elim1Store]: treesize reduction 63, result has 1.6 percent of original size [2022-07-22 01:38:15,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 83 treesize of output 30 [2022-07-22 01:38:15,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-22 01:38:15,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:38:15,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-22 01:38:15,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:38:15,903 INFO L356 Elim1Store]: treesize reduction 16, result has 65.2 percent of original size [2022-07-22 01:38:15,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 84 [2022-07-22 01:38:16,053 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-22 01:38:16,055 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2022-07-22 01:38:16,057 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 5 Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:38:16,162 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 5. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 78 states and 87 transitions. Complement of second has 11 states. [2022-07-22 01:38:16,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2022-07-22 01:38:16,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:38:16,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2022-07-22 01:38:16,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 3 letters. Loop has 13 letters. [2022-07-22 01:38:16,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:38:16,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 16 letters. Loop has 13 letters. [2022-07-22 01:38:16,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:38:16,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 3 letters. Loop has 26 letters. [2022-07-22 01:38:16,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:38:16,165 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 87 transitions. [2022-07-22 01:38:16,167 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 01:38:16,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 0 states and 0 transitions. [2022-07-22 01:38:16,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-22 01:38:16,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-22 01:38:16,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-22 01:38:16,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:38:16,167 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 01:38:16,168 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 01:38:16,168 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 01:38:16,168 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-22 01:38:16,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-22 01:38:16,168 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 01:38:16,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-22 01:38:16,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 01:38:16 BoogieIcfgContainer [2022-07-22 01:38:16,174 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 01:38:16,174 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 01:38:16,174 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 01:38:16,175 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 01:38:16,175 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:38:04" (3/4) ... [2022-07-22 01:38:16,177 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 01:38:16,177 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 01:38:16,178 INFO L158 Benchmark]: Toolchain (without parser) took 12633.05ms. Allocated memory was 48.2MB in the beginning and 130.0MB in the end (delta: 81.8MB). Free memory was 22.7MB in the beginning and 87.0MB in the end (delta: -64.4MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2022-07-22 01:38:16,178 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 48.2MB. Free memory was 30.4MB in the beginning and 30.3MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:38:16,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.34ms. Allocated memory was 48.2MB in the beginning and 60.8MB in the end (delta: 12.6MB). Free memory was 22.5MB in the beginning and 38.7MB in the end (delta: -16.2MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2022-07-22 01:38:16,179 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.20ms. Allocated memory is still 60.8MB. Free memory was 38.5MB in the beginning and 36.6MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-22 01:38:16,179 INFO L158 Benchmark]: Boogie Preprocessor took 49.42ms. Allocated memory is still 60.8MB. Free memory was 36.6MB in the beginning and 35.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:38:16,179 INFO L158 Benchmark]: RCFGBuilder took 517.91ms. Allocated memory is still 60.8MB. Free memory was 35.2MB in the beginning and 34.6MB in the end (delta: 645.7kB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2022-07-22 01:38:16,179 INFO L158 Benchmark]: BuchiAutomizer took 11620.28ms. Allocated memory was 60.8MB in the beginning and 130.0MB in the end (delta: 69.2MB). Free memory was 34.3MB in the beginning and 87.0MB in the end (delta: -52.7MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2022-07-22 01:38:16,180 INFO L158 Benchmark]: Witness Printer took 3.05ms. Allocated memory is still 130.0MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:38:16,181 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 48.2MB. Free memory was 30.4MB in the beginning and 30.3MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.34ms. Allocated memory was 48.2MB in the beginning and 60.8MB in the end (delta: 12.6MB). Free memory was 22.5MB in the beginning and 38.7MB in the end (delta: -16.2MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.20ms. Allocated memory is still 60.8MB. Free memory was 38.5MB in the beginning and 36.6MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.42ms. Allocated memory is still 60.8MB. Free memory was 36.6MB in the beginning and 35.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 517.91ms. Allocated memory is still 60.8MB. Free memory was 35.2MB in the beginning and 34.6MB in the end (delta: 645.7kB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 11620.28ms. Allocated memory was 60.8MB in the beginning and 130.0MB in the end (delta: 69.2MB). Free memory was 34.3MB in the beginning and 87.0MB in the end (delta: -52.7MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * Witness Printer took 3.05ms. Allocated memory is still 130.0MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (6 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z_ref][z_ref] + 4294967293 and consists of 7 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z_ref][z_ref] + -4294967293 * y and consists of 7 locations. 6 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.5s and 9 iterations. TraceHistogramMax:1. Analysis of lassos took 9.1s. Construction of modules took 0.2s. Büchi inclusion checks took 2.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 101 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 205 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 204 mSDsluCounter, 442 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 282 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 285 IncrementalHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 160 mSDtfsCounter, 285 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI6 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital449 mio100 ax104 hnf100 lsp94 ukn55 mio100 lsp34 div100 bol105 ite100 ukn100 eq179 hnf89 smp100 dnf138 smp97 tf100 neg98 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 319ms VariablesStem: 14 VariablesLoop: 9 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-22 01:38:16,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE