./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/reducercommutativity/sep05-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/reducercommutativity/sep05-1.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 ac50477087b7e2b9c80860ad42d4d46d99ddf32e797cee205c21d5ff44f08ec3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 03:12:03,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 03:12:03,779 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 03:12:03,810 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 03:12:03,810 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 03:12:03,811 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 03:12:03,817 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 03:12:03,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 03:12:03,821 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 03:12:03,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 03:12:03,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 03:12:03,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 03:12:03,831 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 03:12:03,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 03:12:03,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 03:12:03,834 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 03:12:03,835 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 03:12:03,836 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 03:12:03,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 03:12:03,840 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 03:12:03,844 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 03:12:03,844 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 03:12:03,846 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 03:12:03,847 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 03:12:03,847 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 03:12:03,849 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 03:12:03,850 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 03:12:03,851 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 03:12:03,851 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 03:12:03,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 03:12:03,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 03:12:03,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 03:12:03,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 03:12:03,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 03:12:03,855 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 03:12:03,856 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 03:12:03,856 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 03:12:03,857 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 03:12:03,857 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 03:12:03,857 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 03:12:03,858 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 03:12:03,859 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 03:12:03,859 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-22 03:12:03,889 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 03:12:03,890 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 03:12:03,890 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 03:12:03,890 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 03:12:03,891 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 03:12:03,891 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 03:12:03,891 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 03:12:03,891 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 03:12:03,892 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 03:12:03,892 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 03:12:03,892 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 03:12:03,892 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 03:12:03,897 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 03:12:03,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 03:12:03,897 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 03:12:03,898 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 03:12:03,898 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 03:12:03,898 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 03:12:03,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 03:12:03,898 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 03:12:03,898 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 03:12:03,898 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 03:12:03,899 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 03:12:03,899 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 03:12:03,899 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 03:12:03,899 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 03:12:03,899 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 03:12:03,899 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 03:12:03,900 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 03:12:03,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 03:12:03,900 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 03:12:03,902 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 03:12:03,902 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 -> ac50477087b7e2b9c80860ad42d4d46d99ddf32e797cee205c21d5ff44f08ec3 [2022-07-22 03:12:04,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 03:12:04,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 03:12:04,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 03:12:04,208 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 03:12:04,208 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 03:12:04,209 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sep05-1.i [2022-07-22 03:12:04,266 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe4af39c9/54b943b7860b46e2a6c3988c2ed7a6e1/FLAGbeaa499a2 [2022-07-22 03:12:04,632 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 03:12:04,632 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sep05-1.i [2022-07-22 03:12:04,637 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe4af39c9/54b943b7860b46e2a6c3988c2ed7a6e1/FLAGbeaa499a2 [2022-07-22 03:12:05,066 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe4af39c9/54b943b7860b46e2a6c3988c2ed7a6e1 [2022-07-22 03:12:05,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 03:12:05,071 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 03:12:05,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 03:12:05,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 03:12:05,074 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 03:12:05,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 03:12:05" (1/1) ... [2022-07-22 03:12:05,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2db5e290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:12:05, skipping insertion in model container [2022-07-22 03:12:05,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 03:12:05" (1/1) ... [2022-07-22 03:12:05,080 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 03:12:05,092 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 03:12:05,216 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/sep05-1.i[1287,1300] [2022-07-22 03:12:05,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 03:12:05,224 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 03:12:05,238 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/sep05-1.i[1287,1300] [2022-07-22 03:12:05,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 03:12:05,282 INFO L208 MainTranslator]: Completed translation [2022-07-22 03:12:05,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:12:05 WrapperNode [2022-07-22 03:12:05,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 03:12:05,284 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 03:12:05,284 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 03:12:05,284 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 03:12:05,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:12:05" (1/1) ... [2022-07-22 03:12:05,303 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:12:05" (1/1) ... [2022-07-22 03:12:05,329 INFO L137 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2022-07-22 03:12:05,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 03:12:05,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 03:12:05,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 03:12:05,331 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 03:12:05,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:12:05" (1/1) ... [2022-07-22 03:12:05,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:12:05" (1/1) ... [2022-07-22 03:12:05,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:12:05" (1/1) ... [2022-07-22 03:12:05,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:12:05" (1/1) ... [2022-07-22 03:12:05,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:12:05" (1/1) ... [2022-07-22 03:12:05,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:12:05" (1/1) ... [2022-07-22 03:12:05,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:12:05" (1/1) ... [2022-07-22 03:12:05,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 03:12:05,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 03:12:05,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 03:12:05,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 03:12:05,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:12:05" (1/1) ... [2022-07-22 03:12:05,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:12:05,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:12:05,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:12:05,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-22 03:12:05,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 03:12:05,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 03:12:05,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 03:12:05,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 03:12:05,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 03:12:05,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 03:12:05,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 03:12:05,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 03:12:05,543 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 03:12:05,544 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 03:12:05,748 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 03:12:05,756 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 03:12:05,756 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-22 03:12:05,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:12:05 BoogieIcfgContainer [2022-07-22 03:12:05,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 03:12:05,759 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 03:12:05,759 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 03:12:05,761 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 03:12:05,761 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 03:12:05,761 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 03:12:05" (1/3) ... [2022-07-22 03:12:05,762 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2644caf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 03:12:05, skipping insertion in model container [2022-07-22 03:12:05,762 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 03:12:05,762 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 03:12:05" (2/3) ... [2022-07-22 03:12:05,762 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2644caf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 03:12:05, skipping insertion in model container [2022-07-22 03:12:05,762 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 03:12:05,762 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 03:12:05" (3/3) ... [2022-07-22 03:12:05,763 INFO L354 chiAutomizerObserver]: Analyzing ICFG sep05-1.i [2022-07-22 03:12:05,834 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 03:12:05,834 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 03:12:05,834 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 03:12:05,834 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 03:12:05,834 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 03:12:05,835 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 03:12:05,835 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 03:12:05,835 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 03:12:05,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:12:05,864 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2022-07-22 03:12:05,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:12:05,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:12:05,869 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 03:12:05,870 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 03:12:05,870 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 03:12:05,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:12:05,874 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2022-07-22 03:12:05,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:12:05,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:12:05,875 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-22 03:12:05,875 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 03:12:05,879 INFO L752 eck$LassoCheckResult]: Stem: 18#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(10, 2); 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 26#L37-3true [2022-07-22 03:12:05,879 INFO L754 eck$LassoCheckResult]: Loop: 26#L37-3true assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 17#L37-2true main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 26#L37-3true [2022-07-22 03:12:05,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:12:05,886 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-22 03:12:05,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:12:05,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459105258] [2022-07-22 03:12:05,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:12:05,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:12:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:12:05,966 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:12:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:12:06,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:12:06,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:12:06,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-07-22 03:12:06,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:12:06,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767830998] [2022-07-22 03:12:06,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:12:06,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:12:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:12:06,024 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:12:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:12:06,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:12:06,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:12:06,044 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-07-22 03:12:06,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:12:06,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117620638] [2022-07-22 03:12:06,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:12:06,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:12:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:12:06,075 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:12:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:12:06,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:12:06,359 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 03:12:06,359 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 03:12:06,359 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 03:12:06,360 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 03:12:06,360 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 03:12:06,360 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:12:06,360 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 03:12:06,360 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 03:12:06,360 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep05-1.i_Iteration1_Lasso [2022-07-22 03:12:06,360 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 03:12:06,361 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 03:12:06,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:12:06,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:12:06,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:12:06,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:12:06,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:12:06,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:12:06,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:12:06,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:12:06,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-22 03:12:06,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-22 03:12:06,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:12:06,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:12:06,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:12:06,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-22 03:12:06,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-22 03:12:06,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:12:06,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:12:06,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:12:06,759 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 03:12:06,762 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 03:12:06,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:12:06,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:12:06,779 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:12:06,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-22 03:12:06,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:12:06,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:12:06,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:12:06,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:12:06,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:12:06,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:12:06,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:12:06,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:12:06,800 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:12:06,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-22 03:12:06,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:12:06,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:12:06,822 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:12:06,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-22 03:12:06,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:12:06,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:12:06,846 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:12:06,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:12:06,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:12:06,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:12:06,858 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:12:06,858 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:12:06,864 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:12:06,884 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-22 03:12:06,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:12:06,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:12:06,885 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:12:06,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-22 03:12:06,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:12:06,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:12:06,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:12:06,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:12:06,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:12:06,909 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:12:06,909 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:12:06,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:12:06,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-22 03:12:06,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:12:06,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:12:06,943 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:12:06,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-22 03:12:06,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:12:06,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:12:06,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:12:06,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:12:06,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:12:06,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:12:06,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:12:06,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:12:06,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:12:06,986 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-22 03:12:06,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:12:06,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:12:06,988 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:12:06,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-22 03:12:06,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:12:06,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:12:06,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 03:12:06,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:12:06,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:12:06,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:12:06,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 03:12:06,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 03:12:07,027 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:12:07,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 03:12:07,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:12:07,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:12:07,046 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:12:07,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-22 03:12:07,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:12:07,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:12:07,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:12:07,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:12:07,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:12:07,061 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:12:07,061 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:12:07,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:12:07,083 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-22 03:12:07,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:12:07,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:12:07,085 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:12:07,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-22 03:12:07,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:12:07,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:12:07,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:12:07,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:12:07,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:12:07,096 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:12:07,096 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:12:07,111 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 03:12:07,130 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-22 03:12:07,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:12:07,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:12:07,131 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:12:07,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-22 03:12:07,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 03:12:07,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 03:12:07,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 03:12:07,140 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 03:12:07,140 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 03:12:07,157 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 03:12:07,157 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 03:12:07,175 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 03:12:07,196 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-07-22 03:12:07,197 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-22 03:12:07,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:12:07,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:12:07,220 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 03:12:07,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-22 03:12:07,230 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 03:12:07,257 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 03:12:07,257 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 03:12:07,257 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1#1) = -2*ULTIMATE.start_main_~i~1#1 + 9 Supporting invariants [] [2022-07-22 03:12:07,282 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-22 03:12:07,307 INFO L293 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2022-07-22 03:12:07,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:12:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:12:07,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 03:12:07,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:12:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:12:07,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 03:12:07,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:12:07,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 03:12:07,413 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-22 03:12:07,414 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:12:07,448 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 27 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 78 states and 113 transitions. Complement of second has 7 states. [2022-07-22 03:12:07,455 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-22 03:12:07,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:12:07,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-07-22 03:12:07,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 76 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-22 03:12:07,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:12:07,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 76 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-22 03:12:07,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:12:07,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 76 transitions. Stem has 2 letters. Loop has 4 letters. [2022-07-22 03:12:07,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 03:12:07,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 113 transitions. [2022-07-22 03:12:07,466 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-22 03:12:07,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 22 states and 30 transitions. [2022-07-22 03:12:07,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-07-22 03:12:07,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-22 03:12:07,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 30 transitions. [2022-07-22 03:12:07,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 03:12:07,472 INFO L369 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-07-22 03:12:07,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 30 transitions. [2022-07-22 03:12:07,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-22 03:12:07,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 21 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-22 03:12:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2022-07-22 03:12:07,493 INFO L392 hiAutomatonCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-07-22 03:12:07,493 INFO L374 stractBuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-07-22 03:12:07,493 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 03:12:07,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2022-07-22 03:12:07,494 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-22 03:12:07,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:12:07,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:12:07,494 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 03:12:07,494 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 03:12:07,495 INFO L752 eck$LassoCheckResult]: Stem: 167#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(10, 2); 168#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 176#L37-3 assume !(main_~i~1#1 < 5); 181#L37-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; 182#L18-3 [2022-07-22 03:12:07,495 INFO L754 eck$LassoCheckResult]: Loop: 182#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 185#L20 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; 183#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 182#L18-3 [2022-07-22 03:12:07,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:12:07,495 INFO L85 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2022-07-22 03:12:07,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:12:07,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206109972] [2022-07-22 03:12:07,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:12:07,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:12:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:12:07,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 03:12:07,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 03:12:07,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206109972] [2022-07-22 03:12:07,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206109972] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 03:12:07,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 03:12:07,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 03:12:07,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158807540] [2022-07-22 03:12:07,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 03:12:07,529 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 03:12:07,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:12:07,530 INFO L85 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 1 times [2022-07-22 03:12:07,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:12:07,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23447590] [2022-07-22 03:12:07,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:12:07,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:12:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:12:07,537 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:12:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:12:07,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:12:07,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 03:12:07,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 03:12:07,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 03:12:07,584 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:12:07,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 03:12:07,598 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2022-07-22 03:12:07,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 03:12:07,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2022-07-22 03:12:07,601 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-22 03:12:07,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2022-07-22 03:12:07,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-07-22 03:12:07,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-22 03:12:07,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2022-07-22 03:12:07,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 03:12:07,604 INFO L369 hiAutomatonCegarLoop]: Abstraction has 23 states and 30 transitions. [2022-07-22 03:12:07,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2022-07-22 03:12:07,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-07-22 03:12:07,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 21 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-22 03:12:07,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2022-07-22 03:12:07,608 INFO L392 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2022-07-22 03:12:07,608 INFO L374 stractBuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2022-07-22 03:12:07,608 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 03:12:07,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2022-07-22 03:12:07,611 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-22 03:12:07,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:12:07,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:12:07,611 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 03:12:07,611 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 03:12:07,612 INFO L752 eck$LassoCheckResult]: Stem: 218#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(10, 2); 219#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 227#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 216#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 217#L37-3 assume !(main_~i~1#1 < 5); 232#L37-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; 233#L18-3 [2022-07-22 03:12:07,612 INFO L754 eck$LassoCheckResult]: Loop: 233#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 236#L20 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; 234#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 233#L18-3 [2022-07-22 03:12:07,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:12:07,612 INFO L85 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2022-07-22 03:12:07,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:12:07,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161577805] [2022-07-22 03:12:07,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:12:07,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:12:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:12:07,653 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-22 03:12:07,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 03:12:07,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161577805] [2022-07-22 03:12:07,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161577805] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 03:12:07,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263887716] [2022-07-22 03:12:07,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:12:07,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 03:12:07,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:12:07,662 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 03:12:07,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-22 03:12:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:12:07,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 03:12:07,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:12:07,711 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-22 03:12:07,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 03:12:07,724 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-22 03:12:07,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263887716] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 03:12:07,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 03:12:07,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-22 03:12:07,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698713580] [2022-07-22 03:12:07,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 03:12:07,725 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 03:12:07,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:12:07,726 INFO L85 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 2 times [2022-07-22 03:12:07,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:12:07,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766840914] [2022-07-22 03:12:07,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:12:07,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:12:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:12:07,731 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:12:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:12:07,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:12:07,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-07-22 03:12:07,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 03:12:07,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 03:12:07,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-22 03:12:07,831 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:12:07,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 03:12:07,851 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2022-07-22 03:12:07,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 03:12:07,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2022-07-22 03:12:07,852 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-22 03:12:07,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2022-07-22 03:12:07,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-07-22 03:12:07,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-22 03:12:07,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2022-07-22 03:12:07,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 03:12:07,853 INFO L369 hiAutomatonCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-07-22 03:12:07,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2022-07-22 03:12:07,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-22 03:12:07,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.25) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:12:07,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-07-22 03:12:07,855 INFO L392 hiAutomatonCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-07-22 03:12:07,855 INFO L374 stractBuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-07-22 03:12:07,855 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 03:12:07,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2022-07-22 03:12:07,856 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-22 03:12:07,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:12:07,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:12:07,856 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2022-07-22 03:12:07,856 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 03:12:07,856 INFO L752 eck$LassoCheckResult]: Stem: 308#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(10, 2); 309#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 317#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 306#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 307#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 328#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 333#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 332#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 331#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 330#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 329#L37-3 assume !(main_~i~1#1 < 5); 322#L37-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; 323#L18-3 [2022-07-22 03:12:07,857 INFO L754 eck$LassoCheckResult]: Loop: 323#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 326#L20 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; 324#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 323#L18-3 [2022-07-22 03:12:07,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:12:07,857 INFO L85 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 2 times [2022-07-22 03:12:07,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:12:07,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679601051] [2022-07-22 03:12:07,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:12:07,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:12:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 03:12:07,897 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 03:12:07,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 03:12:07,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679601051] [2022-07-22 03:12:07,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679601051] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 03:12:07,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512334647] [2022-07-22 03:12:07,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 03:12:07,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 03:12:07,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 03:12:07,911 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 03:12:07,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-22 03:12:07,950 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 03:12:07,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 03:12:07,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 03:12:07,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 03:12:07,978 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 03:12:07,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 03:12:07,995 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 03:12:07,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512334647] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 03:12:07,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 03:12:07,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2022-07-22 03:12:07,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207115369] [2022-07-22 03:12:07,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 03:12:07,996 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 03:12:07,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:12:07,997 INFO L85 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 3 times [2022-07-22 03:12:07,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:12:07,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006673798] [2022-07-22 03:12:07,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:12:07,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:12:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:12:08,001 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:12:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:12:08,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:12:08,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 03:12:08,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 03:12:08,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-07-22 03:12:08,042 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. cyclomatic complexity: 12 Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:12:08,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 03:12:08,062 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-07-22 03:12:08,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 03:12:08,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2022-07-22 03:12:08,064 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-22 03:12:08,064 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2022-07-22 03:12:08,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-07-22 03:12:08,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-07-22 03:12:08,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2022-07-22 03:12:08,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 03:12:08,065 INFO L369 hiAutomatonCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-07-22 03:12:08,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2022-07-22 03:12:08,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-22 03:12:08,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 29 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 03:12:08,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-07-22 03:12:08,066 INFO L392 hiAutomatonCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-07-22 03:12:08,066 INFO L374 stractBuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-07-22 03:12:08,067 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 03:12:08,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2022-07-22 03:12:08,067 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2022-07-22 03:12:08,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 03:12:08,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 03:12:08,068 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2022-07-22 03:12:08,068 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 03:12:08,068 INFO L752 eck$LassoCheckResult]: Stem: 443#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(10, 2); 444#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~post5#1, main_~i~1#1, main_#t~ret7#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~ret10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~post12#1, main_~i~2#1, main_#t~ret14#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;call main_~#x~0#1.base, main_~#x~0#1.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0#1;havoc main_~ret~1#1;havoc main_~ret2~0#1;havoc main_~ret5~0#1;main_~i~1#1 := 0; 452#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 441#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 442#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 463#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 470#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 469#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 468#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 467#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 466#L37-3 assume !!(main_~i~1#1 < 5);call write~int(main_#t~nondet6#1, main_~#x~0#1.base, main_~#x~0#1.offset + 4 * main_~i~1#1, 4);havoc main_#t~nondet6#1; 465#L37-2 main_#t~post5#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; 464#L37-3 assume !(main_~i~1#1 < 5); 457#L37-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; 458#L18-3 [2022-07-22 03:12:08,068 INFO L754 eck$LassoCheckResult]: Loop: 458#L18-3 assume !!(sep_~i~0#1 < 5);call sep_#t~mem2#1 := read~int(sep_~x#1.base, sep_~x#1.offset + 4 * sep_~i~0#1, 4); 461#L20 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; 459#L18-2 sep_#t~post1#1 := sep_~i~0#1;sep_~i~0#1 := 1 + sep_#t~post1#1;havoc sep_#t~post1#1; 458#L18-3 [2022-07-22 03:12:08,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:12:08,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 3 times [2022-07-22 03:12:08,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:12:08,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107481795] [2022-07-22 03:12:08,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:12:08,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:12:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:12:08,080 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:12:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:12:08,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:12:08,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:12:08,090 INFO L85 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 4 times [2022-07-22 03:12:08,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:12:08,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389843425] [2022-07-22 03:12:08,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:12:08,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:12:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:12:08,094 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:12:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:12:08,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:12:08,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 03:12:08,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1638582855, now seen corresponding path program 1 times [2022-07-22 03:12:08,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 03:12:08,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267081439] [2022-07-22 03:12:08,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 03:12:08,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 03:12:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:12:08,117 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 03:12:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 03:12:08,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 03:12:08,716 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 03:12:08,716 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 03:12:08,716 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 03:12:08,717 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 03:12:08,717 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 03:12:08,717 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 03:12:08,717 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 03:12:08,717 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 03:12:08,717 INFO L133 ssoRankerPreferences]: Filename of dumped script: sep05-1.i_Iteration5_Lasso [2022-07-22 03:12:08,717 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 03:12:08,717 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 03:12:08,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:12:08,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:12:08,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:12:08,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:12:08,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:12:08,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:12:08,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 03:12:08,831 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:109) 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-22 03:12:08,834 INFO L158 Benchmark]: Toolchain (without parser) took 3762.47ms. Allocated memory was 62.9MB in the beginning and 100.7MB in the end (delta: 37.7MB). Free memory was 43.2MB in the beginning and 74.7MB in the end (delta: -31.5MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. [2022-07-22 03:12:08,834 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 62.9MB. Free memory was 44.7MB in the beginning and 44.7MB in the end (delta: 44.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 03:12:08,834 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.38ms. Allocated memory is still 62.9MB. Free memory was 43.0MB in the beginning and 46.3MB in the end (delta: -3.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 03:12:08,835 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.93ms. Allocated memory is still 62.9MB. Free memory was 46.3MB in the beginning and 44.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 03:12:08,835 INFO L158 Benchmark]: Boogie Preprocessor took 32.15ms. Allocated memory is still 62.9MB. Free memory was 44.4MB in the beginning and 43.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 03:12:08,835 INFO L158 Benchmark]: RCFGBuilder took 394.82ms. Allocated memory is still 62.9MB. Free memory was 43.0MB in the beginning and 29.9MB in the end (delta: 13.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-22 03:12:08,836 INFO L158 Benchmark]: BuchiAutomizer took 3074.11ms. Allocated memory was 62.9MB in the beginning and 100.7MB in the end (delta: 37.7MB). Free memory was 29.9MB in the beginning and 74.7MB in the end (delta: -44.8MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. [2022-07-22 03:12:08,837 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.13ms. Allocated memory is still 62.9MB. Free memory was 44.7MB in the beginning and 44.7MB in the end (delta: 44.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.38ms. Allocated memory is still 62.9MB. Free memory was 43.0MB in the beginning and 46.3MB in the end (delta: -3.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.93ms. Allocated memory is still 62.9MB. Free memory was 46.3MB in the beginning and 44.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.15ms. Allocated memory is still 62.9MB. Free memory was 44.4MB in the beginning and 43.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 394.82ms. Allocated memory is still 62.9MB. Free memory was 43.0MB in the beginning and 29.9MB in the end (delta: 13.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 3074.11ms. Allocated memory was 62.9MB in the beginning and 100.7MB in the end (delta: 37.7MB). Free memory was 29.9MB in the beginning and 74.7MB in the end (delta: -44.8MB). Peak memory consumption was 34.6MB. 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-22 03:12:08,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-22 03:12:09,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-22 03:12:09,286 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