./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/sep.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/reducercommutativity/sep.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 54d2da4a9e5a645ffa7361038eff25cc32e29a265e0324de9bda9a6d773becac --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 16:02:27,475 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 16:02:27,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 16:02:27,497 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 16:02:27,499 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 16:02:27,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 16:02:27,501 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 16:02:27,502 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 16:02:27,503 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 16:02:27,503 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 16:02:27,504 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 16:02:27,505 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 16:02:27,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 16:02:27,506 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 16:02:27,507 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 16:02:27,507 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 16:02:27,508 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 16:02:27,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 16:02:27,510 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 16:02:27,511 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 16:02:27,512 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 16:02:27,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 16:02:27,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 16:02:27,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 16:02:27,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 16:02:27,528 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 16:02:27,528 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 16:02:27,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 16:02:27,529 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 16:02:27,530 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 16:02:27,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 16:02:27,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 16:02:27,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 16:02:27,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 16:02:27,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 16:02:27,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 16:02:27,533 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 16:02:27,533 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 16:02:27,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 16:02:27,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 16:02:27,534 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 16:02:27,535 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 16:02:27,536 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-23 16:02:27,550 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 16:02:27,550 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 16:02:27,550 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 16:02:27,550 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 16:02:27,551 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 16:02:27,551 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 16:02:27,551 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 16:02:27,552 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-23 16:02:27,552 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-23 16:02:27,552 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-23 16:02:27,552 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-23 16:02:27,552 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-23 16:02:27,552 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-23 16:02:27,552 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 16:02:27,553 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 16:02:27,553 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 16:02:27,553 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 16:02:27,553 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 16:02:27,553 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 16:02:27,553 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-23 16:02:27,554 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-23 16:02:27,554 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-23 16:02:27,554 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 16:02:27,554 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 16:02:27,554 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-23 16:02:27,554 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 16:02:27,555 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-23 16:02:27,555 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 16:02:27,555 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 16:02:27,555 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 16:02:27,555 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 16:02:27,556 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-23 16:02:27,556 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 -> 54d2da4a9e5a645ffa7361038eff25cc32e29a265e0324de9bda9a6d773becac [2022-07-23 16:02:27,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 16:02:27,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 16:02:27,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 16:02:27,768 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 16:02:27,769 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 16:02:27,770 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sep.i [2022-07-23 16:02:27,823 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfc79382b/2f52903dc0d245fe9852cf781f4b573e/FLAG6a526407b [2022-07-23 16:02:28,180 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 16:02:28,180 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sep.i [2022-07-23 16:02:28,185 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfc79382b/2f52903dc0d245fe9852cf781f4b573e/FLAG6a526407b [2022-07-23 16:02:28,634 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfc79382b/2f52903dc0d245fe9852cf781f4b573e [2022-07-23 16:02:28,648 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 16:02:28,650 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 16:02:28,652 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 16:02:28,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 16:02:28,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 16:02:28,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:02:28" (1/1) ... [2022-07-23 16:02:28,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71e36332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:28, skipping insertion in model container [2022-07-23 16:02:28,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:02:28" (1/1) ... [2022-07-23 16:02:28,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 16:02:28,674 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 16:02:28,764 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/sep.i[1298,1311] [2022-07-23 16:02:28,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 16:02:28,770 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 16:02:28,782 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/sep.i[1298,1311] [2022-07-23 16:02:28,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 16:02:28,792 INFO L208 MainTranslator]: Completed translation [2022-07-23 16:02:28,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:28 WrapperNode [2022-07-23 16:02:28,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 16:02:28,794 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 16:02:28,794 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 16:02:28,794 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 16:02:28,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:28" (1/1) ... [2022-07-23 16:02:28,817 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:28" (1/1) ... [2022-07-23 16:02:28,839 INFO L137 Inliner]: procedures = 16, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2022-07-23 16:02:28,840 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 16:02:28,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 16:02:28,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 16:02:28,841 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 16:02:28,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:28" (1/1) ... [2022-07-23 16:02:28,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:28" (1/1) ... [2022-07-23 16:02:28,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:28" (1/1) ... [2022-07-23 16:02:28,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:28" (1/1) ... [2022-07-23 16:02:28,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:28" (1/1) ... [2022-07-23 16:02:28,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:28" (1/1) ... [2022-07-23 16:02:28,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:28" (1/1) ... [2022-07-23 16:02:28,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 16:02:28,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 16:02:28,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 16:02:28,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 16:02:28,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:28" (1/1) ... [2022-07-23 16:02:28,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:28,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:28,921 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:02:28,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-23 16:02:28,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 16:02:28,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 16:02:28,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 16:02:28,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 16:02:28,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 16:02:28,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 16:02:28,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 16:02:28,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 16:02:28,998 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 16:02:29,004 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 16:02:29,135 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 16:02:29,139 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 16:02:29,140 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-23 16:02:29,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:02:29 BoogieIcfgContainer [2022-07-23 16:02:29,141 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 16:02:29,142 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-23 16:02:29,142 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-23 16:02:29,144 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-23 16:02:29,144 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 16:02:29,144 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.07 04:02:28" (1/3) ... [2022-07-23 16:02:29,145 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6fc81db0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 04:02:29, skipping insertion in model container [2022-07-23 16:02:29,145 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 16:02:29,146 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:02:28" (2/3) ... [2022-07-23 16:02:29,146 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6fc81db0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 04:02:29, skipping insertion in model container [2022-07-23 16:02:29,146 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 16:02:29,146 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:02:29" (3/3) ... [2022-07-23 16:02:29,147 INFO L354 chiAutomizerObserver]: Analyzing ICFG sep.i [2022-07-23 16:02:29,187 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-23 16:02:29,188 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-23 16:02:29,188 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-23 16:02:29,188 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-23 16:02:29,188 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-23 16:02:29,188 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-23 16:02:29,188 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-23 16:02:29,189 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-23 16:02:29,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:02:29,218 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-23 16:02:29,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:02:29,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:02:29,222 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-23 16:02:29,222 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 16:02:29,222 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-23 16:02:29,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:02:29,237 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-23 16:02:29,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:02:29,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:02:29,238 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-23 16:02:29,238 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 16:02:29,243 INFO L752 eck$LassoCheckResult]: Stem: 16#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(115, 2, 0, 1);call write~init~int(101, 2, 1, 1);call write~init~int(112, 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; 8#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; 20#L34true 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_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 22#L20-3true [2022-07-23 16:02:29,243 INFO L754 eck$LassoCheckResult]: Loop: 22#L20-3true assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 14#L22true assume 0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2);havoc sep_#t~mem2#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post3#1;havoc sep_#t~post3#1; 15#L20-2true sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 22#L20-3true [2022-07-23 16:02:29,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:29,247 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-23 16:02:29,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:29,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051306066] [2022-07-23 16:02:29,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:29,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:29,407 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:02:29,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:29,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:02:29,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:29,456 INFO L85 PathProgramCache]: Analyzing trace with hash 42800, now seen corresponding path program 1 times [2022-07-23 16:02:29,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:29,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144100670] [2022-07-23 16:02:29,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:29,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:29,482 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:02:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:29,506 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:02:29,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:29,508 INFO L85 PathProgramCache]: Analyzing trace with hash 889512687, now seen corresponding path program 1 times [2022-07-23 16:02:29,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:29,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398140879] [2022-07-23 16:02:29,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:29,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:29,539 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:02:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:29,568 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:02:29,978 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 16:02:29,978 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 16:02:29,978 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 16:02:29,979 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 16:02:29,979 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 16:02:29,979 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:29,979 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 16:02:29,980 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 16:02:29,980 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep.i_Iteration1_Lasso [2022-07-23 16:02:29,980 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 16:02:29,980 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 16:02:29,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:29,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:30,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:30,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:30,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:30,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:30,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:30,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:30,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:30,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:30,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:30,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:30,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:30,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:30,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:30,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:30,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:30,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:30,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:30,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:30,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:30,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:30,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:30,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:30,640 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 16:02:30,643 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 16:02:30,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:30,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:30,671 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:02:30,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-23 16:02:30,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:30,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:30,683 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:02:30,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:30,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:30,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:30,685 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:02:30,685 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:02:30,696 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:30,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-23 16:02:30,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:30,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:30,719 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:02:30,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-23 16:02:30,721 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:30,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:30,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:02:30,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:30,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:30,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:30,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:02:30,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:02:30,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:30,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-23 16:02:30,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:30,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:30,777 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:02:30,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-23 16:02:30,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:30,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:30,785 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:02:30,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:30,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:30,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:30,786 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:02:30,786 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:02:30,801 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:30,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-23 16:02:30,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:30,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:30,819 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:02:30,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-23 16:02:30,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:30,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:30,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:30,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:30,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:30,830 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:30,830 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:30,833 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:30,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-07-23 16:02:30,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:30,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:30,854 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:02:30,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-23 16:02:30,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:30,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:30,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:02:30,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:30,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:30,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:30,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:02:30,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:02:30,879 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:30,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-23 16:02:30,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:30,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:30,897 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:02:30,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-23 16:02:30,899 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:30,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:30,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:30,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:30,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:30,907 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:30,907 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:30,910 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:30,928 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 [2022-07-23 16:02:30,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:30,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:30,930 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:02:30,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-23 16:02:30,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:30,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:30,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:30,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:30,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:30,941 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:30,941 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:30,952 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:30,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-23 16:02:30,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:30,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:30,970 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:02:30,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-23 16:02:30,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:30,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:30,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:30,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:30,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:30,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:30,980 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:30,991 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:31,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-07-23 16:02:31,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:31,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:31,012 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:02:31,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-23 16:02:31,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:31,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:31,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:31,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:31,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:31,053 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:31,053 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:31,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:31,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-23 16:02:31,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:31,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:31,091 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:02:31,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:31,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-23 16:02:31,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:31,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:31,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:31,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:31,117 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:31,117 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:31,121 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:31,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-23 16:02:31,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:31,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:31,140 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:02:31,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-23 16:02:31,146 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:31,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:31,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:31,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:31,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:31,154 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:31,154 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:31,171 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:31,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-23 16:02:31,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:31,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:31,190 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:02:31,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-23 16:02:31,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:31,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:31,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:31,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:31,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:31,200 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:31,200 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:31,216 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:31,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-23 16:02:31,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:31,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:31,235 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:02:31,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-23 16:02:31,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:31,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:31,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:31,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:31,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:31,245 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:31,245 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:31,261 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:31,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-07-23 16:02:31,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:31,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:31,279 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:02:31,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-23 16:02:31,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:31,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:31,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:31,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:31,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:31,289 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:31,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:31,292 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:31,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-23 16:02:31,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:31,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:31,309 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:02:31,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-23 16:02:31,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:31,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:31,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:31,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:31,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:31,319 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:31,319 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:31,335 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:31,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-23 16:02:31,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:31,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:31,352 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:02:31,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-23 16:02:31,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 [2022-07-23 16:02:31,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:31,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:31,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:31,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:31,362 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:31,362 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:31,377 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:31,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-23 16:02:31,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:31,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:31,396 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:02:31,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-23 16:02:31,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:31,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:31,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:31,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:31,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:31,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:31,406 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:31,423 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:31,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-23 16:02:31,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:31,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:31,446 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:02:31,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-23 16:02:31,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:31,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:31,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:31,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:31,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:31,460 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:31,460 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:31,476 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 16:02:31,517 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2022-07-23 16:02:31,517 INFO L444 ModelExtractionUtils]: 7 out of 25 variables were initially zero. Simplification set additionally 15 variables to zero. [2022-07-23 16:02:31,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:31,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:31,527 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:02:31,600 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 16:02:31,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-23 16:02:31,609 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-23 16:02:31,609 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 16:02:31,610 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, ULTIMATE.start_sep_~i~0#1) = 1*~N~0 - 1*ULTIMATE.start_sep_~i~0#1 Supporting invariants [] [2022-07-23 16:02:31,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-07-23 16:02:31,661 INFO L293 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2022-07-23 16:02:31,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:02:31,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 16:02:31,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:02:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:02:31,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 16:02:31,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:02:31,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:02:31,817 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-23 16:02:31,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-23 16:02:31,819 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 27 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 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.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) [2022-07-23 16:02:31,847 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 27 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 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.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) Result 57 states and 81 transitions. Complement of second has 8 states. [2022-07-23 16:02:31,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-23 16:02:31,852 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-07-23 16:02:31,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-07-23 16:02:31,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 3 letters. [2022-07-23 16:02:31,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:02:31,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 6 letters. Loop has 3 letters. [2022-07-23 16:02:31,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:02:31,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 3 letters. Loop has 6 letters. [2022-07-23 16:02:31,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:02:31,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 81 transitions. [2022-07-23 16:02:31,858 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-07-23 16:02:31,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 20 states and 29 transitions. [2022-07-23 16:02:31,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-07-23 16:02:31,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-23 16:02:31,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2022-07-23 16:02:31,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:02:31,862 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 29 transitions. [2022-07-23 16:02:31,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2022-07-23 16:02:31,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-23 16:02:31,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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) [2022-07-23 16:02:31,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2022-07-23 16:02:31,882 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 29 transitions. [2022-07-23 16:02:31,882 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2022-07-23 16:02:31,882 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-23 16:02:31,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2022-07-23 16:02:31,883 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-07-23 16:02:31,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:02:31,883 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:02:31,884 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-23 16:02:31,884 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 16:02:31,884 INFO L752 eck$LassoCheckResult]: Stem: 174#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(115, 2, 0, 1);call write~init~int(101, 2, 1, 1);call write~init~int(112, 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; 175#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; 187#L34 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_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 192#L20-3 assume !(sep_~i~0#1 < ~N~0); 189#L20-4 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 178#L27 main_#t~ret6#1 := sep_#res#1;assume { :end_inline_sep } 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_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 179#L20-8 [2022-07-23 16:02:31,884 INFO L754 eck$LassoCheckResult]: Loop: 179#L20-8 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 180#L22-2 assume 0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2);havoc sep_#t~mem2#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post3#1;havoc sep_#t~post3#1; 188#L20-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 179#L20-8 [2022-07-23 16:02:31,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:31,885 INFO L85 PathProgramCache]: Analyzing trace with hash 889511019, now seen corresponding path program 1 times [2022-07-23 16:02:31,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:31,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131277795] [2022-07-23 16:02:31,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:31,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:02:31,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:02:31,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:02:31,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131277795] [2022-07-23 16:02:31,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131277795] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 16:02:31,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 16:02:31,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 16:02:31,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020828770] [2022-07-23 16:02:31,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 16:02:31,920 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 16:02:31,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:31,921 INFO L85 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 1 times [2022-07-23 16:02:31,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:31,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387690098] [2022-07-23 16:02:31,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:31,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:31,926 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:02:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:31,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:02:31,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:02:31,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 16:02:31,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 16:02:31,993 INFO L87 Difference]: Start difference. First operand 20 states and 29 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) [2022-07-23 16:02:32,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:02:32,014 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2022-07-23 16:02:32,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 16:02:32,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2022-07-23 16:02:32,020 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-07-23 16:02:32,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 29 transitions. [2022-07-23 16:02:32,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-23 16:02:32,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-23 16:02:32,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2022-07-23 16:02:32,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:02:32,023 INFO L369 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2022-07-23 16:02:32,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2022-07-23 16:02:32,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-07-23 16:02:32,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:02:32,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-07-23 16:02:32,026 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-23 16:02:32,026 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-23 16:02:32,026 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-23 16:02:32,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2022-07-23 16:02:32,027 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-07-23 16:02:32,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:02:32,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:02:32,028 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 16:02:32,028 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 16:02:32,028 INFO L752 eck$LassoCheckResult]: Stem: 222#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(115, 2, 0, 1);call write~init~int(101, 2, 1, 1);call write~init~int(112, 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; 223#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; 235#L34 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_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 240#L20-3 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 238#L22 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 239#L20-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 241#L20-3 assume !(sep_~i~0#1 < ~N~0); 237#L20-4 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 226#L27 main_#t~ret6#1 := sep_#res#1;assume { :end_inline_sep } 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_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 227#L20-8 [2022-07-23 16:02:32,028 INFO L754 eck$LassoCheckResult]: Loop: 227#L20-8 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 228#L22-2 assume 0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2);havoc sep_#t~mem2#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post3#1;havoc sep_#t~post3#1; 236#L20-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 227#L20-8 [2022-07-23 16:02:32,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:32,029 INFO L85 PathProgramCache]: Analyzing trace with hash -473899520, now seen corresponding path program 1 times [2022-07-23 16:02:32,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:32,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100255531] [2022-07-23 16:02:32,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:32,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:02:32,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:02:32,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:02:32,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100255531] [2022-07-23 16:02:32,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100255531] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 16:02:32,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514192974] [2022-07-23 16:02:32,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:32,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 16:02:32,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:32,080 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 16:02:32,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-23 16:02:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:02:32,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 16:02:32,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:02:32,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:02:32,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 16:02:32,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:02:32,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514192974] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 16:02:32,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 16:02:32,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-23 16:02:32,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411573809] [2022-07-23 16:02:32,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 16:02:32,217 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 16:02:32,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:32,218 INFO L85 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 2 times [2022-07-23 16:02:32,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:32,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433125994] [2022-07-23 16:02:32,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:32,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:32,225 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:02:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:32,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:02:32,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:02:32,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 16:02:32,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-07-23 16:02:32,263 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 10 Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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) [2022-07-23 16:02:32,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:02:32,299 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-07-23 16:02:32,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 16:02:32,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2022-07-23 16:02:32,301 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-07-23 16:02:32,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 33 transitions. [2022-07-23 16:02:32,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-23 16:02:32,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-23 16:02:32,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2022-07-23 16:02:32,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:02:32,302 INFO L369 hiAutomatonCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-07-23 16:02:32,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2022-07-23 16:02:32,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-07-23 16:02:32,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 22 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) [2022-07-23 16:02:32,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2022-07-23 16:02:32,303 INFO L392 hiAutomatonCegarLoop]: Abstraction has 23 states and 30 transitions. [2022-07-23 16:02:32,304 INFO L374 stractBuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2022-07-23 16:02:32,304 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-23 16:02:32,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2022-07-23 16:02:32,304 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-07-23 16:02:32,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:02:32,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:02:32,305 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-23 16:02:32,305 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 16:02:32,305 INFO L752 eck$LassoCheckResult]: Stem: 325#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(115, 2, 0, 1);call write~init~int(101, 2, 1, 1);call write~init~int(112, 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; 326#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; 338#L34 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_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 343#L20-3 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 344#L22 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 346#L20-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 345#L20-3 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 341#L22 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 342#L20-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 347#L20-3 assume !(sep_~i~0#1 < ~N~0); 340#L20-4 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 329#L27 main_#t~ret6#1 := sep_#res#1;assume { :end_inline_sep } 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_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 330#L20-8 [2022-07-23 16:02:32,305 INFO L754 eck$LassoCheckResult]: Loop: 330#L20-8 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 331#L22-2 assume 0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2);havoc sep_#t~mem2#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post3#1;havoc sep_#t~post3#1; 339#L20-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 330#L20-8 [2022-07-23 16:02:32,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:32,306 INFO L85 PathProgramCache]: Analyzing trace with hash -331548597, now seen corresponding path program 2 times [2022-07-23 16:02:32,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:32,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112697156] [2022-07-23 16:02:32,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:32,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:32,327 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:02:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:32,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:02:32,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:32,357 INFO L85 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 3 times [2022-07-23 16:02:32,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:32,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344437883] [2022-07-23 16:02:32,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:32,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:32,366 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:02:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:32,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:02:32,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:32,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1260561435, now seen corresponding path program 1 times [2022-07-23 16:02:32,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:32,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709306273] [2022-07-23 16:02:32,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:32,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:02:32,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:02:32,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:02:32,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709306273] [2022-07-23 16:02:32,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709306273] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 16:02:32,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660480416] [2022-07-23 16:02:32,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:32,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 16:02:32,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:32,567 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 16:02:32,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-23 16:02:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:02:32,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-23 16:02:32,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:02:32,716 INFO L390 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 38 treesize of output 26 [2022-07-23 16:02:32,732 INFO L390 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 27 treesize of output 15 [2022-07-23 16:02:32,747 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:02:32,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 16:02:32,814 INFO L356 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2022-07-23 16:02:32,814 INFO L390 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 34 treesize of output 27 [2022-07-23 16:02:32,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:02:32,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660480416] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 16:02:32,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 16:02:32,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-07-23 16:02:32,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45384014] [2022-07-23 16:02:32,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 16:02:32,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:02:32,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 16:02:32,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-07-23 16:02:32,902 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. cyclomatic complexity: 11 Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:02:33,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:02:33,384 INFO L93 Difference]: Finished difference Result 101 states and 135 transitions. [2022-07-23 16:02:33,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 16:02:33,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 135 transitions. [2022-07-23 16:02:33,386 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 28 [2022-07-23 16:02:33,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 101 states and 135 transitions. [2022-07-23 16:02:33,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2022-07-23 16:02:33,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2022-07-23 16:02:33,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 135 transitions. [2022-07-23 16:02:33,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:02:33,389 INFO L369 hiAutomatonCegarLoop]: Abstraction has 101 states and 135 transitions. [2022-07-23 16:02:33,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 135 transitions. [2022-07-23 16:02:33,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 31. [2022-07-23 16:02:33,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:02:33,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2022-07-23 16:02:33,391 INFO L392 hiAutomatonCegarLoop]: Abstraction has 31 states and 42 transitions. [2022-07-23 16:02:33,391 INFO L374 stractBuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2022-07-23 16:02:33,392 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-23 16:02:33,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2022-07-23 16:02:33,392 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2022-07-23 16:02:33,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:02:33,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:02:33,393 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 16:02:33,393 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-23 16:02:33,393 INFO L752 eck$LassoCheckResult]: Stem: 565#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(115, 2, 0, 1);call write~init~int(101, 2, 1, 1);call write~init~int(112, 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; 566#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; 578#L34 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_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 583#L20-3 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 584#L22 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 588#L20-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 585#L20-3 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 586#L22 assume 0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2);havoc sep_#t~mem2#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post3#1;havoc sep_#t~post3#1; 593#L20-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 591#L20-3 assume !(sep_~i~0#1 < ~N~0); 590#L20-4 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 567#L27 main_#t~ret6#1 := sep_#res#1;assume { :end_inline_sep } 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_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 568#L20-8 [2022-07-23 16:02:33,393 INFO L754 eck$LassoCheckResult]: Loop: 568#L20-8 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 569#L22-2 assume 0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2);havoc sep_#t~mem2#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post3#1;havoc sep_#t~post3#1; 577#L20-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 568#L20-8 [2022-07-23 16:02:33,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:33,394 INFO L85 PathProgramCache]: Analyzing trace with hash -333395639, now seen corresponding path program 1 times [2022-07-23 16:02:33,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:33,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289908194] [2022-07-23 16:02:33,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:33,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:33,408 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:02:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:33,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:02:33,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:33,423 INFO L85 PathProgramCache]: Analyzing trace with hash 63653, now seen corresponding path program 4 times [2022-07-23 16:02:33,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:33,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84962022] [2022-07-23 16:02:33,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:33,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:33,431 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:02:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:33,434 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:02:33,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:33,437 INFO L85 PathProgramCache]: Analyzing trace with hash 2069908061, now seen corresponding path program 1 times [2022-07-23 16:02:33,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:33,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681917641] [2022-07-23 16:02:33,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:33,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:33,470 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:02:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:33,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:02:34,078 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 16:02:34,078 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 16:02:34,079 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 16:02:34,079 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 16:02:34,079 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 16:02:34,079 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:34,079 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 16:02:34,079 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 16:02:34,079 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep.i_Iteration5_Lasso [2022-07-23 16:02:34,079 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 16:02:34,079 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 16:02:34,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:34,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:34,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:34,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:34,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:34,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:34,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:34,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:34,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:34,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:34,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:34,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:34,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:34,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:34,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:34,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:34,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:34,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:34,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:34,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:34,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:34,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:34,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:34,898 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 16:02:34,898 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 16:02:34,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:34,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:34,912 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:02:34,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-23 16:02:34,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:34,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:34,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:02:34,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:34,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:34,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:34,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:02:34,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:02:34,928 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:34,944 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 [2022-07-23 16:02:34,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:34,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:34,948 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:02:34,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-23 16:02:34,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:34,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:34,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:02:34,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:34,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:34,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:34,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:02:34,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:02:34,958 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:34,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-23 16:02:34,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:34,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:34,976 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:02:34,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-23 16:02:34,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:34,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:34,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:02:34,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:34,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:34,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:34,985 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:02:34,986 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:02:34,986 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:35,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-23 16:02:35,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:35,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:35,004 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:02:35,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-23 16:02:35,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:35,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:35,014 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 16:02:35,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:35,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:35,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:35,014 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 16:02:35,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 16:02:35,018 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:35,036 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 [2022-07-23 16:02:35,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:35,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:35,037 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:02:35,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-23 16:02:35,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 [2022-07-23 16:02:35,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:35,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:35,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:35,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:35,054 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:35,054 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:35,056 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:35,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-23 16:02:35,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:35,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:35,074 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 16:02:35,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-23 16:02:35,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:35,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:35,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:35,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:35,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:35,083 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:35,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:35,098 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:35,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-23 16:02:35,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:35,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:35,116 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) [2022-07-23 16:02:35,117 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 [2022-07-23 16:02:35,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:35,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:35,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:35,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:35,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:35,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:35,126 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:35,128 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:35,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-23 16:02:35,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:35,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:35,145 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) [2022-07-23 16:02:35,146 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 [2022-07-23 16:02:35,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:35,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:35,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:35,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:35,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:35,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:35,155 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:35,170 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:35,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-23 16:02:35,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:35,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:35,199 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) [2022-07-23 16:02:35,200 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 [2022-07-23 16:02:35,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:35,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:35,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:35,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:35,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:35,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:35,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:35,223 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:35,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-23 16:02:35,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:35,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:35,243 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) [2022-07-23 16:02:35,244 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 [2022-07-23 16:02:35,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:35,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:35,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:35,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:35,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:35,259 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:35,259 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:35,262 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:35,278 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 [2022-07-23 16:02:35,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:35,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:35,279 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) [2022-07-23 16:02:35,280 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 [2022-07-23 16:02:35,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:35,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:35,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:35,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:35,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:35,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:35,288 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:35,290 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:35,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-07-23 16:02:35,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:35,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:35,307 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) [2022-07-23 16:02:35,308 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 [2022-07-23 16:02:35,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:35,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:35,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:35,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:35,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:35,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:35,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:35,320 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:35,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-23 16:02:35,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:35,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:35,339 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) [2022-07-23 16:02:35,340 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 [2022-07-23 16:02:35,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:35,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:35,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:35,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:35,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:35,348 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:35,348 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:35,350 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:35,368 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 [2022-07-23 16:02:35,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:35,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:35,370 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) [2022-07-23 16:02:35,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:35,373 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 [2022-07-23 16:02:35,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:35,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:35,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:35,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:35,379 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:35,379 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:35,385 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:35,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-23 16:02:35,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:35,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:35,404 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) [2022-07-23 16:02:35,405 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 [2022-07-23 16:02:35,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 [2022-07-23 16:02:35,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:35,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:35,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:35,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:35,414 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:35,414 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:35,417 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:35,433 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 [2022-07-23 16:02:35,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:35,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:35,434 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) [2022-07-23 16:02:35,435 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 [2022-07-23 16:02:35,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:35,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:35,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:35,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:35,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:35,455 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:35,455 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:35,466 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 16:02:35,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-23 16:02:35,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:35,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:35,504 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) [2022-07-23 16:02:35,506 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 16:02:35,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 16:02:35,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 16:02:35,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 16:02:35,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 16:02:35,516 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 16:02:35,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-23 16:02:35,524 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 [2022-07-23 16:02:35,533 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 16:02:35,556 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-07-23 16:02:35,556 INFO L444 ModelExtractionUtils]: 7 out of 25 variables were initially zero. Simplification set additionally 14 variables to zero. [2022-07-23 16:02:35,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:35,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:35,557 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) [2022-07-23 16:02:35,561 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 [2022-07-23 16:02:35,561 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 16:02:35,583 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-23 16:02:35,583 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 16:02:35,584 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_sep_~x#1.base)_2, ULTIMATE.start_sep_~i~0#1) = 1*v_rep(select #length ULTIMATE.start_sep_~x#1.base)_2 - 4*ULTIMATE.start_sep_~i~0#1 Supporting invariants [1*ULTIMATE.start_sep_~x#1.offset >= 0] [2022-07-23 16:02:35,600 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 [2022-07-23 16:02:35,670 INFO L293 tatePredicateManager]: 24 out of 25 supporting invariants were superfluous and have been removed [2022-07-23 16:02:35,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:02:35,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 16:02:35,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:02:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:02:35,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 16:02:35,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:02:35,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 16:02:35,773 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 [2022-07-23 16:02:35,773 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 42 transitions. cyclomatic complexity: 16 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:02:35,811 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 42 transitions. cyclomatic complexity: 16. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 58 transitions. Complement of second has 8 states. [2022-07-23 16:02:35,811 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 [2022-07-23 16:02:35,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:02:35,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-07-23 16:02:35,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 12 letters. Loop has 3 letters. [2022-07-23 16:02:35,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:02:35,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 15 letters. Loop has 3 letters. [2022-07-23 16:02:35,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:02:35,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 12 letters. Loop has 6 letters. [2022-07-23 16:02:35,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 16:02:35,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 58 transitions. [2022-07-23 16:02:35,813 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-23 16:02:35,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 32 states and 44 transitions. [2022-07-23 16:02:35,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-23 16:02:35,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-07-23 16:02:35,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 44 transitions. [2022-07-23 16:02:35,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:02:35,814 INFO L369 hiAutomatonCegarLoop]: Abstraction has 32 states and 44 transitions. [2022-07-23 16:02:35,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 44 transitions. [2022-07-23 16:02:35,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-07-23 16:02:35,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.375) internal successors, (44), 31 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:02:35,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2022-07-23 16:02:35,816 INFO L392 hiAutomatonCegarLoop]: Abstraction has 32 states and 44 transitions. [2022-07-23 16:02:35,816 INFO L374 stractBuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2022-07-23 16:02:35,816 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-23 16:02:35,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 44 transitions. [2022-07-23 16:02:35,816 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-23 16:02:35,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:02:35,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:02:35,817 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 16:02:35,817 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 16:02:35,817 INFO L752 eck$LassoCheckResult]: Stem: 813#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(115, 2, 0, 1);call write~init~int(101, 2, 1, 1);call write~init~int(112, 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; 814#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; 827#L34 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_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 831#L20-3 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 829#L22 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 830#L20-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 832#L20-3 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 833#L22 assume 0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2);havoc sep_#t~mem2#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post3#1;havoc sep_#t~post3#1; 839#L20-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 837#L20-3 assume !(sep_~i~0#1 < ~N~0); 836#L20-4 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 835#L27 main_#t~ret6#1 := sep_#res#1;assume { :end_inline_sep } 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_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 834#L20-8 assume !(sep_~i~0#1 < ~N~0); 811#L20-9 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 812#L27-1 main_#t~ret9#1 := sep_#res#1;assume { :end_inline_sep } 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; 821#L46-3 [2022-07-23 16:02:35,817 INFO L754 eck$LassoCheckResult]: Loop: 821#L46-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; 820#L46-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 821#L46-3 [2022-07-23 16:02:35,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:35,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2069906393, now seen corresponding path program 1 times [2022-07-23 16:02:35,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:35,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198484143] [2022-07-23 16:02:35,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:35,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:02:35,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-23 16:02:35,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:02:35,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198484143] [2022-07-23 16:02:35,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198484143] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 16:02:35,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 16:02:35,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 16:02:35,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667912816] [2022-07-23 16:02:35,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 16:02:35,840 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 16:02:35,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:35,840 INFO L85 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 1 times [2022-07-23 16:02:35,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:35,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85065070] [2022-07-23 16:02:35,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:35,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:35,856 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:02:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:35,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:02:35,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:02:35,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 16:02:35,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 16:02:35,899 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. cyclomatic complexity: 17 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:02:35,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:02:35,917 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2022-07-23 16:02:35,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 16:02:35,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 49 transitions. [2022-07-23 16:02:35,918 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-23 16:02:35,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 49 transitions. [2022-07-23 16:02:35,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-07-23 16:02:35,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-07-23 16:02:35,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 49 transitions. [2022-07-23 16:02:35,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:02:35,919 INFO L369 hiAutomatonCegarLoop]: Abstraction has 37 states and 49 transitions. [2022-07-23 16:02:35,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 49 transitions. [2022-07-23 16:02:35,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2022-07-23 16:02:35,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.3125) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:02:35,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-07-23 16:02:35,921 INFO L392 hiAutomatonCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-07-23 16:02:35,921 INFO L374 stractBuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-07-23 16:02:35,921 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-23 16:02:35,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2022-07-23 16:02:35,921 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-23 16:02:35,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:02:35,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:02:35,922 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 16:02:35,922 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 16:02:35,922 INFO L752 eck$LassoCheckResult]: Stem: 887#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(115, 2, 0, 1);call write~init~int(101, 2, 1, 1);call write~init~int(112, 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; 888#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; 902#L34 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_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 908#L20-3 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 909#L22 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 912#L20-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 910#L20-3 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 911#L22 assume 0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2);havoc sep_#t~mem2#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post3#1;havoc sep_#t~post3#1; 918#L20-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 916#L20-3 assume !(sep_~i~0#1 < ~N~0); 915#L20-4 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 914#L27 main_#t~ret6#1 := sep_#res#1;assume { :end_inline_sep } 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_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 893#L20-8 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 894#L22-2 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 904#L20-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 895#L20-8 assume !(sep_~i~0#1 < ~N~0); 889#L20-9 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 890#L27-1 main_#t~ret9#1 := sep_#res#1;assume { :end_inline_sep } 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; 897#L46-3 [2022-07-23 16:02:35,922 INFO L754 eck$LassoCheckResult]: Loop: 897#L46-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; 896#L46-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 897#L46-3 [2022-07-23 16:02:35,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:35,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1787455815, now seen corresponding path program 1 times [2022-07-23 16:02:35,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:35,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023333065] [2022-07-23 16:02:35,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:35,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:02:35,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-23 16:02:35,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:02:35,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023333065] [2022-07-23 16:02:35,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023333065] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 16:02:35,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702382884] [2022-07-23 16:02:35,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:35,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 16:02:35,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:35,959 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 16:02:35,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-07-23 16:02:36,047 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 [2022-07-23 16:02:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:02:36,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 16:02:36,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:02:36,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-23 16:02:36,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 16:02:36,097 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-23 16:02:36,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702382884] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 16:02:36,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 16:02:36,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-07-23 16:02:36,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126135969] [2022-07-23 16:02:36,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 16:02:36,098 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 16:02:36,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:36,098 INFO L85 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 2 times [2022-07-23 16:02:36,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:36,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203867727] [2022-07-23 16:02:36,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:36,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:36,102 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:02:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:36,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:02:36,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:02:36,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 16:02:36,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-07-23 16:02:36,140 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. cyclomatic complexity: 15 Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:02:36,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:02:36,203 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2022-07-23 16:02:36,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 16:02:36,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 59 transitions. [2022-07-23 16:02:36,204 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-23 16:02:36,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 59 transitions. [2022-07-23 16:02:36,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-07-23 16:02:36,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-07-23 16:02:36,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 59 transitions. [2022-07-23 16:02:36,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:02:36,205 INFO L369 hiAutomatonCegarLoop]: Abstraction has 45 states and 59 transitions. [2022-07-23 16:02:36,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 59 transitions. [2022-07-23 16:02:36,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2022-07-23 16:02:36,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 34 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:02:36,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2022-07-23 16:02:36,206 INFO L392 hiAutomatonCegarLoop]: Abstraction has 35 states and 46 transitions. [2022-07-23 16:02:36,206 INFO L374 stractBuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2022-07-23 16:02:36,206 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-23 16:02:36,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 46 transitions. [2022-07-23 16:02:36,207 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-23 16:02:36,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:02:36,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:02:36,207 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 16:02:36,207 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 16:02:36,207 INFO L752 eck$LassoCheckResult]: Stem: 1079#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(115, 2, 0, 1);call write~init~int(101, 2, 1, 1);call write~init~int(112, 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; 1080#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; 1095#L34 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_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 1101#L20-3 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1099#L22 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1100#L20-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1102#L20-3 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1103#L22 assume 0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2);havoc sep_#t~mem2#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post3#1;havoc sep_#t~post3#1; 1112#L20-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1108#L20-3 assume !(sep_~i~0#1 < ~N~0); 1107#L20-4 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 1083#L27 main_#t~ret6#1 := sep_#res#1;assume { :end_inline_sep } 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_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 1084#L20-8 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1106#L22-2 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1104#L20-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1087#L20-8 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1088#L22-2 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1096#L20-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1105#L20-8 assume !(sep_~i~0#1 < ~N~0); 1081#L20-9 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 1082#L27-1 main_#t~ret9#1 := sep_#res#1;assume { :end_inline_sep } 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; 1090#L46-3 [2022-07-23 16:02:36,207 INFO L754 eck$LassoCheckResult]: Loop: 1090#L46-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; 1089#L46-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1090#L46-3 [2022-07-23 16:02:36,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:36,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1143219481, now seen corresponding path program 2 times [2022-07-23 16:02:36,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:36,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390198732] [2022-07-23 16:02:36,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:36,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 16:02:36,363 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 16:02:36,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 16:02:36,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390198732] [2022-07-23 16:02:36,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390198732] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 16:02:36,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175440996] [2022-07-23 16:02:36,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 16:02:36,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 16:02:36,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 16:02:36,384 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 16:02:36,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-07-23 16:02:36,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 16:02:36,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 16:02:36,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-23 16:02:36,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 16:02:36,486 INFO L390 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 34 treesize of output 22 [2022-07-23 16:02:36,517 INFO L390 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 23 treesize of output 11 [2022-07-23 16:02:36,537 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 16:02:36,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 16:02:36,617 INFO L356 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2022-07-23 16:02:36,618 INFO L390 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 34 treesize of output 27 [2022-07-23 16:02:36,662 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-23 16:02:36,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175440996] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 16:02:36,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 16:02:36,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-07-23 16:02:36,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380913439] [2022-07-23 16:02:36,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 16:02:36,663 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 16:02:36,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:36,663 INFO L85 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 3 times [2022-07-23 16:02:36,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:36,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527015585] [2022-07-23 16:02:36,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:36,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:36,666 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:02:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:36,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:02:36,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 16:02:36,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-23 16:02:36,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-07-23 16:02:36,722 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. cyclomatic complexity: 16 Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:02:37,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 16:02:37,010 INFO L93 Difference]: Finished difference Result 79 states and 103 transitions. [2022-07-23 16:02:37,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 16:02:37,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 103 transitions. [2022-07-23 16:02:37,011 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-23 16:02:37,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 103 transitions. [2022-07-23 16:02:37,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2022-07-23 16:02:37,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2022-07-23 16:02:37,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 103 transitions. [2022-07-23 16:02:37,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 16:02:37,012 INFO L369 hiAutomatonCegarLoop]: Abstraction has 79 states and 103 transitions. [2022-07-23 16:02:37,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 103 transitions. [2022-07-23 16:02:37,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 35. [2022-07-23 16:02:37,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 34 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 16:02:37,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-07-23 16:02:37,014 INFO L392 hiAutomatonCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-07-23 16:02:37,014 INFO L374 stractBuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-07-23 16:02:37,014 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-23 16:02:37,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2022-07-23 16:02:37,014 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2022-07-23 16:02:37,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 16:02:37,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 16:02:37,015 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 16:02:37,015 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 16:02:37,015 INFO L752 eck$LassoCheckResult]: Stem: 1344#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(115, 2, 0, 1);call write~init~int(101, 2, 1, 1);call write~init~int(112, 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; 1345#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; 1359#L34 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_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 1364#L20-3 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1365#L22 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1368#L20-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1366#L20-3 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1367#L22 assume 0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2);havoc sep_#t~mem2#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post3#1;havoc sep_#t~post3#1; 1376#L20-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1370#L20-3 assume !(sep_~i~0#1 < ~N~0); 1371#L20-4 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 1346#L27 main_#t~ret6#1 := sep_#res#1;assume { :end_inline_sep } 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_sep } true;sep_#in~x#1.base, sep_#in~x#1.offset := main_~#x~0#1.base, main_~#x~0#1.offset;havoc sep_#res#1;havoc sep_#t~mem2#1, sep_#t~post3#1, sep_#t~post4#1, sep_#t~post1#1, sep_~i~0#1, sep_~x#1.base, sep_~x#1.offset, sep_~ret~0#1;sep_~x#1.base, sep_~x#1.offset := sep_#in~x#1.base, sep_#in~x#1.offset;sep_~ret~0#1 := 0;sep_~i~0#1 := 0; 1347#L20-8 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1375#L22-2 assume 0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2);havoc sep_#t~mem2#1;sep_#t~post3#1 := sep_~ret~0#1;sep_~ret~0#1 := 1 + sep_#t~post3#1;havoc sep_#t~post3#1; 1374#L20-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1350#L20-8 assume !!(sep_~i~0#1 < ~N~0);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 1351#L22-2 assume !(0 == (if sep_#t~mem2#1 < 0 && 0 != sep_#t~mem2#1 % 2 then sep_#t~mem2#1 % 2 - 2 else sep_#t~mem2#1 % 2));havoc sep_#t~mem2#1;sep_#t~post4#1 := sep_~ret~0#1;sep_~ret~0#1 := sep_#t~post4#1 - 1;havoc sep_#t~post4#1; 1358#L20-7 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 1369#L20-8 assume !(sep_~i~0#1 < ~N~0); 1342#L20-9 sep_#res#1 := (if sep_~ret~0#1 % 4294967296 <= 2147483647 then sep_~ret~0#1 % 4294967296 else sep_~ret~0#1 % 4294967296 - 4294967296); 1343#L27-1 main_#t~ret9#1 := sep_#res#1;assume { :end_inline_sep } 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; 1353#L46-3 [2022-07-23 16:02:37,015 INFO L754 eck$LassoCheckResult]: Loop: 1353#L46-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; 1352#L46-2 main_#t~post11#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; 1353#L46-3 [2022-07-23 16:02:37,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:37,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1952566107, now seen corresponding path program 1 times [2022-07-23 16:02:37,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:37,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186188612] [2022-07-23 16:02:37,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:37,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:37,032 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:02:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:37,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:02:37,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:37,051 INFO L85 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 4 times [2022-07-23 16:02:37,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:37,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287479835] [2022-07-23 16:02:37,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:37,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:37,054 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:02:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:37,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:02:37,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 16:02:37,056 INFO L85 PathProgramCache]: Analyzing trace with hash -484677763, now seen corresponding path program 1 times [2022-07-23 16:02:37,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 16:02:37,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572420657] [2022-07-23 16:02:37,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 16:02:37,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 16:02:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:37,076 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 16:02:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 16:02:37,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 16:02:37,921 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 16:02:37,921 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 16:02:37,921 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 16:02:37,921 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 16:02:37,921 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 16:02:37,921 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 16:02:37,921 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 16:02:37,921 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 16:02:37,921 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep.i_Iteration9_Lasso [2022-07-23 16:02:37,921 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 16:02:37,922 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 16:02:37,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:37,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:37,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:37,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:37,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:37,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:37,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:37,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:37,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:37,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:37,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:37,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:37,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:37,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:37,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:37,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:37,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:37,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:37,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:37,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 16:02:38,558 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:601) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:914) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:823) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:247) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:310) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-23 16:02:38,560 INFO L158 Benchmark]: Toolchain (without parser) took 9909.92ms. Allocated memory was 96.5MB in the beginning and 172.0MB in the end (delta: 75.5MB). Free memory was 58.8MB in the beginning and 76.8MB in the end (delta: -18.0MB). Peak memory consumption was 80.2MB. Max. memory is 16.1GB. [2022-07-23 16:02:38,560 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory is still 75.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 16:02:38,560 INFO L158 Benchmark]: CACSL2BoogieTranslator took 141.37ms. Allocated memory is still 96.5MB. Free memory was 58.6MB in the beginning and 48.5MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-23 16:02:38,561 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.03ms. Allocated memory is still 96.5MB. Free memory was 48.5MB in the beginning and 74.0MB in the end (delta: -25.6MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2022-07-23 16:02:38,561 INFO L158 Benchmark]: Boogie Preprocessor took 42.37ms. Allocated memory is still 96.5MB. Free memory was 74.0MB in the beginning and 75.1MB in the end (delta: -1.1MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2022-07-23 16:02:38,561 INFO L158 Benchmark]: RCFGBuilder took 257.87ms. Allocated memory is still 96.5MB. Free memory was 75.1MB in the beginning and 62.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-23 16:02:38,561 INFO L158 Benchmark]: BuchiAutomizer took 9418.03ms. Allocated memory was 96.5MB in the beginning and 172.0MB in the end (delta: 75.5MB). Free memory was 62.6MB in the beginning and 76.8MB in the end (delta: -14.3MB). Peak memory consumption was 83.2MB. Max. memory is 16.1GB. [2022-07-23 16:02:38,562 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.16ms. Allocated memory is still 96.5MB. Free memory is still 75.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 141.37ms. Allocated memory is still 96.5MB. Free memory was 58.6MB in the beginning and 48.5MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.03ms. Allocated memory is still 96.5MB. Free memory was 48.5MB in the beginning and 74.0MB in the end (delta: -25.6MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.37ms. Allocated memory is still 96.5MB. Free memory was 74.0MB in the beginning and 75.1MB in the end (delta: -1.1MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. * RCFGBuilder took 257.87ms. Allocated memory is still 96.5MB. Free memory was 75.1MB in the beginning and 62.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 9418.03ms. Allocated memory was 96.5MB in the beginning and 172.0MB in the end (delta: 75.5MB). Free memory was 62.6MB in the beginning and 76.8MB in the end (delta: -14.3MB). Peak memory consumption was 83.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-23 16:02:38,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-07-23 16:02:38,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-07-23 16:02:38,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-23 16:02:39,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-23 16:02:39,385 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 Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: null