./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 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/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c -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 308b0e1adc3ae7348985993203af7f0b3a83352e3d43ffbdb40ed727e63d4081 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 16:14:06,965 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 16:14:06,967 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 16:14:07,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 16:14:07,005 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 16:14:07,007 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 16:14:07,009 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 16:14:07,012 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 16:14:07,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 16:14:07,018 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 16:14:07,019 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 16:14:07,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 16:14:07,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 16:14:07,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 16:14:07,024 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 16:14:07,025 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 16:14:07,026 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 16:14:07,027 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 16:14:07,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 16:14:07,035 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 16:14:07,037 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 16:14:07,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 16:14:07,038 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 16:14:07,039 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 16:14:07,040 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 16:14:07,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 16:14:07,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 16:14:07,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 16:14:07,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 16:14:07,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 16:14:07,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 16:14:07,049 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 16:14:07,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 16:14:07,051 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 16:14:07,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 16:14:07,052 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 16:14:07,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 16:14:07,053 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 16:14:07,053 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 16:14:07,054 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 16:14:07,055 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 16:14:07,057 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 16:14:07,058 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-14 16:14:07,088 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 16:14:07,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 16:14:07,089 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 16:14:07,089 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 16:14:07,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 16:14:07,091 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 16:14:07,091 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 16:14:07,091 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 16:14:07,091 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 16:14:07,092 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 16:14:07,093 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 16:14:07,093 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 16:14:07,093 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 16:14:07,093 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 16:14:07,093 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 16:14:07,093 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 16:14:07,094 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 16:14:07,094 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 16:14:07,094 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 16:14:07,096 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 16:14:07,096 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 16:14:07,096 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 16:14:07,096 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 16:14:07,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 16:14:07,097 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 16:14:07,097 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 16:14:07,097 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 16:14:07,097 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 16:14:07,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 16:14:07,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 16:14:07,098 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 16:14:07,099 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 16:14:07,099 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 -> 308b0e1adc3ae7348985993203af7f0b3a83352e3d43ffbdb40ed727e63d4081 [2022-07-14 16:14:07,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 16:14:07,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 16:14:07,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 16:14:07,414 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 16:14:07,414 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 16:14:07,416 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c [2022-07-14 16:14:07,488 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9d6437d6/5db3d001734e4d5baefaf5bd67e6a035/FLAG0b2f96483 [2022-07-14 16:14:07,880 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 16:14:07,881 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c [2022-07-14 16:14:07,890 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9d6437d6/5db3d001734e4d5baefaf5bd67e6a035/FLAG0b2f96483 [2022-07-14 16:14:07,903 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9d6437d6/5db3d001734e4d5baefaf5bd67e6a035 [2022-07-14 16:14:07,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 16:14:07,907 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 16:14:07,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 16:14:07,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 16:14:07,917 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 16:14:07,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:14:07" (1/1) ... [2022-07-14 16:14:07,918 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7600b73e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:14:07, skipping insertion in model container [2022-07-14 16:14:07,919 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:14:07" (1/1) ... [2022-07-14 16:14:07,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 16:14:07,961 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 16:14:08,135 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/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c[9433,9446] [2022-07-14 16:14:08,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 16:14:08,145 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 16:14:08,185 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/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c[9433,9446] [2022-07-14 16:14:08,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 16:14:08,202 INFO L208 MainTranslator]: Completed translation [2022-07-14 16:14:08,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:14:08 WrapperNode [2022-07-14 16:14:08,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 16:14:08,204 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 16:14:08,204 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 16:14:08,204 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 16:14:08,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:14:08" (1/1) ... [2022-07-14 16:14:08,219 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:14:08" (1/1) ... [2022-07-14 16:14:08,248 INFO L137 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 305 [2022-07-14 16:14:08,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 16:14:08,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 16:14:08,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 16:14:08,252 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 16:14:08,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:14:08" (1/1) ... [2022-07-14 16:14:08,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:14:08" (1/1) ... [2022-07-14 16:14:08,263 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:14:08" (1/1) ... [2022-07-14 16:14:08,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:14:08" (1/1) ... [2022-07-14 16:14:08,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:14:08" (1/1) ... [2022-07-14 16:14:08,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:14:08" (1/1) ... [2022-07-14 16:14:08,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:14:08" (1/1) ... [2022-07-14 16:14:08,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 16:14:08,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 16:14:08,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 16:14:08,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 16:14:08,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:14:08" (1/1) ... [2022-07-14 16:14:08,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:14:08,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:14:08,332 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-14 16:14:08,334 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-14 16:14:08,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 16:14:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 16:14:08,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 16:14:08,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 16:14:08,433 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 16:14:08,435 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 16:14:08,776 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 16:14:08,784 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 16:14:08,784 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-14 16:14:08,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:14:08 BoogieIcfgContainer [2022-07-14 16:14:08,786 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 16:14:08,787 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 16:14:08,787 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 16:14:08,791 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 16:14:08,791 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 16:14:08,792 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 04:14:07" (1/3) ... [2022-07-14 16:14:08,793 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7824a0f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 04:14:08, skipping insertion in model container [2022-07-14 16:14:08,793 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 16:14:08,793 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:14:08" (2/3) ... [2022-07-14 16:14:08,794 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7824a0f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 04:14:08, skipping insertion in model container [2022-07-14 16:14:08,794 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 16:14:08,794 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:14:08" (3/3) ... [2022-07-14 16:14:08,795 INFO L354 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c [2022-07-14 16:14:08,844 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 16:14:08,844 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 16:14:08,844 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 16:14:08,844 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 16:14:08,844 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 16:14:08,844 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 16:14:08,844 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 16:14:08,845 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 16:14:08,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 99 states, 98 states have (on average 1.683673469387755) internal successors, (165), 98 states have internal predecessors, (165), 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-14 16:14:08,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2022-07-14 16:14:08,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:14:08,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:14:08,886 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:14:08,887 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:14:08,887 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 16:14:08,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 99 states, 98 states have (on average 1.683673469387755) internal successors, (165), 98 states have internal predecessors, (165), 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-14 16:14:08,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2022-07-14 16:14:08,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:14:08,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:14:08,900 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:14:08,901 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:14:08,907 INFO L752 eck$LassoCheckResult]: Stem: 85#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; 34#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_#t~post35#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 22#L203true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 77#L203-1true init_#res#1 := init_~tmp~0#1; 51#L300true main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1; 74#L352true assume !(0 == main_~i2~0#1); 23#L352-2true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 44#L362-2true [2022-07-14 16:14:08,909 INFO L754 eck$LassoCheckResult]: Loop: 44#L362-2true assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 100#L65true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 15#L69true assume !(node1_~m1~0#1 != ~nomsg~0); 92#L69-1true ~mode1~0 := 0; 33#L65-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 38#L102true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 19#L105true assume !(node2_~m2~0#1 != ~nomsg~0); 47#L105-1true ~mode2~0 := 0; 37#L102-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 16#L136true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 26#L139true assume !(node3_~m3~0#1 != ~nomsg~0); 9#L139-1true ~mode3~0 := 0; 28#L136-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 54#L170true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 46#L173true assume !(node4_~m4~0#1 != ~nomsg~0); 82#L173-1true ~mode4~0 := 0; 43#L170-2true assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 11#L308true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 24#L308-1true check_#res#1 := check_~tmp~1#1; 65#L320true main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 17#L389true assume !(0 == assert_~arg#1 % 256); 98#L384true assume { :end_inline_assert } true;main_#t~post35#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post35#1;havoc main_#t~post35#1; 44#L362-2true [2022-07-14 16:14:08,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:14:08,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1938506578, now seen corresponding path program 1 times [2022-07-14 16:14:08,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:14:08,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469583626] [2022-07-14 16:14:08,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:14:08,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:14:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:14:09,169 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-14 16:14:09,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:14:09,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469583626] [2022-07-14 16:14:09,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469583626] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:14:09,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:14:09,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 16:14:09,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200750501] [2022-07-14 16:14:09,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:14:09,179 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:14:09,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:14:09,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1584807191, now seen corresponding path program 1 times [2022-07-14 16:14:09,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:14:09,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080221556] [2022-07-14 16:14:09,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:14:09,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:14:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:14:09,375 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-14 16:14:09,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:14:09,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080221556] [2022-07-14 16:14:09,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080221556] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:14:09,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:14:09,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 16:14:09,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282002807] [2022-07-14 16:14:09,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:14:09,381 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 16:14:09,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:14:09,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 16:14:09,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 16:14:09,414 INFO L87 Difference]: Start difference. First operand has 99 states, 98 states have (on average 1.683673469387755) internal successors, (165), 98 states have internal predecessors, (165), 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 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:14:09,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:14:09,517 INFO L93 Difference]: Finished difference Result 167 states and 268 transitions. [2022-07-14 16:14:09,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 16:14:09,523 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 268 transitions. [2022-07-14 16:14:09,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2022-07-14 16:14:09,538 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 158 states and 236 transitions. [2022-07-14 16:14:09,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 158 [2022-07-14 16:14:09,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 158 [2022-07-14 16:14:09,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 158 states and 236 transitions. [2022-07-14 16:14:09,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:14:09,549 INFO L369 hiAutomatonCegarLoop]: Abstraction has 158 states and 236 transitions. [2022-07-14 16:14:09,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 236 transitions. [2022-07-14 16:14:09,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 94. [2022-07-14 16:14:09,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 93 states have internal predecessors, (133), 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-14 16:14:09,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 133 transitions. [2022-07-14 16:14:09,592 INFO L392 hiAutomatonCegarLoop]: Abstraction has 94 states and 133 transitions. [2022-07-14 16:14:09,593 INFO L374 stractBuchiCegarLoop]: Abstraction has 94 states and 133 transitions. [2022-07-14 16:14:09,593 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 16:14:09,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 133 transitions. [2022-07-14 16:14:09,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2022-07-14 16:14:09,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:14:09,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:14:09,598 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:14:09,598 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:14:09,598 INFO L752 eck$LassoCheckResult]: Stem: 370#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; 361#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_#t~post35#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 345#L203 assume 0 == ~r1~0; 346#L204 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; 307#L205 assume ~id1~0 >= 0; 308#L206 assume 0 == ~st1~0; 297#L207 assume ~send1~0 == ~id1~0; 298#L208 assume 0 == ~mode1~0 % 256; 357#L209 assume ~id2~0 >= 0; 313#L210 assume 0 == ~st2~0; 314#L211 assume ~send2~0 == ~id2~0; 299#L212 assume 0 == ~mode2~0 % 256; 300#L213 assume ~id3~0 >= 0; 375#L214 assume 0 == ~st3~0; 376#L215 assume ~send3~0 == ~id3~0; 356#L216 assume 0 == ~mode3~0 % 256; 339#L217 assume ~id4~0 >= 0; 340#L218 assume 0 == ~st4~0; 362#L219 assume ~send4~0 == ~id4~0; 377#L220 assume 0 == ~mode4~0 % 256; 336#L221 assume ~id1~0 != ~id2~0; 334#L222 assume ~id1~0 != ~id3~0; 335#L223 assume ~id1~0 != ~id4~0; 320#L224 assume ~id2~0 != ~id3~0; 321#L225 assume ~id2~0 != ~id4~0; 318#L226 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 319#L203-1 init_#res#1 := init_~tmp~0#1; 359#L300 main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1; 353#L352 assume !(0 == main_~i2~0#1); 347#L352-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 348#L362-2 [2022-07-14 16:14:09,599 INFO L754 eck$LassoCheckResult]: Loop: 348#L362-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 368#L65 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 327#L69 assume !(node1_~m1~0#1 != ~nomsg~0); 294#L69-1 ~mode1~0 := 0; 324#L65-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 358#L102 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 337#L105 assume !(node2_~m2~0#1 != ~nomsg~0); 287#L105-1 ~mode2~0 := 0; 360#L102-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 330#L136 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 331#L139 assume !(node3_~m3~0#1 != ~nomsg~0); 305#L139-1 ~mode3~0 := 0; 312#L136-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 352#L170 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 373#L173 assume !(node4_~m4~0#1 != ~nomsg~0); 290#L173-1 ~mode4~0 := 0; 363#L170-2 assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 315#L308 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 317#L308-1 check_#res#1 := check_~tmp~1#1; 325#L320 main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 326#L389 assume !(0 == assert_~arg#1 % 256); 329#L384 assume { :end_inline_assert } true;main_#t~post35#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post35#1;havoc main_#t~post35#1; 348#L362-2 [2022-07-14 16:14:09,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:14:09,600 INFO L85 PathProgramCache]: Analyzing trace with hash -805895157, now seen corresponding path program 1 times [2022-07-14 16:14:09,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:14:09,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531556935] [2022-07-14 16:14:09,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:14:09,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:14:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:14:09,625 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:14:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:14:09,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:14:09,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:14:09,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1584807191, now seen corresponding path program 2 times [2022-07-14 16:14:09,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:14:09,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547253042] [2022-07-14 16:14:09,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:14:09,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:14:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:14:09,803 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-14 16:14:09,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:14:09,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547253042] [2022-07-14 16:14:09,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547253042] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:14:09,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:14:09,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 16:14:09,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350441170] [2022-07-14 16:14:09,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:14:09,810 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 16:14:09,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:14:09,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 16:14:09,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 16:14:09,812 INFO L87 Difference]: Start difference. First operand 94 states and 133 transitions. cyclomatic complexity: 40 Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:14:09,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:14:09,864 INFO L93 Difference]: Finished difference Result 97 states and 135 transitions. [2022-07-14 16:14:09,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 16:14:09,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 135 transitions. [2022-07-14 16:14:09,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2022-07-14 16:14:09,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 94 states and 131 transitions. [2022-07-14 16:14:09,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2022-07-14 16:14:09,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2022-07-14 16:14:09,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 131 transitions. [2022-07-14 16:14:09,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:14:09,874 INFO L369 hiAutomatonCegarLoop]: Abstraction has 94 states and 131 transitions. [2022-07-14 16:14:09,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 131 transitions. [2022-07-14 16:14:09,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-14 16:14:09,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 93 states have internal predecessors, (131), 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-14 16:14:09,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 131 transitions. [2022-07-14 16:14:09,886 INFO L392 hiAutomatonCegarLoop]: Abstraction has 94 states and 131 transitions. [2022-07-14 16:14:09,886 INFO L374 stractBuchiCegarLoop]: Abstraction has 94 states and 131 transitions. [2022-07-14 16:14:09,886 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 16:14:09,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 131 transitions. [2022-07-14 16:14:09,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2022-07-14 16:14:09,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:14:09,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:14:09,891 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:14:09,892 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:14:09,892 INFO L752 eck$LassoCheckResult]: Stem: 573#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(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0; 564#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_#t~post35#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 548#L203 assume 0 == ~r1~0; 549#L204 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; 510#L205 assume ~id1~0 >= 0; 511#L206 assume 0 == ~st1~0; 500#L207 assume ~send1~0 == ~id1~0; 501#L208 assume 0 == ~mode1~0 % 256; 560#L209 assume ~id2~0 >= 0; 516#L210 assume 0 == ~st2~0; 517#L211 assume ~send2~0 == ~id2~0; 502#L212 assume 0 == ~mode2~0 % 256; 503#L213 assume ~id3~0 >= 0; 578#L214 assume 0 == ~st3~0; 579#L215 assume ~send3~0 == ~id3~0; 559#L216 assume 0 == ~mode3~0 % 256; 542#L217 assume ~id4~0 >= 0; 543#L218 assume 0 == ~st4~0; 565#L219 assume ~send4~0 == ~id4~0; 580#L220 assume 0 == ~mode4~0 % 256; 539#L221 assume ~id1~0 != ~id2~0; 537#L222 assume ~id1~0 != ~id3~0; 538#L223 assume ~id1~0 != ~id4~0; 522#L224 assume ~id2~0 != ~id3~0; 523#L225 assume ~id2~0 != ~id4~0; 518#L226 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 519#L203-1 init_#res#1 := init_~tmp~0#1; 562#L300 main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1; 556#L352 assume !(0 == main_~i2~0#1); 550#L352-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 551#L362-2 [2022-07-14 16:14:09,892 INFO L754 eck$LassoCheckResult]: Loop: 551#L362-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 571#L65 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 529#L69 assume !(node1_~m1~0#1 != ~nomsg~0); 497#L69-1 ~mode1~0 := 0; 526#L65-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 561#L102 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 540#L105 assume !(node2_~m2~0#1 != ~nomsg~0); 490#L105-1 ~mode2~0 := 0; 563#L102-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 531#L136 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 532#L139 assume !(node3_~m3~0#1 != ~nomsg~0); 508#L139-1 ~mode3~0 := 0; 515#L136-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 555#L170 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 576#L173 assume !(node4_~m4~0#1 != ~nomsg~0); 495#L173-1 ~mode4~0 := 0; 566#L170-2 assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 520#L308 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 521#L309 assume ~r1~0 < 4;check_~tmp~1#1 := 1; 535#L308-1 check_#res#1 := check_~tmp~1#1; 527#L320 main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 528#L389 assume !(0 == assert_~arg#1 % 256); 533#L384 assume { :end_inline_assert } true;main_#t~post35#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post35#1;havoc main_#t~post35#1; 551#L362-2 [2022-07-14 16:14:09,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:14:09,893 INFO L85 PathProgramCache]: Analyzing trace with hash -805895157, now seen corresponding path program 2 times [2022-07-14 16:14:09,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:14:09,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915372553] [2022-07-14 16:14:09,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:14:09,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:14:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:14:09,930 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:14:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:14:10,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:14:10,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:14:10,014 INFO L85 PathProgramCache]: Analyzing trace with hash 2027257471, now seen corresponding path program 1 times [2022-07-14 16:14:10,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:14:10,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395887884] [2022-07-14 16:14:10,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:14:10,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:14:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:14:10,041 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:14:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:14:10,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:14:10,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:14:10,063 INFO L85 PathProgramCache]: Analyzing trace with hash -2125885643, now seen corresponding path program 1 times [2022-07-14 16:14:10,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:14:10,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162337181] [2022-07-14 16:14:10,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:14:10,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:14:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:14:10,106 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-14 16:14:10,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:14:10,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162337181] [2022-07-14 16:14:10,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162337181] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:14:10,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:14:10,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:14:10,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551234569] [2022-07-14 16:14:10,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:14:10,820 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 16:14:10,821 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 16:14:10,821 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 16:14:10,821 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 16:14:10,821 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 16:14:10,821 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:14:10,822 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 16:14:10,822 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 16:14:10,822 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2022-07-14 16:14:10,822 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 16:14:10,822 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 16:14:10,848 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-14 16:14:10,856 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-14 16:14:10,860 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-14 16:14:10,894 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-14 16:14:10,897 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-14 16:14:10,899 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-14 16:14:10,904 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-14 16:14:10,906 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-14 16:14:10,909 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-14 16:14:10,911 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-14 16:14:10,916 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-14 16:14:10,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:14:10,925 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-14 16:14:10,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:14:10,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:14:10,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:14:10,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:14:10,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:14:10,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:14:10,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:14:11,463 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 16:14:11,464 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 16:14:11,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:14:11,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:14:11,471 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-14 16:14:11,482 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:14:11,482 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:14:11,497 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-14 16:14:11,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-14 16:14:11,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:14:11,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:14:11,541 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-14 16:14:11,549 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 16:14:11,549 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:14:11,565 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-14 16:14:11,768 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 16:14:11,777 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-14 16:14:11,777 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 16:14:11,777 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 16:14:11,777 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 16:14:11,777 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 16:14:11,777 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 16:14:11,777 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:14:11,777 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 16:14:11,778 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 16:14:11,778 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2022-07-14 16:14:11,778 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 16:14:11,778 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 16:14:11,780 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-14 16:14:11,791 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-14 16:14:11,796 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-14 16:14:11,798 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-14 16:14:11,803 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-14 16:14:11,805 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-14 16:14:11,807 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-14 16:14:11,809 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-14 16:14:11,813 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-14 16:14:11,837 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-14 16:14:11,840 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-14 16:14:11,852 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-14 16:14:11,854 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-14 16:14:11,856 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-14 16:14:11,860 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-14 16:14:11,862 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-14 16:14:11,866 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-14 16:14:11,868 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-14 16:14:11,870 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-14 16:14:11,872 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-14 16:14:12,380 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 16:14:12,383 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 16:14:12,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:14:12,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:14:12,388 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:14:12,396 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-14 16:14:12,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:14:12,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:14:12,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:14:12,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:14:12,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:14:12,408 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-14 16:14:12,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:14:12,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:14:12,423 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:14:12,451 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-14 16:14:12,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:14:12,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:14:12,453 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-14 16:14:12,455 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-14 16:14:12,457 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-14 16:14:12,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:14:12,465 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:14:12,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:14:12,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:14:12,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:14:12,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:14:12,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:14:12,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:14:12,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-14 16:14:12,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:14:12,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:14:12,516 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-14 16:14:12,517 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-14 16:14:12,532 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-14 16:14:12,539 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:14:12,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:14:12,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:14:12,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:14:12,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:14:12,540 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:14:12,540 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:14:12,547 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:14:12,563 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-14 16:14:12,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:14:12,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:14:12,564 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-14 16:14:12,565 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-14 16:14:12,567 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-14 16:14:12,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:14:12,573 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:14:12,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:14:12,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:14:12,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:14:12,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:14:12,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:14:12,577 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 16:14:12,580 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-14 16:14:12,581 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-14 16:14:12,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:14:12,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:14:12,583 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-14 16:14:12,584 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-14 16:14:12,585 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 16:14:12,585 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 16:14:12,585 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 16:14:12,586 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 15 Supporting invariants [] [2022-07-14 16:14:12,603 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-14 16:14:12,606 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 16:14:12,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:14:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:14:12,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 16:14:12,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:14:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:14:12,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 16:14:12,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:14:12,839 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-14 16:14:12,909 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-14 16:14:12,912 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-14 16:14:12,913 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 131 transitions. cyclomatic complexity: 38 Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:14:12,963 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 131 transitions. cyclomatic complexity: 38. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 158 states and 233 transitions. Complement of second has 4 states. [2022-07-14 16:14:12,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-14 16:14:12,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:14:12,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2022-07-14 16:14:12,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 131 transitions. Stem has 30 letters. Loop has 23 letters. [2022-07-14 16:14:12,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:14:12,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 131 transitions. Stem has 53 letters. Loop has 23 letters. [2022-07-14 16:14:12,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:14:12,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 131 transitions. Stem has 30 letters. Loop has 46 letters. [2022-07-14 16:14:12,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:14:12,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 233 transitions. [2022-07-14 16:14:12,974 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 16:14:12,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 0 states and 0 transitions. [2022-07-14 16:14:12,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-14 16:14:12,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-14 16:14:12,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-14 16:14:12,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:14:12,976 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 16:14:12,977 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 16:14:12,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:14:12,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:14:12,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:14:12,979 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:14:12,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:14:12,982 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-07-14 16:14:12,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 16:14:12,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-07-14 16:14:12,983 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 16:14:12,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-07-14 16:14:12,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-14 16:14:12,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-14 16:14:12,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-14 16:14:12,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:14:12,983 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 16:14:12,983 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 16:14:12,983 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 16:14:12,984 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 16:14:12,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-14 16:14:12,984 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 16:14:12,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-14 16:14:12,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.07 04:14:12 BoogieIcfgContainer [2022-07-14 16:14:12,989 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-14 16:14:12,989 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 16:14:12,989 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 16:14:12,990 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 16:14:12,990 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:14:08" (3/4) ... [2022-07-14 16:14:12,992 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 16:14:12,992 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 16:14:12,993 INFO L158 Benchmark]: Toolchain (without parser) took 5085.74ms. Allocated memory was 83.9MB in the beginning and 161.5MB in the end (delta: 77.6MB). Free memory was 45.4MB in the beginning and 117.2MB in the end (delta: -71.8MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2022-07-14 16:14:12,993 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory was 62.7MB in the beginning and 62.6MB in the end (delta: 57.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 16:14:12,994 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.40ms. Allocated memory was 83.9MB in the beginning and 117.4MB in the end (delta: 33.6MB). Free memory was 45.2MB in the beginning and 89.9MB in the end (delta: -44.8MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2022-07-14 16:14:12,994 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.30ms. Allocated memory is still 117.4MB. Free memory was 89.9MB in the beginning and 87.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-14 16:14:12,994 INFO L158 Benchmark]: Boogie Preprocessor took 38.44ms. Allocated memory is still 117.4MB. Free memory was 87.3MB in the beginning and 85.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 16:14:12,995 INFO L158 Benchmark]: RCFGBuilder took 495.70ms. Allocated memory is still 117.4MB. Free memory was 85.2MB in the beginning and 65.9MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-14 16:14:12,995 INFO L158 Benchmark]: BuchiAutomizer took 4201.72ms. Allocated memory was 117.4MB in the beginning and 161.5MB in the end (delta: 44.0MB). Free memory was 65.9MB in the beginning and 117.2MB in the end (delta: -51.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 16:14:12,996 INFO L158 Benchmark]: Witness Printer took 2.58ms. Allocated memory is still 161.5MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 16:14:12,998 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.18ms. Allocated memory is still 83.9MB. Free memory was 62.7MB in the beginning and 62.6MB in the end (delta: 57.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.40ms. Allocated memory was 83.9MB in the beginning and 117.4MB in the end (delta: 33.6MB). Free memory was 45.2MB in the beginning and 89.9MB in the end (delta: -44.8MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.30ms. Allocated memory is still 117.4MB. Free memory was 89.9MB in the beginning and 87.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.44ms. Allocated memory is still 117.4MB. Free memory was 87.3MB in the beginning and 85.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 495.70ms. Allocated memory is still 117.4MB. Free memory was 85.2MB in the beginning and 65.9MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 4201.72ms. Allocated memory was 117.4MB in the beginning and 161.5MB in the end (delta: 44.0MB). Free memory was 65.9MB in the beginning and 117.2MB in the end (delta: -51.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.58ms. Allocated memory is still 161.5MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 15 + -2 * i2 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 64 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 338 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 337 mSDsluCounter, 1348 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 930 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 418 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital145 mio100 ax100 hnf100 lsp34 ukn100 mio100 lsp100 div129 bol100 ite100 ukn100 eq175 hnf85 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 38ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-14 16:14:13,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE