./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec 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.1.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 eee91c19016e0e0d442fe120ce120b855cb8f82c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 16:56:18,339 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 16:56:18,340 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 16:56:18,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 16:56:18,378 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 16:56:18,381 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 16:56:18,383 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 16:56:18,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 16:56:18,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 16:56:18,398 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 16:56:18,408 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 16:56:18,416 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 16:56:18,417 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 16:56:18,420 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 16:56:18,422 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 16:56:18,426 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 16:56:18,427 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 16:56:18,428 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 16:56:18,431 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 16:56:18,435 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 16:56:18,437 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 16:56:18,438 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 16:56:18,441 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 16:56:18,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 16:56:18,446 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 16:56:18,447 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 16:56:18,447 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 16:56:18,449 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 16:56:18,450 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 16:56:18,451 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 16:56:18,451 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 16:56:18,452 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 16:56:18,453 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 16:56:18,454 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 16:56:18,455 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 16:56:18,455 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 16:56:18,456 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 16:56:18,456 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 16:56:18,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 16:56:18,458 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 16:56:18,459 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 16:56:18,460 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 16:56:18,498 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 16:56:18,498 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 16:56:18,499 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 16:56:18,499 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 16:56:18,501 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 16:56:18,501 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 16:56:18,501 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 16:56:18,502 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 16:56:18,502 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 16:56:18,502 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 16:56:18,503 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 16:56:18,503 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 16:56:18,503 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 16:56:18,504 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 16:56:18,504 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 16:56:18,504 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 16:56:18,504 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 16:56:18,504 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 16:56:18,504 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 16:56:18,505 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 16:56:18,505 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 16:56:18,505 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 16:56:18,505 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 16:56:18,505 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 16:56:18,506 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 16:56:18,506 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 16:56:18,506 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 16:56:18,506 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 16:56:18,506 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 16:56:18,507 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 16:56:18,507 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 16:56:18,507 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 16:56:18,508 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 16:56:18,509 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 -> eee91c19016e0e0d442fe120ce120b855cb8f82c [2021-08-27 16:56:18,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 16:56:18,855 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 16:56:18,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 16:56:18,859 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 16:56:18,860 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 16:56:18,861 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2021-08-27 16:56:18,937 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62b52c1bf/5739dcd9fa984beaa8ba4ae957b7c001/FLAGf4cdfe928 [2021-08-27 16:56:19,384 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 16:56:19,384 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2021-08-27 16:56:19,392 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62b52c1bf/5739dcd9fa984beaa8ba4ae957b7c001/FLAGf4cdfe928 [2021-08-27 16:56:19,778 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62b52c1bf/5739dcd9fa984beaa8ba4ae957b7c001 [2021-08-27 16:56:19,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 16:56:19,784 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 16:56:19,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 16:56:19,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 16:56:19,788 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 16:56:19,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:56:19" (1/1) ... [2021-08-27 16:56:19,790 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cafa0d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:56:19, skipping insertion in model container [2021-08-27 16:56:19,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:56:19" (1/1) ... [2021-08-27 16:56:19,796 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 16:56:19,839 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 16:56:20,032 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.1.ufo.BOUNDED-6.pals.c[6055,6068] [2021-08-27 16:56:20,033 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 16:56:20,041 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 16:56:20,126 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.1.ufo.BOUNDED-6.pals.c[6055,6068] [2021-08-27 16:56:20,130 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 16:56:20,146 INFO L208 MainTranslator]: Completed translation [2021-08-27 16:56:20,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:56:20 WrapperNode [2021-08-27 16:56:20,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 16:56:20,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 16:56:20,148 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 16:56:20,148 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 16:56:20,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:56:20" (1/1) ... [2021-08-27 16:56:20,173 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:56:20" (1/1) ... [2021-08-27 16:56:20,204 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 16:56:20,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 16:56:20,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 16:56:20,205 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 16:56:20,212 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:56:20" (1/1) ... [2021-08-27 16:56:20,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:56:20" (1/1) ... [2021-08-27 16:56:20,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:56:20" (1/1) ... [2021-08-27 16:56:20,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:56:20" (1/1) ... [2021-08-27 16:56:20,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:56:20" (1/1) ... [2021-08-27 16:56:20,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:56:20" (1/1) ... [2021-08-27 16:56:20,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:56:20" (1/1) ... [2021-08-27 16:56:20,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 16:56:20,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 16:56:20,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 16:56:20,242 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 16:56:20,243 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:56:20" (1/1) ... [2021-08-27 16:56:20,256 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:56:20,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:56:20,274 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-27 16:56:20,302 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-27 16:56:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 16:56:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 16:56:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 16:56:20,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 16:56:20,769 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 16:56:20,769 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2021-08-27 16:56:20,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:56:20 BoogieIcfgContainer [2021-08-27 16:56:20,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 16:56:20,771 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 16:56:20,772 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 16:56:20,774 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 16:56:20,775 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:56:20,775 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 04:56:19" (1/3) ... [2021-08-27 16:56:20,776 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@797621af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 04:56:20, skipping insertion in model container [2021-08-27 16:56:20,776 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:56:20,776 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:56:20" (2/3) ... [2021-08-27 16:56:20,776 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@797621af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 04:56:20, skipping insertion in model container [2021-08-27 16:56:20,776 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:56:20,776 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:56:20" (3/3) ... [2021-08-27 16:56:20,777 INFO L389 chiAutomizerObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2021-08-27 16:56:20,814 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 16:56:20,814 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 16:56:20,814 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 16:56:20,814 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 16:56:20,814 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 16:56:20,814 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 16:56:20,815 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 16:56:20,815 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 16:56:20,827 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-27 16:56:20,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2021-08-27 16:56:20,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:56:20,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:56:20,850 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:56:20,850 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-27 16:56:20,850 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 16:56:20,851 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-27 16:56:20,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2021-08-27 16:56:20,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:56:20,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:56:20,863 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:56:20,864 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-27 16:56:20,869 INFO L791 eck$LassoCheckResult]: Stem: 46#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(34);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]; 38#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; 54#L132true assume !(0 == ~r1~0);init_~tmp~0 := 0; 56#L132-1true init_#res := init_~tmp~0; 10#L197true main_#t~ret23 := init_#res;main_~i2~0 := main_#t~ret23;havoc main_#t~ret23; 9#L249true assume !(0 == main_~i2~0); 24#L249-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; 40#L257-2true [2021-08-27 16:56:20,870 INFO L793 eck$LassoCheckResult]: Loop: 40#L257-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; 37#L58true assume !(node1_~m1~0 != ~nomsg~0); 14#L58-1true ~mode1~0 := 0; 15#L54-2true havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 23#L82true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 34#L85true assume !(node2_~m2~0 != ~nomsg~0); 47#L85-1true ~mode2~0 := 0; 57#L82-2true havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 53#L107true assume !(0 != ~mode3~0 % 256); 44#L120true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 28#L120-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; 61#L107-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; 12#L205true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 48#L205-1true check_#res := check_~tmp~1; 36#L225true 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; 16#L281true assume !(0 == assert_~arg % 256); 7#L276true main_#t~post25 := main_~i2~0;main_~i2~0 := 1 + main_#t~post25;havoc main_#t~post25; 40#L257-2true [2021-08-27 16:56:20,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:56:20,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1892699938, now seen corresponding path program 1 times [2021-08-27 16:56:20,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:56:20,890 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723764115] [2021-08-27 16:56:20,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:56:20,891 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:56:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:56:21,157 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-27 16:56:21,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:56:21,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723764115] [2021-08-27 16:56:21,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723764115] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:56:21,172 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:56:21,173 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:56:21,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490981902] [2021-08-27 16:56:21,178 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:56:21,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:56:21,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1735879462, now seen corresponding path program 1 times [2021-08-27 16:56:21,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:56:21,179 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598635803] [2021-08-27 16:56:21,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:56:21,180 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:56:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:56:21,377 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-27 16:56:21,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:56:21,377 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598635803] [2021-08-27 16:56:21,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598635803] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:56:21,378 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:56:21,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:56:21,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083149774] [2021-08-27 16:56:21,379 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:56:21,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:56:21,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 16:56:21,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 16:56:21,393 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-27 16:56:21,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:56:21,474 INFO L93 Difference]: Finished difference Result 99 states and 154 transitions. [2021-08-27 16:56:21,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 16:56:21,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 154 transitions. [2021-08-27 16:56:21,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2021-08-27 16:56:21,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 90 states and 130 transitions. [2021-08-27 16:56:21,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2021-08-27 16:56:21,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2021-08-27 16:56:21,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 130 transitions. [2021-08-27 16:56:21,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:56:21,487 INFO L681 BuchiCegarLoop]: Abstraction has 90 states and 130 transitions. [2021-08-27 16:56:21,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 130 transitions. [2021-08-27 16:56:21,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 56. [2021-08-27 16:56:21,509 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-27 16:56:21,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2021-08-27 16:56:21,511 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 76 transitions. [2021-08-27 16:56:21,511 INFO L587 BuchiCegarLoop]: Abstraction has 56 states and 76 transitions. [2021-08-27 16:56:21,511 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 16:56:21,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 76 transitions. [2021-08-27 16:56:21,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2021-08-27 16:56:21,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:56:21,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:56:21,514 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-27 16:56:21,514 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-27 16:56:21,514 INFO L791 eck$LassoCheckResult]: Stem: 231#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(34);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]; 224#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; 225#L132 assume 0 == ~r1~0; 226#L133 assume ~id1~0 >= 0; 227#L134 assume 0 == ~st1~0; 222#L135 assume ~send1~0 == ~id1~0; 203#L136 assume 0 == ~mode1~0 % 256; 204#L137 assume ~id2~0 >= 0; 233#L138 assume 0 == ~st2~0; 213#L139 assume ~send2~0 == ~id2~0; 214#L140 assume 0 == ~mode2~0 % 256; 228#L141 assume ~id3~0 >= 0; 218#L142 assume 0 == ~st3~0; 216#L143 assume ~send3~0 == ~id3~0; 191#L144 assume 0 == ~mode3~0 % 256; 192#L145 assume ~id1~0 != ~id2~0; 206#L146 assume ~id1~0 != ~id3~0; 207#L147 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 230#L132-1 init_#res := init_~tmp~0; 193#L197 main_#t~ret23 := init_#res;main_~i2~0 := main_#t~ret23;havoc main_#t~ret23; 189#L249 assume !(0 == main_~i2~0); 190#L249-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; 188#L257-2 [2021-08-27 16:56:21,514 INFO L793 eck$LassoCheckResult]: Loop: 188#L257-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); 199#L58-1 ~mode1~0 := 0; 200#L54-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 201#L82 assume !(0 != ~mode2~0 % 256); 208#L95 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite8 := ~send2~0; 209#L95-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; 217#L82-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 232#L107 assume !(0 != ~mode3~0 % 256); 229#L120 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 215#L120-2 ~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; 205#L107-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; 194#L205 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 195#L205-1 check_#res := check_~tmp~1; 223#L225 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; 202#L281 assume !(0 == assert_~arg % 256); 187#L276 main_#t~post25 := main_~i2~0;main_~i2~0 := 1 + main_#t~post25;havoc main_#t~post25; 188#L257-2 [2021-08-27 16:56:21,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:56:21,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 1 times [2021-08-27 16:56:21,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:56:21,516 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174344035] [2021-08-27 16:56:21,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:56:21,516 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:56:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:56:21,537 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:56:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:56:21,584 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:56:21,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:56:21,585 INFO L82 PathProgramCache]: Analyzing trace with hash 2073672604, now seen corresponding path program 1 times [2021-08-27 16:56:21,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:56:21,585 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099305012] [2021-08-27 16:56:21,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:56:21,586 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:56:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:56:21,687 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-27 16:56:21,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:56:21,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099305012] [2021-08-27 16:56:21,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099305012] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:56:21,688 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:56:21,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:56:21,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137267409] [2021-08-27 16:56:21,689 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:56:21,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:56:21,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 16:56:21,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 16:56:21,690 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-27 16:56:21,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:56:21,738 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2021-08-27 16:56:21,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 16:56:21,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 78 transitions. [2021-08-27 16:56:21,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2021-08-27 16:56:21,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 56 states and 73 transitions. [2021-08-27 16:56:21,741 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2021-08-27 16:56:21,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2021-08-27 16:56:21,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 73 transitions. [2021-08-27 16:56:21,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:56:21,742 INFO L681 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2021-08-27 16:56:21,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 73 transitions. [2021-08-27 16:56:21,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-08-27 16:56:21,746 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-27 16:56:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2021-08-27 16:56:21,746 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2021-08-27 16:56:21,746 INFO L587 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2021-08-27 16:56:21,747 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 16:56:21,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 73 transitions. [2021-08-27 16:56:21,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2021-08-27 16:56:21,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:56:21,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:56:21,748 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-27 16:56:21,749 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-27 16:56:21,749 INFO L791 eck$LassoCheckResult]: Stem: 358#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(34);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]; 351#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; 352#L132 assume 0 == ~r1~0; 353#L133 assume ~id1~0 >= 0; 354#L134 assume 0 == ~st1~0; 349#L135 assume ~send1~0 == ~id1~0; 330#L136 assume 0 == ~mode1~0 % 256; 331#L137 assume ~id2~0 >= 0; 360#L138 assume 0 == ~st2~0; 340#L139 assume ~send2~0 == ~id2~0; 341#L140 assume 0 == ~mode2~0 % 256; 355#L141 assume ~id3~0 >= 0; 345#L142 assume 0 == ~st3~0; 343#L143 assume ~send3~0 == ~id3~0; 318#L144 assume 0 == ~mode3~0 % 256; 319#L145 assume ~id1~0 != ~id2~0; 333#L146 assume ~id1~0 != ~id3~0; 334#L147 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 357#L132-1 init_#res := init_~tmp~0; 320#L197 main_#t~ret23 := init_#res;main_~i2~0 := main_#t~ret23;havoc main_#t~ret23; 316#L249 assume !(0 == main_~i2~0); 317#L249-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#L257-2 [2021-08-27 16:56:21,749 INFO L793 eck$LassoCheckResult]: Loop: 315#L257-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); 326#L58-1 ~mode1~0 := 0; 327#L54-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 328#L82 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 338#L85 assume !(node2_~m2~0 != ~nomsg~0); 310#L85-1 ~mode2~0 := 0; 344#L82-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 359#L107 assume !(0 != ~mode3~0 % 256); 356#L120 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 342#L120-2 ~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; 332#L107-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; 321#L205 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 322#L206 assume ~r1~0 >= 3; 323#L210 assume ~r1~0 < 3;check_~tmp~1 := 1; 324#L205-1 check_#res := check_~tmp~1; 350#L225 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; 329#L281 assume !(0 == assert_~arg % 256); 314#L276 main_#t~post25 := main_~i2~0;main_~i2~0 := 1 + main_#t~post25;havoc main_#t~post25; 315#L257-2 [2021-08-27 16:56:21,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:56:21,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 2 times [2021-08-27 16:56:21,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:56:21,750 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068874950] [2021-08-27 16:56:21,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:56:21,751 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:56:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:56:21,768 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:56:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:56:21,793 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:56:21,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:56:21,794 INFO L82 PathProgramCache]: Analyzing trace with hash 317028502, now seen corresponding path program 1 times [2021-08-27 16:56:21,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:56:21,794 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726514726] [2021-08-27 16:56:21,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:56:21,794 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:56:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:56:21,820 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-27 16:56:21,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:56:21,820 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726514726] [2021-08-27 16:56:21,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726514726] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:56:21,821 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:56:21,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:56:21,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238876833] [2021-08-27 16:56:21,821 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:56:21,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:56:21,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:56:21,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:56:21,823 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-27 16:56:21,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:56:21,844 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2021-08-27 16:56:21,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 16:56:21,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 113 transitions. [2021-08-27 16:56:21,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2021-08-27 16:56:21,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 113 transitions. [2021-08-27 16:56:21,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2021-08-27 16:56:21,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2021-08-27 16:56:21,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 113 transitions. [2021-08-27 16:56:21,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:56:21,848 INFO L681 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2021-08-27 16:56:21,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 113 transitions. [2021-08-27 16:56:21,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-08-27 16:56:21,852 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-27 16:56:21,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2021-08-27 16:56:21,853 INFO L704 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2021-08-27 16:56:21,853 INFO L587 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2021-08-27 16:56:21,853 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 16:56:21,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 113 transitions. [2021-08-27 16:56:21,854 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2021-08-27 16:56:21,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:56:21,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:56:21,855 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-27 16:56:21,855 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-27 16:56:21,856 INFO L791 eck$LassoCheckResult]: Stem: 506#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(34);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]; 497#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; 498#L132 assume 0 == ~r1~0; 501#L133 assume ~id1~0 >= 0; 502#L134 assume 0 == ~st1~0; 495#L135 assume ~send1~0 == ~id1~0; 476#L136 assume 0 == ~mode1~0 % 256; 477#L137 assume ~id2~0 >= 0; 509#L138 assume 0 == ~st2~0; 487#L139 assume ~send2~0 == ~id2~0; 488#L140 assume 0 == ~mode2~0 % 256; 503#L141 assume ~id3~0 >= 0; 492#L142 assume 0 == ~st3~0; 490#L143 assume ~send3~0 == ~id3~0; 465#L144 assume 0 == ~mode3~0 % 256; 466#L145 assume ~id1~0 != ~id2~0; 479#L146 assume ~id1~0 != ~id3~0; 480#L147 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 505#L132-1 init_#res := init_~tmp~0; 464#L197 main_#t~ret23 := init_#res;main_~i2~0 := main_#t~ret23;havoc main_#t~ret23; 462#L249 assume !(0 == main_~i2~0); 463#L249-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; 485#L257-2 [2021-08-27 16:56:21,856 INFO L793 eck$LassoCheckResult]: Loop: 485#L257-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 530#L54 assume !(0 != ~mode1~0 % 256); 529#L70 assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite7 := ~p1_new~0; 528#L70-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; 472#L54-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 527#L82 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 524#L85 assume !(node2_~m2~0 != ~nomsg~0); 522#L85-1 ~mode2~0 := 0; 520#L82-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 519#L107 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 517#L110 assume !(node3_~m3~0 != ~nomsg~0); 514#L110-1 ~mode3~0 := 0; 512#L107-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; 511#L205 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 510#L206 assume !(~r1~0 >= 3); 499#L209 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 500#L210 assume ~r1~0 < 3;check_~tmp~1 := 1; 534#L205-1 check_#res := check_~tmp~1; 533#L225 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; 532#L281 assume !(0 == assert_~arg % 256); 531#L276 main_#t~post25 := main_~i2~0;main_~i2~0 := 1 + main_#t~post25;havoc main_#t~post25; 485#L257-2 [2021-08-27 16:56:21,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:56:21,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 3 times [2021-08-27 16:56:21,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:56:21,857 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283396299] [2021-08-27 16:56:21,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:56:21,857 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:56:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:56:21,886 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:56:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:56:21,922 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:56:21,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:56:21,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1510300447, now seen corresponding path program 1 times [2021-08-27 16:56:21,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:56:21,923 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771482123] [2021-08-27 16:56:21,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:56:21,923 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:56:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:56:21,944 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:56:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:56:21,960 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:56:21,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:56:21,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1506642211, now seen corresponding path program 1 times [2021-08-27 16:56:21,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:56:21,962 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337175982] [2021-08-27 16:56:21,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:56:21,963 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:56:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:56:22,121 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-27 16:56:22,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:56:22,121 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337175982] [2021-08-27 16:56:22,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337175982] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:56:22,123 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:56:22,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 16:56:22,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311321049] [2021-08-27 16:56:22,781 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:56:22,782 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:56:22,782 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:56:22,782 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:56:22,784 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 16:56:22,785 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:56:22,785 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:56:22,785 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:56:22,791 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2021-08-27 16:56:22,793 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:56:22,793 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:56:22,818 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-27 16:56:22,828 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-27 16:56:22,837 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-27 16:56:22,845 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-27 16:56:22,938 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-27 16:56:22,944 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-27 16:56:22,947 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-27 16:56:22,953 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-27 16:56:22,959 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-27 16:56:22,962 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-27 16:56:22,964 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-27 16:56:22,969 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-27 16:56:22,972 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-27 16:56:22,975 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-27 16:56:22,980 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-27 16:56:22,982 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-27 16:56:22,984 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-27 16:56:22,987 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-27 16:56:22,989 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-27 16:56:22,991 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-27 16:56:24,268 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:56:24,268 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 16:56:24,270 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:56:24,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:56:24,277 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-27 16:56:24,282 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:56:24,282 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:56:24,282 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-27 16:56:24,311 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-27 16:56:24,311 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:56:24,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:56:24,312 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-27 16:56:24,313 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-27 16:56:24,315 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 16:56:24,315 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:56:24,344 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 16:56:24,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2021-08-27 16:56:24,349 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:56:24,349 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:56:24,349 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:56:24,349 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:56:24,349 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 16:56:24,349 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:56:24,349 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:56:24,349 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:56:24,349 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2021-08-27 16:56:24,349 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:56:24,349 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:56:24,359 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-27 16:56:24,364 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-27 16:56:24,368 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-27 16:56:24,370 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-27 16:56:24,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:56:24,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:56:24,379 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-27 16:56:24,381 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-27 16:56:24,385 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-27 16:56:24,388 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-27 16:56:24,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:56:24,469 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-27 16:56:24,474 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-27 16:56:24,479 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-27 16:56:24,481 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-27 16:56:24,487 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-27 16:56:24,489 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-27 16:56:24,492 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-27 16:56:24,494 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-27 16:56:24,496 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-27 16:56:25,689 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:56:25,693 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 16:56:25,694 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:56:25,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:56:25,697 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-27 16:56:25,697 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-27 16:56:25,699 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-27 16:56:25,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:56:25,706 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:56:25,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:56:25,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:56:25,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:56:25,710 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:56:25,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:56:25,719 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 16:56:25,726 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-27 16:56:25,726 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-27 16:56:25,727 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:56:25,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:56:25,731 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-27 16:56:25,734 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 16:56:25,734 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-27 16:56:25,734 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 16:56:25,735 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-27 16:56:25,760 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-27 16:56:25,765 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-27 16:56:25,766 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-27 16:56:25,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:56:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:56:25,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 16:56:25,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:56:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:56:26,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 16:56:26,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:56:26,185 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-27 16:56:26,234 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-27 16:56:26,238 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-27 16:56:26,239 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-27 16:56:26,287 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-27 16:56:26,288 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-27 16:56:26,288 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-27 16:56:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2021-08-27 16:56:26,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 22 letters. Loop has 21 letters. [2021-08-27 16:56:26,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:56:26,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 43 letters. Loop has 21 letters. [2021-08-27 16:56:26,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:56:26,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 22 letters. Loop has 42 letters. [2021-08-27 16:56:26,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:56:26,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 204 transitions. [2021-08-27 16:56:26,302 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 16:56:26,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 0 states and 0 transitions. [2021-08-27 16:56:26,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-27 16:56:26,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-27 16:56:26,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-27 16:56:26,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:56:26,303 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 16:56:26,303 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 16:56:26,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:56:26,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 16:56:26,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-27 16:56:26,304 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-27 16:56:26,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:56:26,304 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-08-27 16:56:26,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-27 16:56:26,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2021-08-27 16:56:26,305 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 16:56:26,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2021-08-27 16:56:26,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-27 16:56:26,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-27 16:56:26,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-27 16:56:26,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:56:26,305 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 16:56:26,305 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 16:56:26,305 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 16:56:26,306 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 16:56:26,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-08-27 16:56:26,306 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 16:56:26,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-08-27 16:56:26,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 04:56:26 BoogieIcfgContainer [2021-08-27 16:56:26,311 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 16:56:26,311 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 16:56:26,312 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 16:56:26,312 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 16:56:26,312 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:56:20" (3/4) ... [2021-08-27 16:56:26,315 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 16:56:26,315 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 16:56:26,316 INFO L168 Benchmark]: Toolchain (without parser) took 6531.47 ms. Allocated memory was 52.4 MB in the beginning and 157.3 MB in the end (delta: 104.9 MB). Free memory was 29.3 MB in the beginning and 118.2 MB in the end (delta: -88.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 16.1 GB. [2021-08-27 16:56:26,317 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 52.4 MB. Free memory is still 34.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 16:56:26,317 INFO L168 Benchmark]: CACSL2BoogieTranslator took 361.66 ms. Allocated memory was 52.4 MB in the beginning and 73.4 MB in the end (delta: 21.0 MB). Free memory was 29.2 MB in the beginning and 55.9 MB in the end (delta: -26.7 MB). Peak memory consumption was 5.0 MB. Max. memory is 16.1 GB. [2021-08-27 16:56:26,318 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.83 ms. Allocated memory is still 73.4 MB. Free memory was 55.9 MB in the beginning and 53.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 16:56:26,318 INFO L168 Benchmark]: Boogie Preprocessor took 36.65 ms. Allocated memory is still 73.4 MB. Free memory was 53.8 MB in the beginning and 52.2 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 16:56:26,318 INFO L168 Benchmark]: RCFGBuilder took 528.76 ms. Allocated memory is still 73.4 MB. Free memory was 52.2 MB in the beginning and 43.0 MB in the end (delta: 9.2 MB). Peak memory consumption was 20.9 MB. Max. memory is 16.1 GB. [2021-08-27 16:56:26,319 INFO L168 Benchmark]: BuchiAutomizer took 5539.58 ms. Allocated memory was 73.4 MB in the beginning and 157.3 MB in the end (delta: 83.9 MB). Free memory was 43.0 MB in the beginning and 118.2 MB in the end (delta: -75.2 MB). Peak memory consumption was 8.6 MB. Max. memory is 16.1 GB. [2021-08-27 16:56:26,319 INFO L168 Benchmark]: Witness Printer took 3.27 ms. Allocated memory is still 157.3 MB. Free memory is still 118.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 16:56:26,321 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.19 ms. Allocated memory is still 52.4 MB. Free memory is still 34.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 361.66 ms. Allocated memory was 52.4 MB in the beginning and 73.4 MB in the end (delta: 21.0 MB). Free memory was 29.2 MB in the beginning and 55.9 MB in the end (delta: -26.7 MB). Peak memory consumption was 5.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 55.83 ms. Allocated memory is still 73.4 MB. Free memory was 55.9 MB in the beginning and 53.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 36.65 ms. Allocated memory is still 73.4 MB. Free memory was 53.8 MB in the beginning and 52.2 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 528.76 ms. Allocated memory is still 73.4 MB. Free memory was 52.2 MB in the beginning and 43.0 MB in the end (delta: 9.2 MB). Peak memory consumption was 20.9 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 5539.58 ms. Allocated memory was 73.4 MB in the beginning and 157.3 MB in the end (delta: 83.9 MB). Free memory was 43.0 MB in the beginning and 118.2 MB in the end (delta: -75.2 MB). Peak memory consumption was 8.6 MB. Max. memory is 16.1 GB. * Witness Printer took 3.27 ms. Allocated memory is still 157.3 MB. Free memory is still 118.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * 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. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.5s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 4.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 21.3ms AutomataMinimizationTime, 3 MinimizatonAttempts, 34 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 84 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 347 SDtfs, 169 SDslu, 585 SDs, 0 SdLazy, 46 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 63.9ms Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital123 mio100 ax129 hnf107 lsp51 ukn72 mio100 lsp100 div148 bol100 ite100 ukn100 eq177 hnf73 smp100 dnf937 smp48 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 40ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-08-27 16:56:26,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...