./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5fbdf5bf 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.3.ufo.BOUNDED-6.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 07d26b06d586d42c162be3f3e932eb08baf149e0 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-31 04:45:40,451 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-31 04:45:40,454 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-31 04:45:40,502 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-31 04:45:40,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-31 04:45:40,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-31 04:45:40,508 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-31 04:45:40,514 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-31 04:45:40,524 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-31 04:45:40,533 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-31 04:45:40,535 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-31 04:45:40,539 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-31 04:45:40,539 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-31 04:45:40,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-31 04:45:40,544 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-31 04:45:40,547 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-31 04:45:40,548 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-31 04:45:40,549 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-31 04:45:40,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-31 04:45:40,552 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-31 04:45:40,553 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-31 04:45:40,554 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-31 04:45:40,555 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-31 04:45:40,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-31 04:45:40,558 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-31 04:45:40,558 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-31 04:45:40,558 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-31 04:45:40,559 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-31 04:45:40,559 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-31 04:45:40,560 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-31 04:45:40,560 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-31 04:45:40,561 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-31 04:45:40,562 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-31 04:45:40,562 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-31 04:45:40,563 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-31 04:45:40,563 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-31 04:45:40,564 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-31 04:45:40,564 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-31 04:45:40,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-31 04:45:40,565 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-31 04:45:40,565 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-31 04:45:40,570 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-31 04:45:40,610 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-31 04:45:40,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-31 04:45:40,611 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-31 04:45:40,611 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-31 04:45:40,613 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-31 04:45:40,613 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-31 04:45:40,613 INFO L138 SettingsManager]: * Use SBE=true [2021-08-31 04:45:40,613 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-31 04:45:40,614 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-31 04:45:40,614 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-31 04:45:40,614 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-31 04:45:40,615 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-31 04:45:40,615 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-31 04:45:40,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-31 04:45:40,615 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-31 04:45:40,615 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-31 04:45:40,615 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-31 04:45:40,615 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-31 04:45:40,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-31 04:45:40,616 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-31 04:45:40,616 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-31 04:45:40,616 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-31 04:45:40,616 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-31 04:45:40,616 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-31 04:45:40,616 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-31 04:45:40,617 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-31 04:45:40,617 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-31 04:45:40,617 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-31 04:45:40,617 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-31 04:45:40,617 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-31 04:45:40,617 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-31 04:45:40,618 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-31 04:45:40,619 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-31 04:45:40,619 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 -> 07d26b06d586d42c162be3f3e932eb08baf149e0 [2021-08-31 04:45:40,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-31 04:45:40,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-31 04:45:40,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-31 04:45:40,958 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-31 04:45:40,959 INFO L275 PluginConnector]: CDTParser initialized [2021-08-31 04:45:40,960 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c [2021-08-31 04:45:41,025 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cc6af5e2/3a3c12f344b749bb874095130dbcee58/FLAG6b55d49d4 [2021-08-31 04:45:41,593 INFO L306 CDTParser]: Found 1 translation units. [2021-08-31 04:45:41,593 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c [2021-08-31 04:45:41,603 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cc6af5e2/3a3c12f344b749bb874095130dbcee58/FLAG6b55d49d4 [2021-08-31 04:45:42,046 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cc6af5e2/3a3c12f344b749bb874095130dbcee58 [2021-08-31 04:45:42,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-31 04:45:42,052 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-31 04:45:42,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-31 04:45:42,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-31 04:45:42,056 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-31 04:45:42,057 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 04:45:42" (1/1) ... [2021-08-31 04:45:42,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47818d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:45:42, skipping insertion in model container [2021-08-31 04:45:42,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 04:45:42" (1/1) ... [2021-08-31 04:45:42,065 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-31 04:45:42,096 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-31 04:45:42,271 WARN L228 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.3.ufo.BOUNDED-6.pals.c[6018,6031] [2021-08-31 04:45:42,280 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 04:45:42,336 INFO L203 MainTranslator]: Completed pre-run [2021-08-31 04:45:42,385 WARN L228 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.3.ufo.BOUNDED-6.pals.c[6018,6031] [2021-08-31 04:45:42,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-31 04:45:42,405 INFO L208 MainTranslator]: Completed translation [2021-08-31 04:45:42,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:45:42 WrapperNode [2021-08-31 04:45:42,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-31 04:45:42,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-31 04:45:42,408 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-31 04:45:42,408 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-31 04:45:42,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:45:42" (1/1) ... [2021-08-31 04:45:42,435 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:45:42" (1/1) ... [2021-08-31 04:45:42,465 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-31 04:45:42,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-31 04:45:42,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-31 04:45:42,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-31 04:45:42,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:45:42" (1/1) ... [2021-08-31 04:45:42,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:45:42" (1/1) ... [2021-08-31 04:45:42,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:45:42" (1/1) ... [2021-08-31 04:45:42,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:45:42" (1/1) ... [2021-08-31 04:45:42,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:45:42" (1/1) ... [2021-08-31 04:45:42,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:45:42" (1/1) ... [2021-08-31 04:45:42,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:45:42" (1/1) ... [2021-08-31 04:45:42,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-31 04:45:42,514 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-31 04:45:42,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-31 04:45:42,515 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-31 04:45:42,515 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:45:42" (1/1) ... [2021-08-31 04:45:42,523 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:45:42,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:45:42,545 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:45:42,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-31 04:45:42,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-31 04:45:42,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-31 04:45:42,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-31 04:45:42,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-31 04:45:42,881 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-31 04:45:42,882 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2021-08-31 04:45:42,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 04:45:42 BoogieIcfgContainer [2021-08-31 04:45:42,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-31 04:45:42,885 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-31 04:45:42,885 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-31 04:45:42,888 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-31 04:45:42,888 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 04:45:42,888 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.08 04:45:42" (1/3) ... [2021-08-31 04:45:42,889 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26798487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 04:45:42, skipping insertion in model container [2021-08-31 04:45:42,889 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 04:45:42,890 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 04:45:42" (2/3) ... [2021-08-31 04:45:42,890 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26798487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.08 04:45:42, skipping insertion in model container [2021-08-31 04:45:42,890 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-31 04:45:42,890 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 04:45:42" (3/3) ... [2021-08-31 04:45:42,891 INFO L389 chiAutomizerObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c [2021-08-31 04:45:42,937 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-31 04:45:42,937 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-31 04:45:42,937 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-31 04:45:42,937 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-31 04:45:42,937 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-31 04:45:42,937 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-31 04:45:42,937 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-31 04:45:42,938 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-31 04:45:42,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 61 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 60 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:45:42,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2021-08-31 04:45:42,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:45:42,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:45:42,991 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:45:42,991 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:45:42,991 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-31 04:45:42,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 61 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 60 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:45:43,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2021-08-31 04:45:43,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:45:43,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:45:43,003 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:45:43,004 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:45:43,011 INFO L791 eck$LassoCheckResult]: Stem: 45#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 36#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~ret23, main_#t~ret24, main_#t~post25, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~id3~0 := main_#t~nondet19;havoc main_#t~nondet19;~st3~0 := main_#t~nondet20;havoc main_#t~nondet20;~send3~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode3~0 := main_#t~nondet22;havoc main_#t~nondet22;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 53#L130true assume !(0 == ~r1~0);init_~tmp~0 := 0; 57#L130-1true init_#res := init_~tmp~0; 31#L195true main_#t~ret23 := init_#res;main_~i2~0 := main_#t~ret23;havoc main_#t~ret23; 32#L247true assume !(0 == main_~i2~0); 7#L247-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;main_~i2~0 := 0; 54#L255-2true [2021-08-31 04:45:43,012 INFO L793 eck$LassoCheckResult]: Loop: 54#L255-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 4#L54true 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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 33#L58true assume !(node1_~m1~0 != ~nomsg~0); 11#L58-1true ~mode1~0 := 0; 12#L54-2true havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 10#L80true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 20#L83true assume !(node2_~m2~0 != ~nomsg~0); 62#L83-1true ~mode2~0 := 0; 17#L80-2true havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 16#L105true assume !(0 != ~mode3~0 % 256); 21#L118true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 51#L118-2true ~p3_new~0 := (if node3_#t~ite9 % 256 <= 127 then node3_#t~ite9 % 256 else node3_#t~ite9 % 256 - 256);havoc node3_#t~ite9;~mode3~0 := 1; 38#L105-2true ~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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 22#L203true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 35#L203-1true check_#res := check_~tmp~1; 61#L223true main_#t~ret24 := check_#res;main_~c1~0 := main_#t~ret24;havoc main_#t~ret24;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 48#L279true assume !(0 == assert_~arg % 256); 18#L274true main_#t~post25 := main_~i2~0;main_~i2~0 := 1 + main_#t~post25;havoc main_#t~post25; 54#L255-2true [2021-08-31 04:45:43,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:45:43,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1892699938, now seen corresponding path program 1 times [2021-08-31 04:45:43,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:45:43,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924504256] [2021-08-31 04:45:43,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:45:43,029 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:45:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:45:43,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:45:43,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:45:43,304 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924504256] [2021-08-31 04:45:43,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924504256] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:45:43,306 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:45:43,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-31 04:45:43,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816574856] [2021-08-31 04:45:43,319 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-31 04:45:43,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:45:43,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1735879462, now seen corresponding path program 1 times [2021-08-31 04:45:43,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:45:43,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798536604] [2021-08-31 04:45:43,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:45:43,321 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:45:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:45:43,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:45:43,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:45:43,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798536604] [2021-08-31 04:45:43,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798536604] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:45:43,510 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:45:43,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-31 04:45:43,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815680353] [2021-08-31 04:45:43,511 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:45:43,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:45:43,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-31 04:45:43,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-31 04:45:43,538 INFO L87 Difference]: Start difference. First operand has 61 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 60 states have internal predecessors, (100), 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) [2021-08-31 04:45:43,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:45:43,896 INFO L93 Difference]: Finished difference Result 99 states and 154 transitions. [2021-08-31 04:45:43,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-31 04:45:43,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 154 transitions. [2021-08-31 04:45:43,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2021-08-31 04:45:43,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 90 states and 130 transitions. [2021-08-31 04:45:43,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2021-08-31 04:45:43,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2021-08-31 04:45:43,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 130 transitions. [2021-08-31 04:45:43,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:45:43,922 INFO L681 BuchiCegarLoop]: Abstraction has 90 states and 130 transitions. [2021-08-31 04:45:43,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 130 transitions. [2021-08-31 04:45:43,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 56. [2021-08-31 04:45:43,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 55 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:45:43,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2021-08-31 04:45:43,958 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 76 transitions. [2021-08-31 04:45:43,958 INFO L587 BuchiCegarLoop]: Abstraction has 56 states and 76 transitions. [2021-08-31 04:45:43,959 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-31 04:45:43,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 76 transitions. [2021-08-31 04:45:43,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2021-08-31 04:45:43,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:45:43,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:45:43,966 INFO L842 BuchiCegarLoop]: 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] [2021-08-31 04:45:43,966 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:45:43,970 INFO L791 eck$LassoCheckResult]: Stem: 230#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 221#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~ret23, main_#t~ret24, main_#t~post25, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~id3~0 := main_#t~nondet19;havoc main_#t~nondet19;~st3~0 := main_#t~nondet20;havoc main_#t~nondet20;~send3~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode3~0 := main_#t~nondet22;havoc main_#t~nondet22;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 222#L130 assume 0 == ~r1~0; 226#L131 assume ~id1~0 >= 0; 227#L132 assume 0 == ~st1~0; 223#L133 assume ~send1~0 == ~id1~0; 224#L134 assume 0 == ~mode1~0 % 256; 217#L135 assume ~id2~0 >= 0; 197#L136 assume 0 == ~st2~0; 198#L137 assume ~send2~0 == ~id2~0; 233#L138 assume 0 == ~mode2~0 % 256; 210#L139 assume ~id3~0 >= 0; 211#L140 assume 0 == ~st3~0; 228#L141 assume ~send3~0 == ~id3~0; 214#L142 assume 0 == ~mode3~0 % 256; 213#L143 assume ~id1~0 != ~id2~0; 187#L144 assume ~id1~0 != ~id3~0; 188#L145 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 232#L130-1 init_#res := init_~tmp~0; 218#L195 main_#t~ret23 := init_#res;main_~i2~0 := main_#t~ret23;havoc main_#t~ret23; 219#L247 assume !(0 == main_~i2~0); 189#L247-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;main_~i2~0 := 0; 190#L255-2 [2021-08-31 04:45:43,970 INFO L793 eck$LassoCheckResult]: Loop: 190#L255-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 178#L54 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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 179#L58 assume !(node1_~m1~0 != ~nomsg~0); 194#L58-1 ~mode1~0 := 0; 186#L54-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 191#L80 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 192#L83 assume !(node2_~m2~0 != ~nomsg~0); 205#L83-1 ~mode2~0 := 0; 202#L80-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 199#L105 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 200#L108 assume !(node3_~m3~0 != ~nomsg~0); 195#L108-1 ~mode3~0 := 0; 196#L105-2 ~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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 208#L203 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 182#L203-1 check_#res := check_~tmp~1; 220#L223 main_#t~ret24 := check_#res;main_~c1~0 := main_#t~ret24;havoc main_#t~ret24;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 231#L279 assume !(0 == assert_~arg % 256); 203#L274 main_#t~post25 := main_~i2~0;main_~i2~0 := 1 + main_#t~post25;havoc main_#t~post25; 190#L255-2 [2021-08-31 04:45:43,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:45:43,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 1 times [2021-08-31 04:45:43,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:45:43,972 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837242502] [2021-08-31 04:45:43,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:45:43,972 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:45:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:45:44,013 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:45:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:45:44,073 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:45:44,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:45:44,075 INFO L82 PathProgramCache]: Analyzing trace with hash 517894064, now seen corresponding path program 1 times [2021-08-31 04:45:44,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:45:44,076 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074912337] [2021-08-31 04:45:44,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:45:44,079 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:45:44,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:45:44,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:45:44,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:45:44,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074912337] [2021-08-31 04:45:44,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074912337] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:45:44,189 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:45:44,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-31 04:45:44,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114012885] [2021-08-31 04:45:44,194 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:45:44,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:45:44,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-31 04:45:44,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-31 04:45:44,196 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. cyclomatic complexity: 21 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:45:44,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:45:44,420 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2021-08-31 04:45:44,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-31 04:45:44,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 78 transitions. [2021-08-31 04:45:44,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2021-08-31 04:45:44,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 56 states and 73 transitions. [2021-08-31 04:45:44,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2021-08-31 04:45:44,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2021-08-31 04:45:44,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 73 transitions. [2021-08-31 04:45:44,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:45:44,423 INFO L681 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2021-08-31 04:45:44,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 73 transitions. [2021-08-31 04:45:44,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-08-31 04:45:44,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 55 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:45:44,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2021-08-31 04:45:44,426 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2021-08-31 04:45:44,426 INFO L587 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2021-08-31 04:45:44,427 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-31 04:45:44,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 73 transitions. [2021-08-31 04:45:44,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2021-08-31 04:45:44,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:45:44,427 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:45:44,428 INFO L842 BuchiCegarLoop]: 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] [2021-08-31 04:45:44,428 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:45:44,430 INFO L791 eck$LassoCheckResult]: Stem: 357#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 348#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~ret23, main_#t~ret24, main_#t~post25, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~id3~0 := main_#t~nondet19;havoc main_#t~nondet19;~st3~0 := main_#t~nondet20;havoc main_#t~nondet20;~send3~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode3~0 := main_#t~nondet22;havoc main_#t~nondet22;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 349#L130 assume 0 == ~r1~0; 353#L131 assume ~id1~0 >= 0; 354#L132 assume 0 == ~st1~0; 350#L133 assume ~send1~0 == ~id1~0; 351#L134 assume 0 == ~mode1~0 % 256; 344#L135 assume ~id2~0 >= 0; 324#L136 assume 0 == ~st2~0; 325#L137 assume ~send2~0 == ~id2~0; 360#L138 assume 0 == ~mode2~0 % 256; 337#L139 assume ~id3~0 >= 0; 338#L140 assume 0 == ~st3~0; 355#L141 assume ~send3~0 == ~id3~0; 341#L142 assume 0 == ~mode3~0 % 256; 340#L143 assume ~id1~0 != ~id2~0; 312#L144 assume ~id1~0 != ~id3~0; 313#L145 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 359#L130-1 init_#res := init_~tmp~0; 345#L195 main_#t~ret23 := init_#res;main_~i2~0 := main_#t~ret23;havoc main_#t~ret23; 346#L247 assume !(0 == main_~i2~0); 314#L247-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;main_~i2~0 := 0; 315#L255-2 [2021-08-31 04:45:44,430 INFO L793 eck$LassoCheckResult]: Loop: 315#L255-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 305#L54 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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 306#L58 assume !(node1_~m1~0 != ~nomsg~0); 321#L58-1 ~mode1~0 := 0; 317#L54-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 318#L80 assume !(0 != ~mode2~0 % 256); 320#L93 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite8 := ~send2~0; 339#L93-2 ~p2_new~0 := (if node2_#t~ite8 % 256 <= 127 then node2_#t~ite8 % 256 else node2_#t~ite8 % 256 - 256);havoc node2_#t~ite8;~mode2~0 := 1; 329#L80-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 326#L105 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 327#L108 assume !(node3_~m3~0 != ~nomsg~0); 322#L108-1 ~mode3~0 := 0; 323#L105-2 ~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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 335#L203 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 336#L204 assume ~r1~0 >= 3; 309#L208 assume ~r1~0 < 3;check_~tmp~1 := 1; 311#L203-1 check_#res := check_~tmp~1; 347#L223 main_#t~ret24 := check_#res;main_~c1~0 := main_#t~ret24;havoc main_#t~ret24;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 358#L279 assume !(0 == assert_~arg % 256); 330#L274 main_#t~post25 := main_~i2~0;main_~i2~0 := 1 + main_#t~post25;havoc main_#t~post25; 315#L255-2 [2021-08-31 04:45:44,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:45:44,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 2 times [2021-08-31 04:45:44,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:45:44,431 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065281505] [2021-08-31 04:45:44,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:45:44,432 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:45:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:45:44,459 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:45:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:45:44,498 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:45:44,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:45:44,499 INFO L82 PathProgramCache]: Analyzing trace with hash 560827798, now seen corresponding path program 1 times [2021-08-31 04:45:44,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:45:44,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022304589] [2021-08-31 04:45:44,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:45:44,499 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:45:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:45:44,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:45:44,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:45:44,533 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022304589] [2021-08-31 04:45:44,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022304589] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:45:44,533 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:45:44,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-31 04:45:44,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799484615] [2021-08-31 04:45:44,534 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-31 04:45:44,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:45:44,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-31 04:45:44,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-31 04:45:44,534 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. cyclomatic complexity: 18 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:45:44,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:45:44,691 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2021-08-31 04:45:44,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-31 04:45:44,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 113 transitions. [2021-08-31 04:45:44,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2021-08-31 04:45:44,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 113 transitions. [2021-08-31 04:45:44,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2021-08-31 04:45:44,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2021-08-31 04:45:44,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 113 transitions. [2021-08-31 04:45:44,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:45:44,695 INFO L681 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2021-08-31 04:45:44,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 113 transitions. [2021-08-31 04:45:44,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-08-31 04:45:44,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 83 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:45:44,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2021-08-31 04:45:44,699 INFO L704 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2021-08-31 04:45:44,699 INFO L587 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2021-08-31 04:45:44,700 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-31 04:45:44,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 113 transitions. [2021-08-31 04:45:44,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2021-08-31 04:45:44,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-31 04:45:44,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-31 04:45:44,701 INFO L842 BuchiCegarLoop]: 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] [2021-08-31 04:45:44,701 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-31 04:45:44,701 INFO L791 eck$LassoCheckResult]: Stem: 510#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 500#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~ret23, main_#t~ret24, main_#t~post25, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~id3~0 := main_#t~nondet19;havoc main_#t~nondet19;~st3~0 := main_#t~nondet20;havoc main_#t~nondet20;~send3~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode3~0 := main_#t~nondet22;havoc main_#t~nondet22;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 501#L130 assume 0 == ~r1~0; 506#L131 assume ~id1~0 >= 0; 507#L132 assume 0 == ~st1~0; 503#L133 assume ~send1~0 == ~id1~0; 504#L134 assume 0 == ~mode1~0 % 256; 494#L135 assume ~id2~0 >= 0; 471#L136 assume 0 == ~st2~0; 472#L137 assume ~send2~0 == ~id2~0; 514#L138 assume 0 == ~mode2~0 % 256; 486#L139 assume ~id3~0 >= 0; 487#L140 assume 0 == ~st3~0; 508#L141 assume ~send3~0 == ~id3~0; 490#L142 assume 0 == ~mode3~0 % 256; 489#L143 assume ~id1~0 != ~id2~0; 462#L144 assume ~id1~0 != ~id3~0; 463#L145 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 513#L130-1 init_#res := init_~tmp~0; 495#L195 main_#t~ret23 := init_#res;main_~i2~0 := main_#t~ret23;havoc main_#t~ret23; 496#L247 assume !(0 == main_~i2~0); 458#L247-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;main_~i2~0 := 0; 459#L255-2 [2021-08-31 04:45:44,701 INFO L793 eck$LassoCheckResult]: Loop: 459#L255-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 532#L54 assume !(0 != ~mode1~0 % 256); 531#L68 assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite7 := ~p1_new~0; 530#L68-2 ~p1_new~0 := (if node1_#t~ite7 % 256 <= 127 then node1_#t~ite7 % 256 else node1_#t~ite7 % 256 - 256);havoc node1_#t~ite7;~mode1~0 := 1; 468#L54-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 529#L80 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 480#L83 assume !(node2_~m2~0 != ~nomsg~0); 481#L83-1 ~mode2~0 := 0; 476#L80-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 473#L105 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 474#L108 assume !(node3_~m3~0 != ~nomsg~0); 469#L108-1 ~mode3~0 := 0; 470#L105-2 ~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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 484#L203 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 485#L204 assume !(~r1~0 >= 3); 454#L207 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 455#L208 assume ~r1~0 < 3;check_~tmp~1 := 1; 498#L203-1 check_#res := check_~tmp~1; 499#L223 main_#t~ret24 := check_#res;main_~c1~0 := main_#t~ret24;havoc main_#t~ret24;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 511#L279 assume !(0 == assert_~arg % 256); 512#L274 main_#t~post25 := main_~i2~0;main_~i2~0 := 1 + main_#t~post25;havoc main_#t~post25; 459#L255-2 [2021-08-31 04:45:44,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:45:44,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 3 times [2021-08-31 04:45:44,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:45:44,702 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766826141] [2021-08-31 04:45:44,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:45:44,703 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:45:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:45:44,713 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:45:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:45:44,727 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:45:44,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:45:44,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1510300447, now seen corresponding path program 1 times [2021-08-31 04:45:44,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:45:44,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78599453] [2021-08-31 04:45:44,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:45:44,728 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:45:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:45:44,734 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-31 04:45:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-31 04:45:44,743 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-31 04:45:44,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:45:44,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1506642211, now seen corresponding path program 1 times [2021-08-31 04:45:44,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-31 04:45:44,744 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144788211] [2021-08-31 04:45:44,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-31 04:45:44,745 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-31 04:45:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:45:44,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:45:44,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-31 04:45:44,818 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144788211] [2021-08-31 04:45:44,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144788211] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-31 04:45:44,818 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-31 04:45:44,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-31 04:45:44,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662037443] [2021-08-31 04:45:45,355 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 04:45:45,356 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 04:45:45,356 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 04:45:45,356 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 04:45:45,356 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-31 04:45:45,357 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:45:45,357 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 04:45:45,360 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 04:45:45,360 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2021-08-31 04:45:45,360 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 04:45:45,360 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 04:45:45,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:45,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:45,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:45,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:45,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:45,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:45,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:45,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:45,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:45,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:45,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:45,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:45,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:45,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:45,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:45,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:45,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:45,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:45,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:45,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:46,726 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 04:45:46,727 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-31 04:45:46,729 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:45:46,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:45:46,731 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:45:46,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-08-31 04:45:46,743 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-31 04:45:46,745 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:45:46,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-08-31 04:45:46,774 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:45:46,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:45:46,775 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:45:46,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-08-31 04:45:46,777 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-31 04:45:46,777 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-31 04:45:46,806 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-31 04:45:46,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-08-31 04:45:46,812 INFO L210 LassoAnalysis]: Preferences: [2021-08-31 04:45:46,812 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-31 04:45:46,812 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-31 04:45:46,812 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-31 04:45:46,812 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-31 04:45:46,812 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:45:46,813 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-31 04:45:46,813 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-31 04:45:46,813 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2021-08-31 04:45:46,813 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-31 04:45:46,813 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-31 04:45:46,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:46,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:46,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:46,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:46,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:46,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:46,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:46,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:46,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:46,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:46,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:46,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:46,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:46,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:46,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:46,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:46,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:46,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:46,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:46,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-31 04:45:47,883 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-31 04:45:47,886 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-31 04:45:47,887 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:45:47,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:45:47,889 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:45:47,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-31 04:45:47,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-08-31 04:45:47,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-31 04:45:47,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-31 04:45:47,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-31 04:45:47,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-31 04:45:47,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-31 04:45:47,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-31 04:45:47,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-31 04:45:47,912 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-31 04:45:47,915 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-31 04:45:47,915 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-31 04:45:47,916 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-31 04:45:47,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-31 04:45:47,922 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-31 04:45:47,932 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-31 04:45:47,933 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-31 04:45:47,933 INFO L513 LassoAnalysis]: Proved termination. [2021-08-31 04:45:47,934 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2021-08-31 04:45:47,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-08-31 04:45:47,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-08-31 04:45:47,960 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-31 04:45:47,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-31 04:45:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:45:48,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-31 04:45:48,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 04:45:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-31 04:45:48,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-31 04:45:48,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-31 04:45:48,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-31 04:45:48,209 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-08-31 04:45:48,210 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84 states and 113 transitions. cyclomatic complexity: 30 Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:45:48,317 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84 states and 113 transitions. cyclomatic complexity: 30. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 145 states and 204 transitions. Complement of second has 4 states. [2021-08-31 04:45:48,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-08-31 04:45:48,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:45:48,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2021-08-31 04:45:48,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 22 letters. Loop has 21 letters. [2021-08-31 04:45:48,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 04:45:48,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 43 letters. Loop has 21 letters. [2021-08-31 04:45:48,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 04:45:48,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 22 letters. Loop has 42 letters. [2021-08-31 04:45:48,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-31 04:45:48,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 204 transitions. [2021-08-31 04:45:48,327 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-31 04:45:48,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 0 states and 0 transitions. [2021-08-31 04:45:48,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-31 04:45:48,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-31 04:45:48,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-31 04:45:48,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:45:48,328 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 04:45:48,328 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 04:45:48,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-31 04:45:48,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-31 04:45:48,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-31 04:45:48,329 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-31 04:45:48,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-31 04:45:48,329 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-08-31 04:45:48,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-31 04:45:48,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2021-08-31 04:45:48,333 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-31 04:45:48,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2021-08-31 04:45:48,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-31 04:45:48,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-31 04:45:48,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-31 04:45:48,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-31 04:45:48,344 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 04:45:48,344 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 04:45:48,344 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-31 04:45:48,344 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-31 04:45:48,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-08-31 04:45:48,344 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-31 04:45:48,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-08-31 04:45:48,347 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) at de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData.toString(StatisticsData.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerTimingBenchmark.toString(BuchiAutomizerTimingBenchmark.java:44) at de.uni_freiburg.informatik.ultimate.core.lib.results.StatisticsResult.getLongDescription(StatisticsResult.java:58) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.reportResult(BuchiAutomizerObserver.java:375) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:161) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:398) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-31 04:45:48,350 INFO L158 Benchmark]: Toolchain (without parser) took 6297.47ms. Allocated memory was 56.6MB in the beginning and 83.9MB in the end (delta: 27.3MB). Free memory was 34.3MB in the beginning and 60.4MB in the end (delta: -26.1MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. [2021-08-31 04:45:48,350 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 56.6MB. Free memory was 38.2MB in the beginning and 38.1MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-31 04:45:48,351 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.80ms. Allocated memory is still 56.6MB. Free memory was 34.1MB in the beginning and 37.5MB in the end (delta: -3.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-08-31 04:45:48,351 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.40ms. Allocated memory is still 56.6MB. Free memory was 37.3MB in the beginning and 35.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 04:45:48,351 INFO L158 Benchmark]: Boogie Preprocessor took 47.55ms. Allocated memory is still 56.6MB. Free memory was 35.5MB in the beginning and 33.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-31 04:45:48,352 INFO L158 Benchmark]: RCFGBuilder took 369.53ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 33.8MB in the beginning and 48.6MB in the end (delta: -14.9MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2021-08-31 04:45:48,352 INFO L158 Benchmark]: BuchiAutomizer took 5463.95ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 48.6MB in the beginning and 60.4MB in the end (delta: -11.8MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. [2021-08-31 04:45:48,354 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.15ms. Allocated memory is still 56.6MB. Free memory was 38.2MB in the beginning and 38.1MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.80ms. Allocated memory is still 56.6MB. Free memory was 34.1MB in the beginning and 37.5MB in the end (delta: -3.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.40ms. Allocated memory is still 56.6MB. Free memory was 37.3MB in the beginning and 35.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.55ms. Allocated memory is still 56.6MB. Free memory was 35.5MB in the beginning and 33.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 369.53ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 33.8MB in the beginning and 48.6MB in the end (delta: -14.9MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 5463.95ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 48.6MB in the beginning and 60.4MB in the end (delta: -11.8MB). Peak memory consumption was 37.5MB. 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 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 8 locations. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: ClassCastException: class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator cannot be cast to class de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData (de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsAggregator and de.uni_freiburg.informatik.ultimate.util.statistics.StatisticsData are in unnamed module of loader org.eclipse.osgi.internal.loader.EquinoxClassLoader @560348e6): de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoopBenchmark.prettyprintBenchmarkData(BuchiCegarLoopBenchmark.java:178) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-31 04:45:48,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-08-31 04:45:48,580 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...