./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/max.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 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/reducercommutativity/max.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97795e7b99ddd869ecccb7f865206a167342b52333873684a94abd35acf6650e --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:24:34,889 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:24:34,890 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:24:34,944 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:24:34,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:24:34,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:24:34,946 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:24:34,947 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:24:34,948 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:24:34,949 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:24:34,950 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:24:34,951 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:24:34,952 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:24:34,954 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:24:34,956 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:24:34,958 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:24:34,960 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:24:34,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:24:34,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:24:34,968 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:24:34,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:24:34,980 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:24:34,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:24:34,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:24:34,984 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:24:34,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:24:34,986 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:24:34,986 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:24:34,987 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:24:34,988 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:24:34,988 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:24:34,988 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:24:34,989 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:24:34,990 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:24:34,991 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:24:34,991 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:24:34,992 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:24:34,992 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:24:34,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:24:34,993 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:24:34,993 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:24:34,994 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-15 17:24:35,014 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:24:35,014 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:24:35,014 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:24:35,014 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:24:35,015 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:24:35,015 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:24:35,016 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:24:35,016 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:24:35,016 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:24:35,016 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:24:35,016 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:24:35,016 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:24:35,017 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:24:35,017 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:24:35,017 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:24:35,017 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:24:35,017 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:24:35,017 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:24:35,017 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:24:35,018 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:24:35,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:24:35,018 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:24:35,018 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:24:35,018 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:24:35,019 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:24:35,019 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:24:35,019 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:24:35,019 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:24:35,020 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:24:35,020 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:24:35,020 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:24:35,020 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:24:35,021 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:24:35,021 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97795e7b99ddd869ecccb7f865206a167342b52333873684a94abd35acf6650e [2021-12-15 17:24:35,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:24:35,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:24:35,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:24:35,236 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:24:35,237 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:24:35,238 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/max.i [2021-12-15 17:24:35,295 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3af3170f/fbbe3058edb444a79bb072744655076b/FLAG92d2771a0 [2021-12-15 17:24:35,646 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:24:35,647 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max.i [2021-12-15 17:24:35,652 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3af3170f/fbbe3058edb444a79bb072744655076b/FLAG92d2771a0 [2021-12-15 17:24:35,662 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3af3170f/fbbe3058edb444a79bb072744655076b [2021-12-15 17:24:35,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:24:35,665 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:24:35,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:24:35,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:24:35,669 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:24:35,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:24:35" (1/1) ... [2021-12-15 17:24:35,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f9e73e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:24:35, skipping insertion in model container [2021-12-15 17:24:35,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:24:35" (1/1) ... [2021-12-15 17:24:35,675 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:24:35,688 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:24:35,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max.i[1295,1308] [2021-12-15 17:24:35,842 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:24:35,849 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:24:35,879 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max.i[1295,1308] [2021-12-15 17:24:35,881 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:24:35,891 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:24:35,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:24:35 WrapperNode [2021-12-15 17:24:35,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:24:35,893 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:24:35,893 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:24:35,893 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:24:35,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:24:35" (1/1) ... [2021-12-15 17:24:35,907 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:24:35" (1/1) ... [2021-12-15 17:24:35,929 INFO L137 Inliner]: procedures = 16, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2021-12-15 17:24:35,930 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:24:35,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:24:35,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:24:35,931 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:24:35,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:24:35" (1/1) ... [2021-12-15 17:24:35,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:24:35" (1/1) ... [2021-12-15 17:24:35,942 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:24:35" (1/1) ... [2021-12-15 17:24:35,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:24:35" (1/1) ... [2021-12-15 17:24:35,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:24:35" (1/1) ... [2021-12-15 17:24:35,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:24:35" (1/1) ... [2021-12-15 17:24:35,955 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:24:35" (1/1) ... [2021-12-15 17:24:35,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:24:35,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:24:35,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:24:35,958 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:24:35,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:24:35" (1/1) ... [2021-12-15 17:24:35,974 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:35,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:35,997 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) [2021-12-15 17:24:36,008 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 [2021-12-15 17:24:36,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:24:36,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:24:36,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 17:24:36,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 17:24:36,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:24:36,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:24:36,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 17:24:36,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 17:24:36,091 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:24:36,092 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:24:36,249 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:24:36,256 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:24:36,257 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-15 17:24:36,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:24:36 BoogieIcfgContainer [2021-12-15 17:24:36,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:24:36,259 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:24:36,259 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:24:36,262 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:24:36,262 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:24:36,262 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:24:35" (1/3) ... [2021-12-15 17:24:36,263 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a6d220e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:24:36, skipping insertion in model container [2021-12-15 17:24:36,263 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:24:36,263 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:24:35" (2/3) ... [2021-12-15 17:24:36,263 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a6d220e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:24:36, skipping insertion in model container [2021-12-15 17:24:36,264 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:24:36,264 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:24:36" (3/3) ... [2021-12-15 17:24:36,265 INFO L388 chiAutomizerObserver]: Analyzing ICFG max.i [2021-12-15 17:24:36,304 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:24:36,304 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:24:36,304 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:24:36,304 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:24:36,304 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:24:36,304 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:24:36,304 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:24:36,305 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:24:36,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 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) [2021-12-15 17:24:36,338 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-12-15 17:24:36,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:24:36,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:24:36,343 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-12-15 17:24:36,344 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-15 17:24:36,344 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:24:36,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 30 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 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) [2021-12-15 17:24:36,348 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2021-12-15 17:24:36,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:24:36,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:24:36,348 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-12-15 17:24:36,349 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-15 17:24:36,356 INFO L791 eck$LassoCheckResult]: Stem: 19#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 9#L31true assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 16#L22-3true [2021-12-15 17:24:36,357 INFO L793 eck$LassoCheckResult]: Loop: 16#L22-3true assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 14#L23true assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 28#L23-2true max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 11#L22-2true max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 16#L22-3true [2021-12-15 17:24:36,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:36,369 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-15 17:24:36,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:36,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908391451] [2021-12-15 17:24:36,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:36,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:36,463 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:36,493 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:36,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:36,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1326822, now seen corresponding path program 1 times [2021-12-15 17:24:36,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:36,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83435831] [2021-12-15 17:24:36,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:36,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:36,519 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:36,528 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:36,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:36,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1805089543, now seen corresponding path program 1 times [2021-12-15 17:24:36,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:36,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149824857] [2021-12-15 17:24:36,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:36,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:36,555 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:36,569 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:37,091 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:24:37,092 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:24:37,092 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:24:37,092 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:24:37,093 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:24:37,093 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:37,093 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:24:37,093 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:24:37,093 INFO L133 ssoRankerPreferences]: Filename of dumped script: max.i_Iteration1_Lasso [2021-12-15 17:24:37,093 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:24:37,093 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:24:37,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:37,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:37,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:37,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:37,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:37,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:37,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:37,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:37,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:37,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:37,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:37,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:37,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:37,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:37,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:37,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:37,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:37,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:37,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:37,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:37,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:37,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:37,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:37,687 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:24:37,693 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:24:37,695 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:37,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:37,699 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) [2021-12-15 17:24:37,710 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 [2021-12-15 17:24:37,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:37,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:24:37,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:37,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:37,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:37,719 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:24:37,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:24:37,723 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 [2021-12-15 17:24:37,728 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:37,747 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 [2021-12-15 17:24:37,748 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:37,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:37,749 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) [2021-12-15 17:24:37,750 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 [2021-12-15 17:24:37,752 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 [2021-12-15 17:24:37,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:37,759 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:24:37,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:37,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:37,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:37,760 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:24:37,760 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:24:37,770 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:37,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:37,789 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:37,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:37,790 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) [2021-12-15 17:24:37,791 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 [2021-12-15 17:24:37,792 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 [2021-12-15 17:24:37,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:37,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:24:37,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:37,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:37,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:37,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:24:37,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:24:37,819 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:37,838 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 [2021-12-15 17:24:37,838 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:37,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:37,848 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) [2021-12-15 17:24:37,849 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 [2021-12-15 17:24:37,851 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 [2021-12-15 17:24:37,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:37,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:24:37,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:37,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:37,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:37,859 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:24:37,859 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:24:37,865 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:37,881 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 [2021-12-15 17:24:37,882 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:37,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:37,883 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) [2021-12-15 17:24:37,883 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 [2021-12-15 17:24:37,885 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 [2021-12-15 17:24:37,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:37,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:37,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:37,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:37,895 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:37,895 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:37,904 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:37,922 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 [2021-12-15 17:24:37,923 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:37,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:37,924 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) [2021-12-15 17:24:37,926 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 [2021-12-15 17:24:37,927 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 [2021-12-15 17:24:37,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:37,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:37,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:37,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:37,936 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:37,936 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:37,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:37,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2021-12-15 17:24:37,964 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:37,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:37,965 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) [2021-12-15 17:24:37,966 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 [2021-12-15 17:24:37,968 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 [2021-12-15 17:24:37,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:37,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:37,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:37,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:37,978 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:37,978 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:37,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:38,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:38,010 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:38,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:38,011 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) [2021-12-15 17:24:38,018 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 [2021-12-15 17:24:38,019 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 [2021-12-15 17:24:38,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:38,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:38,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:38,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:38,031 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:38,032 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:38,044 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:24:38,064 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-12-15 17:24:38,065 INFO L444 ModelExtractionUtils]: 10 out of 25 variables were initially zero. Simplification set additionally 12 variables to zero. [2021-12-15 17:24:38,066 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:38,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:38,088 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) [2021-12-15 17:24:38,089 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 [2021-12-15 17:24:38,120 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:24:38,144 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:24:38,144 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:24:38,145 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0#1, ~N~0) = -1*ULTIMATE.start_max_~i~0#1 + 1*~N~0 Supporting invariants [] [2021-12-15 17:24:38,164 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 [2021-12-15 17:24:38,185 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2021-12-15 17:24:38,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:38,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:24:38,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:24:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:38,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 17:24:38,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:24:38,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:24:38,314 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-15 17:24:38,315 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 30 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 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) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2021-12-15 17:24:38,347 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 30 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 29 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). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 63 states and 87 transitions. Complement of second has 8 states. [2021-12-15 17:24:38,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-15 17:24:38,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2021-12-15 17:24:38,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2021-12-15 17:24:38,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 3 letters. Loop has 4 letters. [2021-12-15 17:24:38,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:24:38,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 7 letters. Loop has 4 letters. [2021-12-15 17:24:38,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:24:38,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 3 letters. Loop has 8 letters. [2021-12-15 17:24:38,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:24:38,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 87 transitions. [2021-12-15 17:24:38,360 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-12-15 17:24:38,363 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 23 states and 32 transitions. [2021-12-15 17:24:38,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-12-15 17:24:38,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-12-15 17:24:38,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2021-12-15 17:24:38,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:24:38,365 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2021-12-15 17:24:38,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2021-12-15 17:24:38,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-12-15 17:24:38,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:24:38,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2021-12-15 17:24:38,383 INFO L704 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2021-12-15 17:24:38,383 INFO L587 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2021-12-15 17:24:38,383 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:24:38,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 32 transitions. [2021-12-15 17:24:38,384 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-12-15 17:24:38,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:24:38,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:24:38,384 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-15 17:24:38,384 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-15 17:24:38,385 INFO L791 eck$LassoCheckResult]: Stem: 190#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 191#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 202#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 203#L22-3 assume !(max_~i~0#1 < ~N~0); 204#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 197#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 198#L22-8 [2021-12-15 17:24:38,385 INFO L793 eck$LassoCheckResult]: Loop: 198#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 200#L23-3 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 188#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 189#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 198#L22-8 [2021-12-15 17:24:38,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:38,385 INFO L85 PathProgramCache]: Analyzing trace with hash 889511083, now seen corresponding path program 1 times [2021-12-15 17:24:38,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:38,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545380707] [2021-12-15 17:24:38,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:38,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:38,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:24:38,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:24:38,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545380707] [2021-12-15 17:24:38,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545380707] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:24:38,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:24:38,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:24:38,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986203884] [2021-12-15 17:24:38,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:24:38,426 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:24:38,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:38,426 INFO L85 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 1 times [2021-12-15 17:24:38,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:38,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826076004] [2021-12-15 17:24:38,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:38,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:38,431 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:38,435 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:38,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:24:38,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:24:38,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:24:38,471 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:24:38,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:24:38,500 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2021-12-15 17:24:38,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:24:38,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2021-12-15 17:24:38,502 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-12-15 17:24:38,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2021-12-15 17:24:38,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-12-15 17:24:38,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-12-15 17:24:38,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2021-12-15 17:24:38,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:24:38,503 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2021-12-15 17:24:38,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2021-12-15 17:24:38,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2021-12-15 17:24:38,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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) [2021-12-15 17:24:38,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2021-12-15 17:24:38,504 INFO L704 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2021-12-15 17:24:38,505 INFO L587 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2021-12-15 17:24:38,505 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:24:38,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2021-12-15 17:24:38,505 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-12-15 17:24:38,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:24:38,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:24:38,506 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:24:38,506 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-15 17:24:38,506 INFO L791 eck$LassoCheckResult]: Stem: 245#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 246#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 257#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 258#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 263#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 262#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 260#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 261#L22-3 assume !(max_~i~0#1 < ~N~0); 259#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 252#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 253#L22-8 [2021-12-15 17:24:38,506 INFO L793 eck$LassoCheckResult]: Loop: 253#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 255#L23-3 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 241#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 242#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 253#L22-8 [2021-12-15 17:24:38,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:38,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1805667996, now seen corresponding path program 1 times [2021-12-15 17:24:38,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:38,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733187849] [2021-12-15 17:24:38,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:38,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:38,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:24:38,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:24:38,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733187849] [2021-12-15 17:24:38,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733187849] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:24:38,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275058044] [2021-12-15 17:24:38,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:38,542 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:24:38,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:38,543 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:24:38,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-15 17:24:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:38,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 17:24:38,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:24:38,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:24:38,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:24:38,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:24:38,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275058044] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:24:38,690 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:24:38,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-12-15 17:24:38,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602918696] [2021-12-15 17:24:38,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:24:38,691 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:24:38,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:38,691 INFO L85 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 2 times [2021-12-15 17:24:38,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:38,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976365810] [2021-12-15 17:24:38,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:38,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:38,696 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:38,700 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:38,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:24:38,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 17:24:38,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2021-12-15 17:24:38,737 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. cyclomatic complexity: 10 Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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) [2021-12-15 17:24:38,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:24:38,784 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2021-12-15 17:24:38,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:24:38,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2021-12-15 17:24:38,786 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-12-15 17:24:38,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2021-12-15 17:24:38,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-12-15 17:24:38,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-12-15 17:24:38,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2021-12-15 17:24:38,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:24:38,795 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2021-12-15 17:24:38,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2021-12-15 17:24:38,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2021-12-15 17:24:38,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:24:38,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2021-12-15 17:24:38,801 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-12-15 17:24:38,801 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-12-15 17:24:38,801 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:24:38,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2021-12-15 17:24:38,803 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-12-15 17:24:38,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:24:38,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:24:38,804 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-15 17:24:38,804 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-15 17:24:38,804 INFO L791 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 363#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 374#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 375#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 382#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 384#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 377#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 378#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 381#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 379#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 380#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 383#L22-3 assume !(max_~i~0#1 < ~N~0); 376#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 369#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 370#L22-8 [2021-12-15 17:24:38,804 INFO L793 eck$LassoCheckResult]: Loop: 370#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 372#L23-3 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 358#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 359#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 370#L22-8 [2021-12-15 17:24:38,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:38,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1818198429, now seen corresponding path program 2 times [2021-12-15 17:24:38,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:38,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147027831] [2021-12-15 17:24:38,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:38,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:38,842 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:38,857 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:38,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:38,858 INFO L85 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 3 times [2021-12-15 17:24:38,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:38,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349328588] [2021-12-15 17:24:38,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:38,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:38,861 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:38,898 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:38,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:38,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1198284866, now seen corresponding path program 1 times [2021-12-15 17:24:38,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:38,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746124133] [2021-12-15 17:24:38,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:38,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:38,909 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 [2021-12-15 17:24:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:39,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:24:39,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:24:39,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746124133] [2021-12-15 17:24:39,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746124133] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:24:39,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849542503] [2021-12-15 17:24:39,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:39,117 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:24:39,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:39,118 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:24:39,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-15 17:24:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:39,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-15 17:24:39,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:24:39,346 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-12-15 17:24:39,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2021-12-15 17:24:39,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:24:39,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:24:39,573 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 17:24:39,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 38 [2021-12-15 17:24:39,592 INFO L388 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 9 treesize of output 3 [2021-12-15 17:24:39,609 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 17:24:39,610 INFO L388 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 40 treesize of output 44 [2021-12-15 17:24:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:24:39,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849542503] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:24:39,782 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:24:39,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2021-12-15 17:24:39,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077352366] [2021-12-15 17:24:39,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:24:39,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:24:39,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-15 17:24:39,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2021-12-15 17:24:39,822 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 11 Second operand has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 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) [2021-12-15 17:24:40,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:24:40,443 INFO L93 Difference]: Finished difference Result 99 states and 124 transitions. [2021-12-15 17:24:40,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-15 17:24:40,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 124 transitions. [2021-12-15 17:24:40,445 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 20 [2021-12-15 17:24:40,447 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 99 states and 124 transitions. [2021-12-15 17:24:40,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2021-12-15 17:24:40,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 [2021-12-15 17:24:40,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 124 transitions. [2021-12-15 17:24:40,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:24:40,447 INFO L681 BuchiCegarLoop]: Abstraction has 99 states and 124 transitions. [2021-12-15 17:24:40,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 124 transitions. [2021-12-15 17:24:40,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 38. [2021-12-15 17:24:40,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.263157894736842) internal successors, (48), 37 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:24:40,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2021-12-15 17:24:40,450 INFO L704 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2021-12-15 17:24:40,450 INFO L587 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2021-12-15 17:24:40,450 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 17:24:40,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2021-12-15 17:24:40,451 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-12-15 17:24:40,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:24:40,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:24:40,451 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:24:40,451 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-15 17:24:40,451 INFO L791 eck$LassoCheckResult]: Stem: 634#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 635#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 646#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 647#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 653#L23 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 654#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 667#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 666#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 659#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 662#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 663#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 657#L22-3 assume !(max_~i~0#1 < ~N~0); 658#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 641#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 642#L22-8 [2021-12-15 17:24:40,451 INFO L793 eck$LassoCheckResult]: Loop: 642#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 644#L23-3 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 630#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 631#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 642#L22-8 [2021-12-15 17:24:40,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:40,452 INFO L85 PathProgramCache]: Analyzing trace with hash -2083741857, now seen corresponding path program 1 times [2021-12-15 17:24:40,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:40,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214745579] [2021-12-15 17:24:40,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:40,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:40,463 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:40,490 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:40,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:40,491 INFO L85 PathProgramCache]: Analyzing trace with hash 2034854, now seen corresponding path program 4 times [2021-12-15 17:24:40,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:40,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217716974] [2021-12-15 17:24:40,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:40,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:40,498 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:40,500 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:40,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:40,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2085565180, now seen corresponding path program 1 times [2021-12-15 17:24:40,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:40,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415774105] [2021-12-15 17:24:40,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:40,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:40,512 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:40,524 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:41,298 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:24:41,299 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:24:41,299 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:24:41,299 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:24:41,299 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:24:41,299 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:41,299 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:24:41,299 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:24:41,299 INFO L133 ssoRankerPreferences]: Filename of dumped script: max.i_Iteration5_Lasso [2021-12-15 17:24:41,299 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:24:41,299 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:24:41,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:41,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:41,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:42,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:42,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:42,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:42,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:42,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:42,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:42,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:42,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:42,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:42,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:42,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:42,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:42,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:42,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:42,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:42,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:42,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:42,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:42,674 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:24:42,674 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:24:42,675 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:42,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:42,676 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) [2021-12-15 17:24:42,677 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 [2021-12-15 17:24:42,685 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 [2021-12-15 17:24:42,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:42,691 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:24:42,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:42,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:42,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:42,692 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:24:42,692 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:24:42,692 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:42,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2021-12-15 17:24:42,710 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:42,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:42,711 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) [2021-12-15 17:24:42,712 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 [2021-12-15 17:24:42,713 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 [2021-12-15 17:24:42,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:42,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:24:42,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:42,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:42,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:42,720 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:24:42,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:24:42,720 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:42,741 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 [2021-12-15 17:24:42,741 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:42,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:42,742 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) [2021-12-15 17:24:42,742 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 [2021-12-15 17:24:42,743 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 [2021-12-15 17:24:42,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:42,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:42,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:42,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:42,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:42,751 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:42,758 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:42,779 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 [2021-12-15 17:24:42,779 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:42,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:42,780 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) [2021-12-15 17:24:42,782 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 [2021-12-15 17:24:42,829 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 [2021-12-15 17:24:42,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:42,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:42,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:42,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:42,843 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:42,844 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:42,846 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:42,863 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 [2021-12-15 17:24:42,864 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:42,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:42,865 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) [2021-12-15 17:24:42,866 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 [2021-12-15 17:24:42,867 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 [2021-12-15 17:24:42,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:42,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:42,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:42,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:42,875 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:42,875 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:42,877 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:42,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2021-12-15 17:24:42,894 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:42,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:42,895 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) [2021-12-15 17:24:42,895 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 [2021-12-15 17:24:42,897 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 [2021-12-15 17:24:42,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:42,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:42,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:42,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:42,906 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:42,906 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:42,953 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:42,969 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 [2021-12-15 17:24:42,969 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:42,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:42,970 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) [2021-12-15 17:24:42,972 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 [2021-12-15 17:24:42,973 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 [2021-12-15 17:24:42,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:42,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:42,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:42,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:42,991 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:42,991 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:42,995 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:43,011 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 [2021-12-15 17:24:43,012 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:43,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:43,013 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) [2021-12-15 17:24:43,016 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 [2021-12-15 17:24:43,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:43,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:43,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:43,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:43,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:43,025 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:43,025 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:43,027 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:43,042 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 [2021-12-15 17:24:43,043 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:43,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:43,044 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) [2021-12-15 17:24:43,046 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 [2021-12-15 17:24:43,046 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 [2021-12-15 17:24:43,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:43,052 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2021-12-15 17:24:43,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:43,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:43,057 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2021-12-15 17:24:43,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:43,074 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:43,089 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 [2021-12-15 17:24:43,090 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:43,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:43,091 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) [2021-12-15 17:24:43,091 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 [2021-12-15 17:24:43,092 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 [2021-12-15 17:24:43,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:43,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:43,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:43,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:43,112 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:43,112 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:43,120 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:24:43,143 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2021-12-15 17:24:43,143 INFO L444 ModelExtractionUtils]: 3 out of 25 variables were initially zero. Simplification set additionally 17 variables to zero. [2021-12-15 17:24:43,143 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:43,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:43,144 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) [2021-12-15 17:24:43,147 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:24:43,153 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 [2021-12-15 17:24:43,156 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-12-15 17:24:43,156 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:24:43,156 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_2) = -2*ULTIMATE.start_max_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_2 Supporting invariants [1*v_rep(select #length ULTIMATE.start_max_~x#1.base)_2 - 2*~N~0 >= 0] [2021-12-15 17:24:43,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2021-12-15 17:24:43,227 INFO L297 tatePredicateManager]: 23 out of 25 supporting invariants were superfluous and have been removed [2021-12-15 17:24:43,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:43,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-15 17:24:43,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:24:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:43,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-15 17:24:43,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:24:43,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:24:43,438 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2021-12-15 17:24:43,438 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 14 Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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) [2021-12-15 17:24:43,609 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 48 transitions. cyclomatic complexity: 14. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 48 states and 65 transitions. Complement of second has 11 states. [2021-12-15 17:24:43,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-15 17:24:43,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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) [2021-12-15 17:24:43,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2021-12-15 17:24:43,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 14 letters. Loop has 4 letters. [2021-12-15 17:24:43,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:24:43,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 18 letters. Loop has 4 letters. [2021-12-15 17:24:43,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:24:43,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 28 transitions. Stem has 14 letters. Loop has 8 letters. [2021-12-15 17:24:43,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:24:43,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 65 transitions. [2021-12-15 17:24:43,611 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:24:43,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 39 states and 50 transitions. [2021-12-15 17:24:43,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-12-15 17:24:43,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-12-15 17:24:43,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. [2021-12-15 17:24:43,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:24:43,612 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2021-12-15 17:24:43,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. [2021-12-15 17:24:43,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-12-15 17:24:43,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 38 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) [2021-12-15 17:24:43,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2021-12-15 17:24:43,614 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2021-12-15 17:24:43,614 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2021-12-15 17:24:43,614 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-15 17:24:43,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 50 transitions. [2021-12-15 17:24:43,614 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:24:43,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:24:43,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:24:43,615 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:24:43,615 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:24:43,615 INFO L791 eck$LassoCheckResult]: Stem: 920#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 921#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 934#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 935#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 940#L23 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 939#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 937#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 938#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 942#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 948#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 947#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 946#L22-3 assume !(max_~i~0#1 < ~N~0); 945#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 944#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 943#L22-8 assume !(max_~i~0#1 < ~N~0); 931#L22-9 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 930#L25-1 main_#t~ret9#1 := max_#res#1;assume { :end_inline_max } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0; 926#L43-3 [2021-12-15 17:24:43,615 INFO L793 eck$LassoCheckResult]: Loop: 926#L43-3 assume !!(main_~i~1#1 < ~N~0 - 1);call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem12#1; 925#L43-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 926#L43-3 [2021-12-15 17:24:43,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:43,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1591298555, now seen corresponding path program 1 times [2021-12-15 17:24:43,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:43,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874208375] [2021-12-15 17:24:43,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:43,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:43,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-15 17:24:43,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:24:43,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874208375] [2021-12-15 17:24:43,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874208375] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:24:43,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:24:43,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 17:24:43,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927898554] [2021-12-15 17:24:43,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:24:43,638 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:24:43,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:43,638 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 1 times [2021-12-15 17:24:43,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:43,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448580459] [2021-12-15 17:24:43,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:43,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:43,641 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:43,643 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:43,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:24:43,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 17:24:43,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 17:24:43,678 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. cyclomatic complexity: 15 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:24:43,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:24:43,702 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2021-12-15 17:24:43,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 17:24:43,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 57 transitions. [2021-12-15 17:24:43,703 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:24:43,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 57 transitions. [2021-12-15 17:24:43,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-12-15 17:24:43,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-12-15 17:24:43,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 57 transitions. [2021-12-15 17:24:43,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:24:43,705 INFO L681 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2021-12-15 17:24:43,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 57 transitions. [2021-12-15 17:24:43,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2021-12-15 17:24:43,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 38 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:24:43,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2021-12-15 17:24:43,707 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2021-12-15 17:24:43,707 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2021-12-15 17:24:43,707 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-15 17:24:43,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 48 transitions. [2021-12-15 17:24:43,707 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:24:43,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:24:43,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:24:43,708 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:24:43,708 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:24:43,708 INFO L791 eck$LassoCheckResult]: Stem: 1012#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 1013#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1026#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1027#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1032#L23 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 1033#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1046#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1045#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1038#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1043#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1041#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1036#L22-3 assume !(max_~i~0#1 < ~N~0); 1037#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 1039#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1022#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1023#L23-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1008#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1009#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1021#L22-8 assume !(max_~i~0#1 < ~N~0); 1024#L22-9 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 1025#L25-1 main_#t~ret9#1 := max_#res#1;assume { :end_inline_max } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0; 1018#L43-3 [2021-12-15 17:24:43,708 INFO L793 eck$LassoCheckResult]: Loop: 1018#L43-3 assume !!(main_~i~1#1 < ~N~0 - 1);call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem12#1; 1017#L43-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1018#L43-3 [2021-12-15 17:24:43,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:43,708 INFO L85 PathProgramCache]: Analyzing trace with hash -18080898, now seen corresponding path program 1 times [2021-12-15 17:24:43,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:43,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596320874] [2021-12-15 17:24:43,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:43,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:43,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:43,779 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-15 17:24:43,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:24:43,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596320874] [2021-12-15 17:24:43,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596320874] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:24:43,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392578662] [2021-12-15 17:24:43,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:43,780 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:24:43,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:43,781 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:24:43,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2021-12-15 17:24:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:43,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 17:24:43,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:24:43,880 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-15 17:24:43,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:24:43,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-15 17:24:43,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392578662] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:24:43,921 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:24:43,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2021-12-15 17:24:43,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573239035] [2021-12-15 17:24:43,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:24:43,922 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:24:43,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:43,922 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 2 times [2021-12-15 17:24:43,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:43,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534423271] [2021-12-15 17:24:43,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:43,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:43,925 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:43,927 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:43,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:24:43,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 17:24:43,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-12-15 17:24:43,971 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. cyclomatic complexity: 13 Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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) [2021-12-15 17:24:44,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:24:44,027 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2021-12-15 17:24:44,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 17:24:44,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 71 transitions. [2021-12-15 17:24:44,029 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:24:44,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 71 transitions. [2021-12-15 17:24:44,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2021-12-15 17:24:44,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2021-12-15 17:24:44,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 71 transitions. [2021-12-15 17:24:44,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:24:44,030 INFO L681 BuchiCegarLoop]: Abstraction has 57 states and 71 transitions. [2021-12-15 17:24:44,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 71 transitions. [2021-12-15 17:24:44,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2021-12-15 17:24:44,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 42 states have internal predecessors, (53), 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) [2021-12-15 17:24:44,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2021-12-15 17:24:44,035 INFO L704 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2021-12-15 17:24:44,035 INFO L587 BuchiCegarLoop]: Abstraction has 43 states and 53 transitions. [2021-12-15 17:24:44,035 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-15 17:24:44,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 53 transitions. [2021-12-15 17:24:44,035 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:24:44,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:24:44,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:24:44,036 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:24:44,036 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:24:44,036 INFO L791 eck$LassoCheckResult]: Stem: 1241#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 1242#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1255#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1256#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1264#L23 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 1261#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1258#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1259#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1262#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1263#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1274#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1272#L22-3 assume !(max_~i~0#1 < ~N~0); 1270#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 1269#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1268#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1267#L23-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1266#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1265#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1252#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1253#L23-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1237#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1238#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1250#L22-8 assume !(max_~i~0#1 < ~N~0); 1260#L22-9 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 1254#L25-1 main_#t~ret9#1 := max_#res#1;assume { :end_inline_max } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0; 1247#L43-3 [2021-12-15 17:24:44,036 INFO L793 eck$LassoCheckResult]: Loop: 1247#L43-3 assume !!(main_~i~1#1 < ~N~0 - 1);call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem12#1; 1246#L43-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1247#L43-3 [2021-12-15 17:24:44,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:44,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2011161481, now seen corresponding path program 2 times [2021-12-15 17:24:44,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:44,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233575639] [2021-12-15 17:24:44,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:44,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:44,268 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:24:44,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:24:44,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233575639] [2021-12-15 17:24:44,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233575639] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:24:44,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487716068] [2021-12-15 17:24:44,269 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 17:24:44,269 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:24:44,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:44,272 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:24:44,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-12-15 17:24:44,318 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 17:24:44,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:24:44,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-15 17:24:44,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:24:44,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-12-15 17:24:44,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 [2021-12-15 17:24:44,525 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 17:24:44,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:24:44,673 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 17:24:44,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 22 [2021-12-15 17:24:44,726 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 17:24:44,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487716068] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:24:44,727 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:24:44,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2021-12-15 17:24:44,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645884784] [2021-12-15 17:24:44,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:24:44,727 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:24:44,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:44,727 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 3 times [2021-12-15 17:24:44,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:44,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675072845] [2021-12-15 17:24:44,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:44,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:44,730 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:44,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:44,732 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:44,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:24:44,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-15 17:24:44,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2021-12-15 17:24:44,776 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. cyclomatic complexity: 14 Second operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:24:45,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:24:45,225 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2021-12-15 17:24:45,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-15 17:24:45,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 126 transitions. [2021-12-15 17:24:45,226 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2021-12-15 17:24:45,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 103 states and 126 transitions. [2021-12-15 17:24:45,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2021-12-15 17:24:45,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2021-12-15 17:24:45,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 126 transitions. [2021-12-15 17:24:45,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:24:45,227 INFO L681 BuchiCegarLoop]: Abstraction has 103 states and 126 transitions. [2021-12-15 17:24:45,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 126 transitions. [2021-12-15 17:24:45,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 55. [2021-12-15 17:24:45,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 54 states have internal predecessors, (68), 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) [2021-12-15 17:24:45,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2021-12-15 17:24:45,230 INFO L704 BuchiCegarLoop]: Abstraction has 55 states and 68 transitions. [2021-12-15 17:24:45,230 INFO L587 BuchiCegarLoop]: Abstraction has 55 states and 68 transitions. [2021-12-15 17:24:45,230 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-15 17:24:45,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 68 transitions. [2021-12-15 17:24:45,231 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2021-12-15 17:24:45,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:24:45,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:24:45,231 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:24:45,231 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-15 17:24:45,232 INFO L791 eck$LassoCheckResult]: Stem: 1576#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 1577#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1589#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1590#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1599#L23 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 1595#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1596#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1600#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1597#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1598#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1606#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1605#L22-3 assume !(max_~i~0#1 < ~N~0); 1591#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 1583#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1584#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1587#L23-3 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 1574#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1575#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1585#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1588#L23-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 1602#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1604#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1603#L22-8 assume !(max_~i~0#1 < ~N~0); 1594#L22-9 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 1586#L25-1 main_#t~ret9#1 := max_#res#1;assume { :end_inline_max } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0; 1582#L43-3 [2021-12-15 17:24:45,232 INFO L793 eck$LassoCheckResult]: Loop: 1582#L43-3 assume !!(main_~i~1#1 < ~N~0 - 1);call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem12#1; 1581#L43-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1582#L43-3 [2021-12-15 17:24:45,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:45,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1618134471, now seen corresponding path program 1 times [2021-12-15 17:24:45,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:45,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204950587] [2021-12-15 17:24:45,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:45,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:45,249 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:45,273 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:45,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:45,277 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 4 times [2021-12-15 17:24:45,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:45,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932447494] [2021-12-15 17:24:45,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:45,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:45,281 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:45,285 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:45,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:45,287 INFO L85 PathProgramCache]: Analyzing trace with hash -249063589, now seen corresponding path program 1 times [2021-12-15 17:24:45,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:45,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242530829] [2021-12-15 17:24:45,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:45,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:45,332 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:45,350 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:47,322 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:24:47,322 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:24:47,322 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:24:47,322 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:24:47,322 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:24:47,322 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:47,322 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:24:47,322 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:24:47,322 INFO L133 ssoRankerPreferences]: Filename of dumped script: max.i_Iteration9_Lasso [2021-12-15 17:24:47,322 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:24:47,322 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:24:47,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:47,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:47,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:47,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:47,791 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2021-12-15 17:24:48,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:49,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:49,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:49,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:49,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:49,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:49,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:49,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:49,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:49,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:49,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:49,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:49,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:49,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:49,755 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:24:49,755 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:24:49,755 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:49,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:49,756 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) [2021-12-15 17:24:49,758 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 [2021-12-15 17:24:49,759 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 [2021-12-15 17:24:49,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:49,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:24:49,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:49,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:49,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:49,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:24:49,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:24:49,766 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:49,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:49,783 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:49,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:49,784 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) [2021-12-15 17:24:49,785 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 [2021-12-15 17:24:49,787 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 [2021-12-15 17:24:49,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:49,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:49,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:49,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:49,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:49,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:49,796 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:49,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:49,813 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:49,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:49,814 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) [2021-12-15 17:24:49,817 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 [2021-12-15 17:24:49,818 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 [2021-12-15 17:24:49,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:49,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:24:49,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:49,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:49,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:49,824 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:24:49,824 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:24:49,825 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:49,843 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 [2021-12-15 17:24:49,844 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:49,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:49,845 INFO L229 MonitoredProcess]: Starting monitored process 29 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) [2021-12-15 17:24:49,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-12-15 17:24:49,847 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 [2021-12-15 17:24:49,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:49,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:49,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:49,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:49,854 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:49,854 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:49,863 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:49,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:49,880 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:49,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:49,889 INFO L229 MonitoredProcess]: Starting monitored process 30 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) [2021-12-15 17:24:49,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-12-15 17:24:49,891 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 [2021-12-15 17:24:49,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:49,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:49,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:49,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:49,898 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:49,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:49,908 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:49,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2021-12-15 17:24:49,923 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:49,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:49,924 INFO L229 MonitoredProcess]: Starting monitored process 31 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) [2021-12-15 17:24:49,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-12-15 17:24:49,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:49,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:49,932 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2021-12-15 17:24:49,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:49,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:49,960 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2021-12-15 17:24:49,960 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:49,972 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:49,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2021-12-15 17:24:49,995 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:49,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:49,996 INFO L229 MonitoredProcess]: Starting monitored process 32 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) [2021-12-15 17:24:49,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-12-15 17:24:49,997 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 [2021-12-15 17:24:50,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:50,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:50,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:50,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:50,005 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:50,005 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:50,020 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:50,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2021-12-15 17:24:50,037 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:50,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:50,038 INFO L229 MonitoredProcess]: Starting monitored process 33 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) [2021-12-15 17:24:50,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-12-15 17:24:50,040 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 [2021-12-15 17:24:50,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:50,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:50,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:50,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:50,047 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:50,047 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:50,053 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:50,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:50,070 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:50,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:50,071 INFO L229 MonitoredProcess]: Starting monitored process 34 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) [2021-12-15 17:24:50,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-12-15 17:24:50,073 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 [2021-12-15 17:24:50,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:50,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:50,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:50,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:50,081 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:50,081 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:50,084 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:50,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2021-12-15 17:24:50,099 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:50,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:50,100 INFO L229 MonitoredProcess]: Starting monitored process 35 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) [2021-12-15 17:24:50,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-12-15 17:24:50,106 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 [2021-12-15 17:24:50,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:50,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:50,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:50,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:50,113 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:50,113 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:50,139 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:50,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:50,157 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:50,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:50,158 INFO L229 MonitoredProcess]: Starting monitored process 36 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) [2021-12-15 17:24:50,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-12-15 17:24:50,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:50,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:50,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:50,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:50,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:50,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:50,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:50,175 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:50,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2021-12-15 17:24:50,191 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:50,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:50,192 INFO L229 MonitoredProcess]: Starting monitored process 37 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) [2021-12-15 17:24:50,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-12-15 17:24:50,194 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 [2021-12-15 17:24:50,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:50,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:50,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:50,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:50,201 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:50,201 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:50,204 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:50,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2021-12-15 17:24:50,227 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:50,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:50,228 INFO L229 MonitoredProcess]: Starting monitored process 38 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) [2021-12-15 17:24:50,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-12-15 17:24:50,230 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 [2021-12-15 17:24:50,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:50,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:50,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:50,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:50,237 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:50,237 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:50,240 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:50,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2021-12-15 17:24:50,256 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:50,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:50,257 INFO L229 MonitoredProcess]: Starting monitored process 39 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) [2021-12-15 17:24:50,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-12-15 17:24:50,259 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 [2021-12-15 17:24:50,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:50,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:50,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:50,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:50,267 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:50,267 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:50,282 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:50,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:50,309 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:50,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:50,316 INFO L229 MonitoredProcess]: Starting monitored process 40 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) [2021-12-15 17:24:50,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-12-15 17:24:50,323 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 [2021-12-15 17:24:50,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:50,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:50,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:50,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:50,330 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:50,330 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:50,332 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:50,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:50,351 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:50,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:50,352 INFO L229 MonitoredProcess]: Starting monitored process 41 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) [2021-12-15 17:24:50,354 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 [2021-12-15 17:24:50,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-12-15 17:24:50,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:50,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:50,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:50,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:50,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:50,362 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:50,365 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:50,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2021-12-15 17:24:50,384 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:50,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:50,385 INFO L229 MonitoredProcess]: Starting monitored process 42 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) [2021-12-15 17:24:50,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-12-15 17:24:50,387 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 [2021-12-15 17:24:50,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:50,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:50,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:50,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:50,394 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:50,394 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:50,409 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:50,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2021-12-15 17:24:50,426 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:50,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:50,427 INFO L229 MonitoredProcess]: Starting monitored process 43 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) [2021-12-15 17:24:50,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-12-15 17:24:50,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:50,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:50,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:50,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:50,434 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:50,436 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:50,436 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:50,451 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:50,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:50,470 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:50,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:50,471 INFO L229 MonitoredProcess]: Starting monitored process 44 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) [2021-12-15 17:24:50,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-12-15 17:24:50,473 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 [2021-12-15 17:24:50,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:50,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:50,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:50,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:50,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:50,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:50,491 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:50,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2021-12-15 17:24:50,510 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:50,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:50,511 INFO L229 MonitoredProcess]: Starting monitored process 45 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) [2021-12-15 17:24:50,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-12-15 17:24:50,513 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 [2021-12-15 17:24:50,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:50,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:50,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:50,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:50,524 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:50,524 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:50,533 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:24:50,564 INFO L443 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2021-12-15 17:24:50,564 INFO L444 ModelExtractionUtils]: 7 out of 28 variables were initially zero. Simplification set additionally 18 variables to zero. [2021-12-15 17:24:50,564 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:50,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:50,568 INFO L229 MonitoredProcess]: Starting monitored process 46 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) [2021-12-15 17:24:50,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-12-15 17:24:50,569 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:24:50,575 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:24:50,575 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:24:50,575 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1, v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_3) = -4*ULTIMATE.start_main_~i~1#1 + 1*v_rep(select #length ULTIMATE.start_main_~#x~0#1.base)_3 Supporting invariants [] [2021-12-15 17:24:50,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2021-12-15 17:24:50,709 INFO L297 tatePredicateManager]: 45 out of 46 supporting invariants were superfluous and have been removed [2021-12-15 17:24:50,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:50,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 17:24:50,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:24:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:50,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 17:24:50,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:24:50,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:24:50,936 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2021-12-15 17:24:50,936 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 68 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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) [2021-12-15 17:24:50,965 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 68 transitions. cyclomatic complexity: 18. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 62 states and 80 transitions. Complement of second has 7 states. [2021-12-15 17:24:50,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-15 17:24:50,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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) [2021-12-15 17:24:50,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2021-12-15 17:24:50,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 25 letters. Loop has 2 letters. [2021-12-15 17:24:50,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:24:50,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 27 letters. Loop has 2 letters. [2021-12-15 17:24:50,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:24:50,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 25 letters. Loop has 4 letters. [2021-12-15 17:24:50,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:24:50,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 80 transitions. [2021-12-15 17:24:50,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-15 17:24:50,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 56 states and 70 transitions. [2021-12-15 17:24:50,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-12-15 17:24:50,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2021-12-15 17:24:50,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 70 transitions. [2021-12-15 17:24:50,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:24:50,969 INFO L681 BuchiCegarLoop]: Abstraction has 56 states and 70 transitions. [2021-12-15 17:24:50,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 70 transitions. [2021-12-15 17:24:50,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-12-15 17:24:50,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.25) internal successors, (70), 55 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:24:50,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2021-12-15 17:24:50,974 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 70 transitions. [2021-12-15 17:24:50,974 INFO L587 BuchiCegarLoop]: Abstraction has 56 states and 70 transitions. [2021-12-15 17:24:50,974 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-15 17:24:50,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 70 transitions. [2021-12-15 17:24:50,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-15 17:24:50,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:24:50,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:24:50,976 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:24:50,976 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-15 17:24:50,981 INFO L791 eck$LassoCheckResult]: Stem: 1988#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 1989#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 2005#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 2006#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2011#L23 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 2012#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2039#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2038#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2028#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2035#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2032#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2027#L22-3 assume !(max_~i~0#1 < ~N~0); 2025#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 2023#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 2022#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2020#L23-3 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 1984#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1985#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2018#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2015#L23-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2017#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2016#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2014#L22-8 assume !(max_~i~0#1 < ~N~0); 2009#L22-9 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 2002#L25-1 main_#t~ret9#1 := max_#res#1;assume { :end_inline_max } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0; 2003#L43-3 assume !(main_~i~1#1 < ~N~0 - 1); 1990#L43-4 call write~int(main_~temp~0#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (~N~0 - 1), 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 1987#L22-13 [2021-12-15 17:24:50,981 INFO L793 eck$LassoCheckResult]: Loop: 1987#L22-13 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 1991#L23-6 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 1992#L23-8 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 1986#L22-12 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 1987#L22-13 [2021-12-15 17:24:50,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:50,982 INFO L85 PathProgramCache]: Analyzing trace with hash -249063647, now seen corresponding path program 1 times [2021-12-15 17:24:50,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:50,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152685698] [2021-12-15 17:24:50,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:50,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:51,023 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-15 17:24:51,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:24:51,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152685698] [2021-12-15 17:24:51,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152685698] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:24:51,024 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:24:51,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 17:24:51,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360053765] [2021-12-15 17:24:51,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:24:51,026 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:24:51,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:51,026 INFO L85 PathProgramCache]: Analyzing trace with hash 3173862, now seen corresponding path program 1 times [2021-12-15 17:24:51,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:51,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055750628] [2021-12-15 17:24:51,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:51,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:51,031 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:51,033 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:51,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:24:51,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 17:24:51,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 17:24:51,070 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. cyclomatic complexity: 19 Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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) [2021-12-15 17:24:51,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:24:51,088 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2021-12-15 17:24:51,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 17:24:51,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 70 transitions. [2021-12-15 17:24:51,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-15 17:24:51,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 70 transitions. [2021-12-15 17:24:51,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2021-12-15 17:24:51,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2021-12-15 17:24:51,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 70 transitions. [2021-12-15 17:24:51,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:24:51,090 INFO L681 BuchiCegarLoop]: Abstraction has 57 states and 70 transitions. [2021-12-15 17:24:51,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 70 transitions. [2021-12-15 17:24:51,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2021-12-15 17:24:51,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 55 states have internal predecessors, (69), 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) [2021-12-15 17:24:51,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2021-12-15 17:24:51,093 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 69 transitions. [2021-12-15 17:24:51,093 INFO L587 BuchiCegarLoop]: Abstraction has 56 states and 69 transitions. [2021-12-15 17:24:51,093 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-15 17:24:51,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 69 transitions. [2021-12-15 17:24:51,094 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-15 17:24:51,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:24:51,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:24:51,094 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:24:51,095 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-15 17:24:51,095 INFO L791 eck$LassoCheckResult]: Stem: 2108#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 2109#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 2123#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 2124#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2132#L23 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 2129#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2126#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2127#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2130#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2131#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2158#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2156#L22-3 assume !(max_~i~0#1 < ~N~0); 2146#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 2144#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 2142#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2139#L23-3 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 2104#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2105#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2137#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2134#L23-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2136#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2135#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2133#L22-8 assume !(max_~i~0#1 < ~N~0); 2128#L22-9 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 2121#L25-1 main_#t~ret9#1 := max_#res#1;assume { :end_inline_max } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0; 2122#L43-3 assume !!(main_~i~1#1 < ~N~0 - 1);call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem12#1; 2113#L43-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2114#L43-3 assume !(main_~i~1#1 < ~N~0 - 1); 2110#L43-4 call write~int(main_~temp~0#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (~N~0 - 1), 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 2107#L22-13 [2021-12-15 17:24:51,095 INFO L793 eck$LassoCheckResult]: Loop: 2107#L22-13 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2111#L23-6 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 2112#L23-8 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2106#L22-12 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2107#L22-13 [2021-12-15 17:24:51,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:51,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1168061379, now seen corresponding path program 1 times [2021-12-15 17:24:51,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:51,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174035594] [2021-12-15 17:24:51,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:51,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:51,113 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:51,146 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:51,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:51,147 INFO L85 PathProgramCache]: Analyzing trace with hash 3173862, now seen corresponding path program 2 times [2021-12-15 17:24:51,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:51,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816430663] [2021-12-15 17:24:51,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:51,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:51,156 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:51,157 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:51,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:51,158 INFO L85 PathProgramCache]: Analyzing trace with hash 934015144, now seen corresponding path program 1 times [2021-12-15 17:24:51,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:51,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684095950] [2021-12-15 17:24:51,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:51,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:51,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:51,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2021-12-15 17:24:51,180 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:51,200 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:55,030 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:24:55,030 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:24:55,030 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:24:55,030 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:24:55,030 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:24:55,030 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:55,030 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:24:55,030 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:24:55,031 INFO L133 ssoRankerPreferences]: Filename of dumped script: max.i_Iteration11_Lasso [2021-12-15 17:24:55,031 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:24:55,031 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:24:55,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:55,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:55,549 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2021-12-15 17:24:56,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:56,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:56,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:56,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:56,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:56,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:56,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:56,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:56,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:56,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:56,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:56,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:56,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:56,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:56,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:56,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:56,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:24:57,546 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:24:57,546 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:24:57,546 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:57,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:57,547 INFO L229 MonitoredProcess]: Starting monitored process 47 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) [2021-12-15 17:24:57,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-12-15 17:24:57,549 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 [2021-12-15 17:24:57,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:57,555 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:24:57,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:57,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:57,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:57,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:24:57,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:24:57,556 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:57,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2021-12-15 17:24:57,571 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:57,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:57,572 INFO L229 MonitoredProcess]: Starting monitored process 48 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) [2021-12-15 17:24:57,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-12-15 17:24:57,577 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 [2021-12-15 17:24:57,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:57,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:57,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:57,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:57,583 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:57,584 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:57,586 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:57,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2021-12-15 17:24:57,607 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:57,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:57,608 INFO L229 MonitoredProcess]: Starting monitored process 49 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) [2021-12-15 17:24:57,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-12-15 17:24:57,610 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 [2021-12-15 17:24:57,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:57,615 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2021-12-15 17:24:57,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:57,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:57,623 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2021-12-15 17:24:57,623 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:57,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:57,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2021-12-15 17:24:57,650 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:57,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:57,651 INFO L229 MonitoredProcess]: Starting monitored process 50 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) [2021-12-15 17:24:57,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-12-15 17:24:57,652 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 [2021-12-15 17:24:57,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:57,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:57,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:57,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:57,659 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:57,659 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:57,661 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:57,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2021-12-15 17:24:57,677 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:57,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:57,677 INFO L229 MonitoredProcess]: Starting monitored process 51 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) [2021-12-15 17:24:57,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-12-15 17:24:57,679 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 [2021-12-15 17:24:57,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:57,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:57,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:57,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:57,686 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:57,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:57,688 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:57,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2021-12-15 17:24:57,703 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:57,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:57,704 INFO L229 MonitoredProcess]: Starting monitored process 52 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) [2021-12-15 17:24:57,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-12-15 17:24:57,705 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 [2021-12-15 17:24:57,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:57,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:57,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:57,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:57,712 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:57,712 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:57,714 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:57,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2021-12-15 17:24:57,730 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:57,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:57,730 INFO L229 MonitoredProcess]: Starting monitored process 53 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) [2021-12-15 17:24:57,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-12-15 17:24:57,732 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 [2021-12-15 17:24:57,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:57,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:57,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:57,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:57,740 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:57,740 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:57,743 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:57,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2021-12-15 17:24:57,759 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:57,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:57,759 INFO L229 MonitoredProcess]: Starting monitored process 54 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) [2021-12-15 17:24:57,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-12-15 17:24:57,761 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 [2021-12-15 17:24:57,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:57,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:57,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:57,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:57,768 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:57,768 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:57,770 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:57,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:57,788 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:57,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:57,789 INFO L229 MonitoredProcess]: Starting monitored process 55 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) [2021-12-15 17:24:57,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2021-12-15 17:24:57,792 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 [2021-12-15 17:24:57,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:57,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:57,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:57,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:57,801 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:57,801 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:57,805 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:57,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:57,822 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:57,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:57,822 INFO L229 MonitoredProcess]: Starting monitored process 56 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) [2021-12-15 17:24:57,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:57,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:57,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:57,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:57,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:57,843 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:57,843 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:57,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2021-12-15 17:24:57,855 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:57,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:57,889 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:57,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:57,890 INFO L229 MonitoredProcess]: Starting monitored process 57 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) [2021-12-15 17:24:57,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2021-12-15 17:24:57,892 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 [2021-12-15 17:24:57,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:57,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:57,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:57,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:57,898 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:57,898 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:57,900 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:57,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:57,916 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:57,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:57,916 INFO L229 MonitoredProcess]: Starting monitored process 58 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) [2021-12-15 17:24:57,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2021-12-15 17:24:57,918 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 [2021-12-15 17:24:57,924 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:57,924 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:57,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:57,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:57,925 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:57,925 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:57,927 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:57,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:57,944 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:57,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:57,944 INFO L229 MonitoredProcess]: Starting monitored process 59 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) [2021-12-15 17:24:57,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2021-12-15 17:24:57,946 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 [2021-12-15 17:24:57,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:57,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:57,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:57,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:57,953 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:57,953 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:57,968 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:57,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2021-12-15 17:24:57,984 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:57,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:57,985 INFO L229 MonitoredProcess]: Starting monitored process 60 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) [2021-12-15 17:24:57,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2021-12-15 17:24:57,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:24:57,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:57,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:57,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:57,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:57,994 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:57,994 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:57,996 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:58,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2021-12-15 17:24:58,011 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:58,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:58,012 INFO L229 MonitoredProcess]: Starting monitored process 61 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) [2021-12-15 17:24:58,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2021-12-15 17:24:58,014 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 [2021-12-15 17:24:58,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:58,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:58,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:58,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:58,021 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:58,021 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:58,022 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:58,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2021-12-15 17:24:58,038 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:58,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:58,039 INFO L229 MonitoredProcess]: Starting monitored process 62 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) [2021-12-15 17:24:58,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2021-12-15 17:24:58,041 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 [2021-12-15 17:24:58,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:58,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:58,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:58,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:58,048 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:58,048 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:58,051 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:24:58,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2021-12-15 17:24:58,066 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:58,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:58,067 INFO L229 MonitoredProcess]: Starting monitored process 63 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) [2021-12-15 17:24:58,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2021-12-15 17:24:58,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 [2021-12-15 17:24:58,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:24:58,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:24:58,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:24:58,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:24:58,079 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:24:58,080 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:24:58,090 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:24:58,100 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-12-15 17:24:58,101 INFO L444 ModelExtractionUtils]: 18 out of 28 variables were initially zero. Simplification set additionally 7 variables to zero. [2021-12-15 17:24:58,101 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:24:58,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:58,102 INFO L229 MonitoredProcess]: Starting monitored process 64 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) [2021-12-15 17:24:58,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2021-12-15 17:24:58,104 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:24:58,111 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:24:58,111 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:24:58,111 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0#1) = -2*ULTIMATE.start_max_~i~0#1 + 3 Supporting invariants [] [2021-12-15 17:24:58,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2021-12-15 17:24:58,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2021-12-15 17:24:58,262 INFO L297 tatePredicateManager]: 41 out of 43 supporting invariants were superfluous and have been removed [2021-12-15 17:24:58,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:58,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-15 17:24:58,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:24:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:58,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 17:24:58,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:24:58,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:24:58,603 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2021-12-15 17:24:58,603 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 69 transitions. cyclomatic complexity: 18 Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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) [2021-12-15 17:24:58,747 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 69 transitions. cyclomatic complexity: 18. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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 104 states and 131 transitions. Complement of second has 12 states. [2021-12-15 17:24:58,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 7 stem states 1 non-accepting loop states 2 accepting loop states [2021-12-15 17:24:58,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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) [2021-12-15 17:24:58,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 64 transitions. [2021-12-15 17:24:58,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 64 transitions. Stem has 29 letters. Loop has 4 letters. [2021-12-15 17:24:58,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:24:58,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 64 transitions. Stem has 33 letters. Loop has 4 letters. [2021-12-15 17:24:58,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:24:58,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 64 transitions. Stem has 29 letters. Loop has 8 letters. [2021-12-15 17:24:58,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:24:58,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 131 transitions. [2021-12-15 17:24:58,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-15 17:24:58,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 67 states and 83 transitions. [2021-12-15 17:24:58,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-12-15 17:24:58,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-12-15 17:24:58,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 83 transitions. [2021-12-15 17:24:58,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:24:58,752 INFO L681 BuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2021-12-15 17:24:58,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 83 transitions. [2021-12-15 17:24:58,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2021-12-15 17:24:58,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 55 states have internal predecessors, (69), 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) [2021-12-15 17:24:58,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2021-12-15 17:24:58,754 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 69 transitions. [2021-12-15 17:24:58,754 INFO L587 BuchiCegarLoop]: Abstraction has 56 states and 69 transitions. [2021-12-15 17:24:58,754 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-15 17:24:58,754 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 69 transitions. [2021-12-15 17:24:58,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-15 17:24:58,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:24:58,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:24:58,756 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:24:58,757 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-15 17:24:58,757 INFO L791 eck$LassoCheckResult]: Stem: 2588#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 2589#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 2604#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 2605#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2614#L23 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 2639#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2638#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2637#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2636#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2635#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2634#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2633#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2624#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2630#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2627#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2623#L22-3 assume !(max_~i~0#1 < ~N~0); 2622#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 2595#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 2596#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2621#L23-3 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 2586#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2587#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2619#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2616#L23-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2618#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2617#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2615#L22-8 assume !(max_~i~0#1 < ~N~0); 2610#L22-9 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 2602#L25-1 main_#t~ret9#1 := max_#res#1;assume { :end_inline_max } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0; 2603#L43-3 assume !!(main_~i~1#1 < ~N~0 - 1);call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem12#1; 2593#L43-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2594#L43-3 assume !(main_~i~1#1 < ~N~0 - 1); 2590#L43-4 call write~int(main_~temp~0#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (~N~0 - 1), 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 2585#L22-13 [2021-12-15 17:24:58,757 INFO L793 eck$LassoCheckResult]: Loop: 2585#L22-13 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2591#L23-6 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 2592#L23-8 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2584#L22-12 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2585#L22-13 [2021-12-15 17:24:58,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:58,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1580658666, now seen corresponding path program 2 times [2021-12-15 17:24:58,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:58,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191127485] [2021-12-15 17:24:58,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:58,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:58,831 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 17:24:58,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:24:58,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191127485] [2021-12-15 17:24:58,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191127485] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:24:58,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594932123] [2021-12-15 17:24:58,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 17:24:58,833 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:24:58,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:58,840 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:24:58,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2021-12-15 17:24:58,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 17:24:58,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:24:58,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 17:24:58,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:24:59,000 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 17:24:59,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:24:59,056 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 17:24:59,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594932123] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:24:59,057 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:24:59,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2021-12-15 17:24:59,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421613307] [2021-12-15 17:24:59,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:24:59,057 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:24:59,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:59,058 INFO L85 PathProgramCache]: Analyzing trace with hash 3173862, now seen corresponding path program 3 times [2021-12-15 17:24:59,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:59,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701786187] [2021-12-15 17:24:59,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:59,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:59,060 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:59,062 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:59,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:24:59,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-15 17:24:59,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2021-12-15 17:24:59,103 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. cyclomatic complexity: 18 Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 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) [2021-12-15 17:24:59,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:24:59,276 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2021-12-15 17:24:59,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 17:24:59,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 93 transitions. [2021-12-15 17:24:59,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-15 17:24:59,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 75 states and 93 transitions. [2021-12-15 17:24:59,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2021-12-15 17:24:59,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2021-12-15 17:24:59,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 93 transitions. [2021-12-15 17:24:59,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:24:59,278 INFO L681 BuchiCegarLoop]: Abstraction has 75 states and 93 transitions. [2021-12-15 17:24:59,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 93 transitions. [2021-12-15 17:24:59,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2021-12-15 17:24:59,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 59 states have internal predecessors, (74), 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) [2021-12-15 17:24:59,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2021-12-15 17:24:59,283 INFO L704 BuchiCegarLoop]: Abstraction has 60 states and 74 transitions. [2021-12-15 17:24:59,283 INFO L587 BuchiCegarLoop]: Abstraction has 60 states and 74 transitions. [2021-12-15 17:24:59,283 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-15 17:24:59,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 74 transitions. [2021-12-15 17:24:59,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-15 17:24:59,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:24:59,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:24:59,288 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:24:59,288 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-15 17:24:59,288 INFO L791 eck$LassoCheckResult]: Stem: 2946#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 2947#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 2962#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 2963#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2970#L23 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 2971#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 3001#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 3000#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2999#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2997#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2995#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2993#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2989#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2991#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2981#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2982#L22-3 assume !(max_~i~0#1 < ~N~0); 2964#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 2965#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 2957#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2958#L23-3 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 2942#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2943#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2987#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2986#L23-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2985#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2984#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2983#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2975#L23-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 2977#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2976#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2974#L22-8 assume !(max_~i~0#1 < ~N~0); 2968#L22-9 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 2960#L25-1 main_#t~ret9#1 := max_#res#1;assume { :end_inline_max } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0; 2961#L43-3 assume !!(main_~i~1#1 < ~N~0 - 1);call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem12#1; 2951#L43-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 2952#L43-3 assume !(main_~i~1#1 < ~N~0 - 1); 2948#L43-4 call write~int(main_~temp~0#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (~N~0 - 1), 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 2945#L22-13 [2021-12-15 17:24:59,288 INFO L793 eck$LassoCheckResult]: Loop: 2945#L22-13 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 2949#L23-6 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 2950#L23-8 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 2944#L22-12 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 2945#L22-13 [2021-12-15 17:24:59,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:59,289 INFO L85 PathProgramCache]: Analyzing trace with hash 477776739, now seen corresponding path program 3 times [2021-12-15 17:24:59,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:59,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6127365] [2021-12-15 17:24:59,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:59,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:24:59,351 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-15 17:24:59,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:24:59,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6127365] [2021-12-15 17:24:59,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6127365] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 17:24:59,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900176193] [2021-12-15 17:24:59,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 17:24:59,352 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 17:24:59,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:24:59,368 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 17:24:59,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2021-12-15 17:24:59,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-15 17:24:59,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 17:24:59,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-15 17:24:59,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:24:59,519 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-15 17:24:59,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 17:24:59,572 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-15 17:24:59,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900176193] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 17:24:59,573 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 17:24:59,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2021-12-15 17:24:59,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209643472] [2021-12-15 17:24:59,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 17:24:59,573 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:24:59,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:59,573 INFO L85 PathProgramCache]: Analyzing trace with hash 3173862, now seen corresponding path program 4 times [2021-12-15 17:24:59,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:59,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921192785] [2021-12-15 17:24:59,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:59,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:59,576 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:59,578 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:59,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:24:59,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 17:24:59,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-12-15 17:24:59,615 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. cyclomatic complexity: 19 Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 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) [2021-12-15 17:24:59,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:24:59,776 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2021-12-15 17:24:59,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 17:24:59,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 87 transitions. [2021-12-15 17:24:59,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-15 17:24:59,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 87 transitions. [2021-12-15 17:24:59,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2021-12-15 17:24:59,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2021-12-15 17:24:59,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 87 transitions. [2021-12-15 17:24:59,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:24:59,778 INFO L681 BuchiCegarLoop]: Abstraction has 71 states and 87 transitions. [2021-12-15 17:24:59,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 87 transitions. [2021-12-15 17:24:59,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2021-12-15 17:24:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 61 states have internal predecessors, (76), 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) [2021-12-15 17:24:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2021-12-15 17:24:59,780 INFO L704 BuchiCegarLoop]: Abstraction has 62 states and 76 transitions. [2021-12-15 17:24:59,780 INFO L587 BuchiCegarLoop]: Abstraction has 62 states and 76 transitions. [2021-12-15 17:24:59,780 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-12-15 17:24:59,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 76 transitions. [2021-12-15 17:24:59,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-15 17:24:59,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:24:59,781 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:24:59,781 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:24:59,781 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-15 17:24:59,781 INFO L791 eck$LassoCheckResult]: Stem: 3328#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(6, 2);call write~init~int(109, 2, 0, 1);call write~init~int(97, 2, 1, 1);call write~init~int(120, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);~N~0 := 0; 3329#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~ret9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~post11#1, main_~i~1#1, main_#t~ret13#1, main_~#x~0#1.base, main_~#x~0#1.offset, main_~temp~0#1, main_~ret~1#1, main_~ret2~0#1, main_~ret5~0#1;~N~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 3343#L31 assume ~N~0 > 1;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 3344#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 3353#L23 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 3352#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 3347#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 3348#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 3355#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 3382#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 3380#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 3378#L22-3 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 3372#L23 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 3376#L23-2 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 3374#L22-2 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 3371#L22-3 assume !(max_~i~0#1 < ~N~0); 3368#L22-4 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 3335#L25 main_#t~ret6#1 := max_#res#1;assume { :end_inline_max } true;main_~ret~1#1 := main_#t~ret6#1;havoc main_#t~ret6#1;call main_#t~mem7#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem7#1;havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int(main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);call write~int(main_#t~mem8#1, main_~#x~0#1.base, main_~#x~0#1.offset, 4);havoc main_#t~mem8#1;call write~int(main_~temp~0#1, main_~#x~0#1.base, 4 + main_~#x~0#1.offset, 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 3336#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 3339#L23-3 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 3324#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 3325#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 3365#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 3364#L23-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 3363#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 3362#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 3361#L22-8 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 3358#L23-3 assume !(max_~ret~0#1 < max_#t~mem2#1);max_#t~ite4#1 := max_~ret~0#1; 3360#L23-5 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 3359#L22-7 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 3357#L22-8 assume !(max_~i~0#1 < ~N~0); 3351#L22-9 max_#res#1 := (if max_~ret~0#1 % 4294967296 <= 2147483647 then max_~ret~0#1 % 4294967296 else max_~ret~0#1 % 4294967296 - 4294967296); 3341#L25-1 main_#t~ret9#1 := max_#res#1;assume { :end_inline_max } true;main_~ret2~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;call main_#t~mem10#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset, 4);main_~temp~0#1 := main_#t~mem10#1;havoc main_#t~mem10#1;main_~i~1#1 := 0; 3342#L43-3 assume !!(main_~i~1#1 < ~N~0 - 1);call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem12#1; 3349#L43-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 3350#L43-3 assume !!(main_~i~1#1 < ~N~0 - 1);call main_#t~mem12#1 := read~int(main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (1 + main_~i~1#1), 4);call write~int(main_#t~mem12#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~mem12#1; 3333#L43-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 3334#L43-3 assume !(main_~i~1#1 < ~N~0 - 1); 3330#L43-4 call write~int(main_~temp~0#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * (~N~0 - 1), 4);assume { :begin_inline_max } true;max_#in~x#1.base, max_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc max_#res#1;havoc max_#t~mem2#1, max_#t~ite4#1, max_#t~mem3#1, max_#t~post1#1, max_~x#1.base, max_~x#1.offset, max_~i~0#1, max_~ret~0#1;max_~x#1.base, max_~x#1.offset := max_#in~x#1.base, max_#in~x#1.offset;havoc max_~i~0#1;havoc max_~ret~0#1;max_~ret~0#1 := 0;max_~i~0#1 := 0; 3327#L22-13 [2021-12-15 17:24:59,782 INFO L793 eck$LassoCheckResult]: Loop: 3327#L22-13 assume !!(max_~i~0#1 < ~N~0);call max_#t~mem2#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4); 3331#L23-6 assume max_~ret~0#1 < max_#t~mem2#1;call max_#t~mem3#1 := read~int(max_~x#1.base, max_~x#1.offset + 4 * max_~i~0#1, 4);max_#t~ite4#1 := max_#t~mem3#1; 3332#L23-8 max_~ret~0#1 := max_#t~ite4#1;havoc max_#t~mem2#1;havoc max_#t~ite4#1;havoc max_#t~mem3#1; 3326#L22-12 max_#t~post1#1 := max_~i~0#1;max_~i~0#1 := 1 + max_#t~post1#1;havoc max_#t~post1#1; 3327#L22-13 [2021-12-15 17:24:59,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:59,782 INFO L85 PathProgramCache]: Analyzing trace with hash -417996923, now seen corresponding path program 4 times [2021-12-15 17:24:59,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:59,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485718558] [2021-12-15 17:24:59,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:59,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:59,794 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:59,821 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:59,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:59,822 INFO L85 PathProgramCache]: Analyzing trace with hash 3173862, now seen corresponding path program 5 times [2021-12-15 17:24:59,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:59,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791659052] [2021-12-15 17:24:59,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:59,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:59,824 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:59,826 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:24:59,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:24:59,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1568478358, now seen corresponding path program 2 times [2021-12-15 17:24:59,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:24:59,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332869731] [2021-12-15 17:24:59,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:24:59,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:24:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:59,839 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:24:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:24:59,855 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:25:02,663 INFO L210 LassoAnalysis]: Preferences: [2021-12-15 17:25:02,663 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-15 17:25:02,663 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-15 17:25:02,663 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-15 17:25:02,663 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-15 17:25:02,663 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:02,663 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-15 17:25:02,663 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-15 17:25:02,663 INFO L133 ssoRankerPreferences]: Filename of dumped script: max.i_Iteration14_Lasso [2021-12-15 17:25:02,663 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-15 17:25:02,664 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-15 17:25:02,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:02,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:02,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:02,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:02,893 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2021-12-15 17:25:03,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:03,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:03,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:03,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:03,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:03,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:03,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:03,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:03,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:03,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:03,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:03,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:03,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:03,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:03,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:03,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-15 17:25:04,310 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-15 17:25:04,310 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-15 17:25:04,310 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:04,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:04,311 INFO L229 MonitoredProcess]: Starting monitored process 67 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) [2021-12-15 17:25:04,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2021-12-15 17:25:04,320 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 [2021-12-15 17:25:04,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:04,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:25:04,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:04,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:04,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:04,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:25:04,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:25:04,328 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:04,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:04,343 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:04,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:04,344 INFO L229 MonitoredProcess]: Starting monitored process 68 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) [2021-12-15 17:25:04,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2021-12-15 17:25:04,346 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 [2021-12-15 17:25:04,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:04,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:04,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:04,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:04,353 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:04,353 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:04,355 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:04,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2021-12-15 17:25:04,370 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:04,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:04,372 INFO L229 MonitoredProcess]: Starting monitored process 69 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) [2021-12-15 17:25:04,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2021-12-15 17:25:04,374 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 [2021-12-15 17:25:04,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:04,380 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-15 17:25:04,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:04,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:04,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:04,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-15 17:25:04,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-15 17:25:04,383 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:04,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2021-12-15 17:25:04,404 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:04,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:04,405 INFO L229 MonitoredProcess]: Starting monitored process 70 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) [2021-12-15 17:25:04,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2021-12-15 17:25:04,406 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 [2021-12-15 17:25:04,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:04,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:04,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:04,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:04,414 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:04,414 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:04,417 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:04,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2021-12-15 17:25:04,436 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:04,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:04,444 INFO L229 MonitoredProcess]: Starting monitored process 71 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) [2021-12-15 17:25:04,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2021-12-15 17:25:04,446 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 [2021-12-15 17:25:04,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:04,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:04,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:04,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:04,453 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:04,453 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:04,461 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:04,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2021-12-15 17:25:04,482 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:04,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:04,483 INFO L229 MonitoredProcess]: Starting monitored process 72 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) [2021-12-15 17:25:04,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2021-12-15 17:25:04,485 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 [2021-12-15 17:25:04,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:04,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:04,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:04,491 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:04,493 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:04,493 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:04,504 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:04,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2021-12-15 17:25:04,520 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:04,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:04,521 INFO L229 MonitoredProcess]: Starting monitored process 73 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) [2021-12-15 17:25:04,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2021-12-15 17:25:04,522 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 [2021-12-15 17:25:04,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:04,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:04,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:04,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:04,530 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:04,530 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:04,532 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:04,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2021-12-15 17:25:04,552 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:04,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:04,553 INFO L229 MonitoredProcess]: Starting monitored process 74 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) [2021-12-15 17:25:04,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2021-12-15 17:25:04,554 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 [2021-12-15 17:25:04,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:04,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:04,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:04,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:04,562 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:04,562 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:04,564 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:04,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2021-12-15 17:25:04,584 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:04,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:04,585 INFO L229 MonitoredProcess]: Starting monitored process 75 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) [2021-12-15 17:25:04,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2021-12-15 17:25:04,587 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 [2021-12-15 17:25:04,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:04,593 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2021-12-15 17:25:04,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:04,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:04,599 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2021-12-15 17:25:04,599 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:04,607 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:04,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2021-12-15 17:25:04,623 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:04,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:04,624 INFO L229 MonitoredProcess]: Starting monitored process 76 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) [2021-12-15 17:25:04,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2021-12-15 17:25:04,626 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 [2021-12-15 17:25:04,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:04,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:04,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:04,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:04,633 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:04,633 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:04,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:04,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2021-12-15 17:25:04,651 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:04,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:04,652 INFO L229 MonitoredProcess]: Starting monitored process 77 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) [2021-12-15 17:25:04,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2021-12-15 17:25:04,654 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 [2021-12-15 17:25:04,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:04,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:04,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:04,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:04,661 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:04,661 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:04,663 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:04,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2021-12-15 17:25:04,684 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:04,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:04,687 INFO L229 MonitoredProcess]: Starting monitored process 78 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) [2021-12-15 17:25:04,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2021-12-15 17:25:04,688 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 [2021-12-15 17:25:04,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:04,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:04,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:04,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:04,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:04,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:04,698 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-15 17:25:04,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2021-12-15 17:25:04,713 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:04,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:04,714 INFO L229 MonitoredProcess]: Starting monitored process 79 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) [2021-12-15 17:25:04,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2021-12-15 17:25:04,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-15 17:25:04,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-15 17:25:04,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-15 17:25:04,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-15 17:25:04,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-15 17:25:04,727 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-15 17:25:04,727 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-15 17:25:04,735 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-15 17:25:04,751 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2021-12-15 17:25:04,751 INFO L444 ModelExtractionUtils]: 9 out of 25 variables were initially zero. Simplification set additionally 13 variables to zero. [2021-12-15 17:25:04,752 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:25:04,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:25:04,753 INFO L229 MonitoredProcess]: Starting monitored process 80 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) [2021-12-15 17:25:04,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2021-12-15 17:25:04,754 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-15 17:25:04,766 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-15 17:25:04,766 INFO L513 LassoAnalysis]: Proved termination. [2021-12-15 17:25:04,766 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_max_~i~0#1, ~N~0) = -1*ULTIMATE.start_max_~i~0#1 + 1*~N~0 Supporting invariants [] [2021-12-15 17:25:04,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:04,862 INFO L297 tatePredicateManager]: 34 out of 34 supporting invariants were superfluous and have been removed [2021-12-15 17:25:04,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:25:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:25:04,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-15 17:25:04,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:25:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:25:04,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 17:25:04,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 17:25:04,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:25:04,977 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-15 17:25:04,977 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 76 transitions. cyclomatic complexity: 19 Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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) [2021-12-15 17:25:04,985 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 76 transitions. cyclomatic complexity: 19. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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) Result 66 states and 82 transitions. Complement of second has 4 states. [2021-12-15 17:25:04,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-15 17:25:04,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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) [2021-12-15 17:25:04,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2021-12-15 17:25:04,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 39 letters. Loop has 4 letters. [2021-12-15 17:25:04,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:25:04,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 43 letters. Loop has 4 letters. [2021-12-15 17:25:04,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:25:04,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 39 letters. Loop has 8 letters. [2021-12-15 17:25:04,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-15 17:25:04,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 82 transitions. [2021-12-15 17:25:04,993 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-15 17:25:04,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 0 states and 0 transitions. [2021-12-15 17:25:04,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-15 17:25:04,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-15 17:25:04,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-15 17:25:04,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:25:04,994 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 17:25:04,994 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 17:25:04,994 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 17:25:04,994 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-12-15 17:25:04,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-12-15 17:25:04,994 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-15 17:25:04,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-12-15 17:25:04,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.12 05:25:04 BoogieIcfgContainer [2021-12-15 17:25:04,999 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-15 17:25:04,999 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-15 17:25:04,999 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-15 17:25:04,999 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-15 17:25:04,999 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:24:36" (3/4) ... [2021-12-15 17:25:05,001 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-15 17:25:05,001 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-15 17:25:05,001 INFO L158 Benchmark]: Toolchain (without parser) took 29336.93ms. Allocated memory was 98.6MB in the beginning and 176.2MB in the end (delta: 77.6MB). Free memory was 69.3MB in the beginning and 46.0MB in the end (delta: 23.3MB). Peak memory consumption was 100.9MB. Max. memory is 16.1GB. [2021-12-15 17:25:05,002 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 98.6MB. Free memory is still 55.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:25:05,002 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.36ms. Allocated memory was 98.6MB in the beginning and 121.6MB in the end (delta: 23.1MB). Free memory was 69.3MB in the beginning and 96.7MB in the end (delta: -27.4MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2021-12-15 17:25:05,002 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.15ms. Allocated memory is still 121.6MB. Free memory was 96.7MB in the beginning and 95.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:25:05,002 INFO L158 Benchmark]: Boogie Preprocessor took 26.33ms. Allocated memory is still 121.6MB. Free memory was 95.2MB in the beginning and 93.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:25:05,003 INFO L158 Benchmark]: RCFGBuilder took 300.61ms. Allocated memory is still 121.6MB. Free memory was 93.5MB in the beginning and 80.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-15 17:25:05,003 INFO L158 Benchmark]: BuchiAutomizer took 28739.81ms. Allocated memory was 121.6MB in the beginning and 176.2MB in the end (delta: 54.5MB). Free memory was 80.9MB in the beginning and 46.0MB in the end (delta: 34.9MB). Peak memory consumption was 89.0MB. Max. memory is 16.1GB. [2021-12-15 17:25:05,003 INFO L158 Benchmark]: Witness Printer took 2.21ms. Allocated memory is still 176.2MB. Free memory is still 46.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:25:05,004 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.17ms. Allocated memory is still 98.6MB. Free memory is still 55.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.36ms. Allocated memory was 98.6MB in the beginning and 121.6MB in the end (delta: 23.1MB). Free memory was 69.3MB in the beginning and 96.7MB in the end (delta: -27.4MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.15ms. Allocated memory is still 121.6MB. Free memory was 96.7MB in the beginning and 95.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.33ms. Allocated memory is still 121.6MB. Free memory was 95.2MB in the beginning and 93.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 300.61ms. Allocated memory is still 121.6MB. Free memory was 93.5MB in the beginning and 80.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 28739.81ms. Allocated memory was 121.6MB in the beginning and 176.2MB in the end (delta: 54.5MB). Free memory was 80.9MB in the beginning and 46.0MB in the end (delta: 34.9MB). Peak memory consumption was 89.0MB. Max. memory is 16.1GB. * Witness Printer took 2.21ms. Allocated memory is still 176.2MB. Free memory is still 46.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 14 terminating modules (9 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + N and consists of 5 locations. One deterministic module has affine ranking function -2 * i + unknown-#length-unknown[x] and consists of 8 locations. One deterministic module has affine ranking function -4 * i + unknown-#length-unknown[x] and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 3 and consists of 10 locations. One deterministic module has affine ranking function -1 * i + N and consists of 3 locations. 9 modules have a trivial ranking function, the largest among these consists of 24 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 28.7s and 15 iterations. TraceHistogramMax:3. Analysis of lassos took 25.5s. Construction of modules took 0.9s. Büchi inclusion checks took 2.0s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 172 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 62 states and ocurred in iteration 13. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 721 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 719 mSDsluCounter, 878 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 71 IncrementalHoareTripleChecker+Unchecked, 605 mSDsCounter, 216 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2081 IncrementalHoareTripleChecker+Invalid, 2368 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 216 mSolverCounterUnsat, 273 mSDtfsCounter, 2081 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU8 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital401 mio100 ax100 hnf99 lsp115 ukn82 mio100 lsp31 div123 bol100 ite100 ukn100 eq164 hnf78 smp78 dnf276 smp55 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 8 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-12-15 17:25:05,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2021-12-15 17:25:05,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Ended with exit code 0 [2021-12-15 17:25:05,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2021-12-15 17:25:05,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2021-12-15 17:25:05,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2021-12-15 17:25:06,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-15 17:25:06,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-15 17:25:06,422 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