./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.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-var-start-time.3.2.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 6e60a670bf9177c8f4a58c3a9ceae7cb61aebc56 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:53:28,273 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 16:53:28,275 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 16:53:28,313 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 16:53:28,314 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 16:53:28,317 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 16:53:28,318 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 16:53:28,324 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 16:53:28,326 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 16:53:28,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 16:53:28,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 16:53:28,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 16:53:28,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 16:53:28,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 16:53:28,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 16:53:28,343 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 16:53:28,343 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 16:53:28,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 16:53:28,346 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 16:53:28,351 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 16:53:28,353 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 16:53:28,353 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 16:53:28,354 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 16:53:28,355 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 16:53:28,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 16:53:28,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 16:53:28,358 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 16:53:28,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 16:53:28,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 16:53:28,359 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 16:53:28,359 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 16:53:28,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 16:53:28,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 16:53:28,361 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 16:53:28,362 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 16:53:28,362 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 16:53:28,363 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 16:53:28,363 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 16:53:28,363 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 16:53:28,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 16:53:28,364 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 16:53:28,365 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:53:28,389 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 16:53:28,389 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 16:53:28,389 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 16:53:28,390 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 16:53:28,391 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 16:53:28,391 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 16:53:28,391 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 16:53:28,391 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 16:53:28,391 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 16:53:28,391 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 16:53:28,391 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 16:53:28,392 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 16:53:28,392 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 16:53:28,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 16:53:28,392 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 16:53:28,392 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 16:53:28,392 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 16:53:28,392 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 16:53:28,393 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 16:53:28,393 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 16:53:28,393 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 16:53:28,393 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 16:53:28,393 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 16:53:28,393 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 16:53:28,393 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 16:53:28,394 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 16:53:28,394 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 16:53:28,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 16:53:28,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 16:53:28,394 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 16:53:28,394 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 16:53:28,395 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 16:53:28,395 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 16:53:28,395 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 -> 6e60a670bf9177c8f4a58c3a9ceae7cb61aebc56 [2021-08-27 16:53:28,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 16:53:28,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 16:53:28,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 16:53:28,744 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 16:53:28,745 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 16:53:28,746 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2021-08-27 16:53:28,817 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26755942e/68815c15a9224061be06032520be628e/FLAGeb1c525b5 [2021-08-27 16:53:29,319 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 16:53:29,319 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2021-08-27 16:53:29,340 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26755942e/68815c15a9224061be06032520be628e/FLAGeb1c525b5 [2021-08-27 16:53:29,840 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26755942e/68815c15a9224061be06032520be628e [2021-08-27 16:53:29,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 16:53:29,843 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 16:53:29,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 16:53:29,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 16:53:29,859 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 16:53:29,860 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:53:29" (1/1) ... [2021-08-27 16:53:29,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60ca311b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:53:29, skipping insertion in model container [2021-08-27 16:53:29,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:53:29" (1/1) ... [2021-08-27 16:53:29,866 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 16:53:29,897 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 16:53:30,087 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-var-start-time.3.2.ufo.BOUNDED-6.pals.c[6762,6775] [2021-08-27 16:53:30,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 16:53:30,112 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 16:53:30,169 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-var-start-time.3.2.ufo.BOUNDED-6.pals.c[6762,6775] [2021-08-27 16:53:30,175 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 16:53:30,190 INFO L208 MainTranslator]: Completed translation [2021-08-27 16:53:30,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:53:30 WrapperNode [2021-08-27 16:53:30,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 16:53:30,192 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 16:53:30,192 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 16:53:30,192 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 16:53:30,197 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:53:30" (1/1) ... [2021-08-27 16:53:30,216 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:53:30" (1/1) ... [2021-08-27 16:53:30,247 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 16:53:30,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 16:53:30,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 16:53:30,248 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 16:53:30,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:53:30" (1/1) ... [2021-08-27 16:53:30,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:53:30" (1/1) ... [2021-08-27 16:53:30,268 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:53:30" (1/1) ... [2021-08-27 16:53:30,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:53:30" (1/1) ... [2021-08-27 16:53:30,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:53:30" (1/1) ... [2021-08-27 16:53:30,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:53:30" (1/1) ... [2021-08-27 16:53:30,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:53:30" (1/1) ... [2021-08-27 16:53:30,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 16:53:30,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 16:53:30,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 16:53:30,306 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 16:53:30,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:53:30" (1/1) ... [2021-08-27 16:53:30,314 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:53:30,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:53:30,334 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:53:30,361 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:53:30,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 16:53:30,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 16:53:30,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 16:53:30,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 16:53:30,854 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 16:53:30,854 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2021-08-27 16:53:30,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:53:30 BoogieIcfgContainer [2021-08-27 16:53:30,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 16:53:30,857 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 16:53:30,857 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 16:53:30,859 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 16:53:30,860 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:53:30,860 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 04:53:29" (1/3) ... [2021-08-27 16:53:30,861 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7601ec27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 04:53:30, skipping insertion in model container [2021-08-27 16:53:30,861 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:53:30,861 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:53:30" (2/3) ... [2021-08-27 16:53:30,862 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7601ec27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 04:53:30, skipping insertion in model container [2021-08-27 16:53:30,862 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 16:53:30,862 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:53:30" (3/3) ... [2021-08-27 16:53:30,863 INFO L389 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2021-08-27 16:53:30,900 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 16:53:30,900 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 16:53:30,900 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 16:53:30,900 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 16:53:30,900 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 16:53:30,901 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 16:53:30,901 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 16:53:30,901 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 16:53:30,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 75 states, 74 states have (on average 1.662162162162162) internal successors, (123), 74 states have internal predecessors, (123), 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:53:30,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2021-08-27 16:53:30,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:53:30,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:53:30,938 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:53:30,938 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:53:30,938 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 16:53:30,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 75 states, 74 states have (on average 1.662162162162162) internal successors, (123), 74 states have internal predecessors, (123), 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:53:30,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2021-08-27 16:53:30,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:53:30,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:53:30,945 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:53:30,945 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:53:30,951 INFO L791 eck$LassoCheckResult]: Stem: 55#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(49);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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~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~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~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 12#L157true assume !(0 == ~r1~0);init_~tmp~0 := 0; 23#L157-1true init_#res := init_~tmp~0; 18#L226true main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 67#L273true assume 0 == main_~i2~0;assume false; 41#L273-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; 17#L281-2true [2021-08-27 16:53:30,952 INFO L793 eck$LassoCheckResult]: Loop: 17#L281-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 72#L57true 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; 6#L61true assume !(node1_~m1~0 != ~nomsg~0); 44#L61-1true ~mode1~0 := 0; 61#L57-2true havoc node2_#t~ite8, node2_#t~ite9, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 8#L89true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 45#L92true assume !(node2_~m2~0 != ~nomsg~0); 37#L92-1true ~mode2~0 := 0; 24#L89-2true havoc node3_#t~ite10, node3_#t~ite11, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 27#L123true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 5#L126true assume !(node3_~m3~0 != ~nomsg~0); 54#L126-1true ~mode3~0 := 0; 46#L123-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; 9#L234true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 60#L234-1true check_#res := check_~tmp~1; 71#L246true main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 70#L305true assume !(0 == assert_~arg % 256); 75#L300true main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 17#L281-2true [2021-08-27 16:53:30,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:53:30,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1898425706, now seen corresponding path program 1 times [2021-08-27 16:53:30,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:53:30,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226350658] [2021-08-27 16:53:30,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:53:30,966 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:53:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:53:31,134 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:53:31,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:53:31,135 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226350658] [2021-08-27 16:53:31,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226350658] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:53:31,136 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:53:31,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 16:53:31,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944640173] [2021-08-27 16:53:31,145 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:53:31,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:53:31,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1181507580, now seen corresponding path program 1 times [2021-08-27 16:53:31,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:53:31,149 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442979078] [2021-08-27 16:53:31,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:53:31,149 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:53:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:53:31,278 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:53:31,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:53:31,279 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442979078] [2021-08-27 16:53:31,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442979078] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:53:31,279 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:53:31,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:53:31,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923451620] [2021-08-27 16:53:31,281 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:53:31,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:53:31,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-27 16:53:31,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-27 16:53:31,295 INFO L87 Difference]: Start difference. First operand has 75 states, 74 states have (on average 1.662162162162162) internal successors, (123), 74 states have internal predecessors, (123), 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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:53:31,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:53:31,304 INFO L93 Difference]: Finished difference Result 75 states and 120 transitions. [2021-08-27 16:53:31,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-27 16:53:31,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 120 transitions. [2021-08-27 16:53:31,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-08-27 16:53:31,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 70 states and 115 transitions. [2021-08-27 16:53:31,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2021-08-27 16:53:31,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2021-08-27 16:53:31,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 115 transitions. [2021-08-27 16:53:31,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:53:31,313 INFO L681 BuchiCegarLoop]: Abstraction has 70 states and 115 transitions. [2021-08-27 16:53:31,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 115 transitions. [2021-08-27 16:53:31,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-08-27 16:53:31,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.6428571428571428) internal successors, (115), 69 states have internal predecessors, (115), 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:53:31,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 115 transitions. [2021-08-27 16:53:31,338 INFO L704 BuchiCegarLoop]: Abstraction has 70 states and 115 transitions. [2021-08-27 16:53:31,338 INFO L587 BuchiCegarLoop]: Abstraction has 70 states and 115 transitions. [2021-08-27 16:53:31,338 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 16:53:31,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 115 transitions. [2021-08-27 16:53:31,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-08-27 16:53:31,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:53:31,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:53:31,341 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 16:53:31,341 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:53:31,341 INFO L791 eck$LassoCheckResult]: Stem: 221#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(49);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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~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]; 208#L-1 havoc main_#res;havoc 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~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 182#L157 assume !(0 == ~r1~0);init_~tmp~0 := 0; 181#L157-1 init_#res := init_~tmp~0; 191#L226 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 192#L273 assume !(0 == main_~i2~0); 213#L273-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; 189#L281-2 [2021-08-27 16:53:31,341 INFO L793 eck$LassoCheckResult]: Loop: 189#L281-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 190#L57 assume !(0 != ~mode1~0 % 256); 227#L75 assume !(0 != ~alive1~0 % 256); 219#L75-2 ~mode1~0 := 1; 216#L57-2 havoc node2_#t~ite8, node2_#t~ite9, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 171#L89 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 173#L92 assume !(node2_~m2~0 != ~nomsg~0); 185#L92-1 ~mode2~0 := 0; 198#L89-2 havoc node3_#t~ite10, node3_#t~ite11, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 199#L123 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 163#L126 assume !(node3_~m3~0 != ~nomsg~0); 165#L126-1 ~mode3~0 := 0; 193#L123-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; 176#L234 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 178#L234-1 check_#res := check_~tmp~1; 224#L246 main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 229#L305 assume !(0 == assert_~arg % 256); 230#L300 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 189#L281-2 [2021-08-27 16:53:31,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:53:31,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1898425768, now seen corresponding path program 1 times [2021-08-27 16:53:31,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:53:31,342 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679342046] [2021-08-27 16:53:31,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:53:31,343 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:53:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:53:31,388 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:53:31,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:53:31,389 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679342046] [2021-08-27 16:53:31,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679342046] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:53:31,389 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:53:31,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:53:31,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106597553] [2021-08-27 16:53:31,389 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 16:53:31,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:53:31,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1582780898, now seen corresponding path program 1 times [2021-08-27 16:53:31,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:53:31,390 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244927894] [2021-08-27 16:53:31,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:53:31,391 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:53:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:53:31,475 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:53:31,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:53:31,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244927894] [2021-08-27 16:53:31,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244927894] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:53:31,476 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:53:31,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:53:31,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52104037] [2021-08-27 16:53:31,477 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:53:31,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:53:31,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 16:53:31,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 16:53:31,478 INFO L87 Difference]: Start difference. First operand 70 states and 115 transitions. cyclomatic complexity: 46 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:53:31,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:53:31,544 INFO L93 Difference]: Finished difference Result 120 states and 192 transitions. [2021-08-27 16:53:31,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 16:53:31,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 192 transitions. [2021-08-27 16:53:31,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-08-27 16:53:31,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 117 states and 173 transitions. [2021-08-27 16:53:31,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2021-08-27 16:53:31,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2021-08-27 16:53:31,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 173 transitions. [2021-08-27 16:53:31,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:53:31,553 INFO L681 BuchiCegarLoop]: Abstraction has 117 states and 173 transitions. [2021-08-27 16:53:31,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 173 transitions. [2021-08-27 16:53:31,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 70. [2021-08-27 16:53:31,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.4) internal successors, (98), 69 states have internal predecessors, (98), 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:53:31,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2021-08-27 16:53:31,558 INFO L704 BuchiCegarLoop]: Abstraction has 70 states and 98 transitions. [2021-08-27 16:53:31,558 INFO L587 BuchiCegarLoop]: Abstraction has 70 states and 98 transitions. [2021-08-27 16:53:31,558 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 16:53:31,558 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 98 transitions. [2021-08-27 16:53:31,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-08-27 16:53:31,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:53:31,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:53:31,560 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, 1] [2021-08-27 16:53:31,560 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:53:31,560 INFO L791 eck$LassoCheckResult]: Stem: 426#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(49);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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~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]; 413#L-1 havoc main_#res;havoc 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~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 386#L157 assume 0 == ~r1~0; 387#L158 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 391#L159 assume ~id1~0 >= 0; 392#L160 assume 0 == ~st1~0; 400#L161 assume ~send1~0 == ~id1~0; 401#L162 assume 0 == ~mode1~0 % 256; 410#L163 assume ~id2~0 >= 0; 405#L164 assume 0 == ~st2~0; 398#L165 assume ~send2~0 == ~id2~0; 399#L166 assume 0 == ~mode2~0 % 256; 406#L167 assume ~id3~0 >= 0; 384#L168 assume 0 == ~st3~0; 385#L169 assume ~send3~0 == ~id3~0; 431#L170 assume 0 == ~mode3~0 % 256; 417#L171 assume ~id1~0 != ~id2~0; 414#L172 assume ~id1~0 != ~id3~0; 415#L173 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 402#L157-1 init_#res := init_~tmp~0; 395#L226 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 396#L273 assume !(0 == main_~i2~0); 418#L273-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; 393#L281-2 [2021-08-27 16:53:31,560 INFO L793 eck$LassoCheckResult]: Loop: 393#L281-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 394#L57 assume !(0 != ~mode1~0 % 256); 432#L75 assume !(0 != ~alive1~0 % 256); 424#L75-2 ~mode1~0 := 1; 420#L57-2 havoc node2_#t~ite8, node2_#t~ite9, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 376#L89 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 378#L92 assume !(node2_~m2~0 != ~nomsg~0); 389#L92-1 ~mode2~0 := 0; 403#L89-2 havoc node3_#t~ite10, node3_#t~ite11, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 404#L123 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 368#L126 assume !(node3_~m3~0 != ~nomsg~0); 370#L126-1 ~mode3~0 := 0; 397#L123-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; 381#L234 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 383#L234-1 check_#res := check_~tmp~1; 429#L246 main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 434#L305 assume !(0 == assert_~arg % 256); 435#L300 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 393#L281-2 [2021-08-27 16:53:31,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:53:31,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1524872798, now seen corresponding path program 1 times [2021-08-27 16:53:31,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:53:31,561 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958455356] [2021-08-27 16:53:31,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:53:31,562 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:53:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:53:31,610 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:53:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:53:31,674 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:53:31,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:53:31,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1582780898, now seen corresponding path program 2 times [2021-08-27 16:53:31,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:53:31,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696783978] [2021-08-27 16:53:31,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:53:31,676 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:53:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:53:31,758 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:53:31,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:53:31,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696783978] [2021-08-27 16:53:31,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696783978] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:53:31,760 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:53:31,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 16:53:31,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169979848] [2021-08-27 16:53:31,761 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 16:53:31,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:53:31,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 16:53:31,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 16:53:31,765 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. cyclomatic complexity: 29 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:53:31,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:53:31,800 INFO L93 Difference]: Finished difference Result 73 states and 100 transitions. [2021-08-27 16:53:31,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 16:53:31,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 100 transitions. [2021-08-27 16:53:31,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-08-27 16:53:31,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 70 states and 96 transitions. [2021-08-27 16:53:31,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2021-08-27 16:53:31,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2021-08-27 16:53:31,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 96 transitions. [2021-08-27 16:53:31,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:53:31,804 INFO L681 BuchiCegarLoop]: Abstraction has 70 states and 96 transitions. [2021-08-27 16:53:31,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 96 transitions. [2021-08-27 16:53:31,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-08-27 16:53:31,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 69 states have internal predecessors, (96), 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:53:31,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2021-08-27 16:53:31,808 INFO L704 BuchiCegarLoop]: Abstraction has 70 states and 96 transitions. [2021-08-27 16:53:31,808 INFO L587 BuchiCegarLoop]: Abstraction has 70 states and 96 transitions. [2021-08-27 16:53:31,808 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 16:53:31,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 96 transitions. [2021-08-27 16:53:31,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-08-27 16:53:31,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 16:53:31,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 16:53:31,810 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, 1] [2021-08-27 16:53:31,810 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] [2021-08-27 16:53:31,810 INFO L791 eck$LassoCheckResult]: Stem: 581#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(49);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;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~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]; 568#L-1 havoc main_#res;havoc 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~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 540#L157 assume 0 == ~r1~0; 541#L158 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 544#L159 assume ~id1~0 >= 0; 545#L160 assume 0 == ~st1~0; 554#L161 assume ~send1~0 == ~id1~0; 555#L162 assume 0 == ~mode1~0 % 256; 565#L163 assume ~id2~0 >= 0; 559#L164 assume 0 == ~st2~0; 552#L165 assume ~send2~0 == ~id2~0; 553#L166 assume 0 == ~mode2~0 % 256; 560#L167 assume ~id3~0 >= 0; 538#L168 assume 0 == ~st3~0; 539#L169 assume ~send3~0 == ~id3~0; 586#L170 assume 0 == ~mode3~0 % 256; 572#L171 assume ~id1~0 != ~id2~0; 569#L172 assume ~id1~0 != ~id3~0; 570#L173 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 556#L157-1 init_#res := init_~tmp~0; 549#L226 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 550#L273 assume !(0 == main_~i2~0); 573#L273-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; 547#L281-2 [2021-08-27 16:53:31,810 INFO L793 eck$LassoCheckResult]: Loop: 547#L281-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 548#L57 assume !(0 != ~mode1~0 % 256); 587#L75 assume !(0 != ~alive1~0 % 256); 579#L75-2 ~mode1~0 := 1; 575#L57-2 havoc node2_#t~ite8, node2_#t~ite9, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 531#L89 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 533#L92 assume !(node2_~m2~0 != ~nomsg~0); 543#L92-1 ~mode2~0 := 0; 557#L89-2 havoc node3_#t~ite10, node3_#t~ite11, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 558#L123 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 523#L126 assume !(node3_~m3~0 != ~nomsg~0); 525#L126-1 ~mode3~0 := 0; 551#L123-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; 536#L234 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 537#L235 assume ~r1~0 < 3;check_~tmp~1 := 1; 563#L234-1 check_#res := check_~tmp~1; 584#L246 main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 589#L305 assume !(0 == assert_~arg % 256); 590#L300 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 547#L281-2 [2021-08-27 16:53:31,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:53:31,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1524872798, now seen corresponding path program 2 times [2021-08-27 16:53:31,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:53:31,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038829684] [2021-08-27 16:53:31,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:53:31,812 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:53:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:53:31,826 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:53:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:53:31,846 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:53:31,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:53:31,847 INFO L82 PathProgramCache]: Analyzing trace with hash 2090072442, now seen corresponding path program 1 times [2021-08-27 16:53:31,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:53:31,847 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310906923] [2021-08-27 16:53:31,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:53:31,848 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:53:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:53:31,862 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 16:53:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 16:53:31,875 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 16:53:31,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:53:31,880 INFO L82 PathProgramCache]: Analyzing trace with hash 755196925, now seen corresponding path program 1 times [2021-08-27 16:53:31,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 16:53:31,880 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670591678] [2021-08-27 16:53:31,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 16:53:31,882 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 16:53:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:53:31,927 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:53:31,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 16:53:31,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670591678] [2021-08-27 16:53:31,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670591678] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 16:53:31,928 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 16:53:31,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 16:53:31,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654269383] [2021-08-27 16:53:32,445 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:53:32,446 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:53:32,446 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:53:32,451 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:53:32,451 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 16:53:32,451 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:53:32,451 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:53:32,451 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:53:32,451 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2021-08-27 16:53:32,451 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:53:32,452 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:53:32,471 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:53:32,480 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:53:32,484 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:53:32,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:53:32,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:53:32,497 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:53:32,502 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:53:32,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:53:32,507 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:53:32,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:53:32,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 16:53:32,531 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:53:32,533 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:53:32,536 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:53:32,541 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:53:32,543 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:53:32,549 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:53:32,552 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:53:32,575 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:53:32,578 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:53:32,582 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:53:32,584 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:53:32,587 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:53:33,008 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:53:33,009 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 16:53:33,011 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:53:33,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:53:33,017 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:53:33,028 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 16:53:33,028 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:53:33,029 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:53:33,073 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:53:33,074 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:53:33,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:53:33,075 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:53:33,076 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:53:33,078 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 16:53:33,078 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 16:53:33,125 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 16:53:33,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-08-27 16:53:33,129 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 16:53:33,129 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 16:53:33,129 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 16:53:33,129 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 16:53:33,129 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 16:53:33,130 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:53:33,130 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 16:53:33,130 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 16:53:33,130 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2021-08-27 16:53:33,130 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 16:53:33,130 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 16:53:33,133 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:53:33,139 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:53:33,142 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:53:33,148 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:53:33,152 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:53:33,162 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:53:33,165 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:53:33,168 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:53:33,176 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:53:33,179 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:53:33,182 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:53:33,205 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:53:33,208 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:53:33,211 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:53:33,215 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:53:33,220 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:53:33,224 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:53:33,226 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:53:33,229 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:53:33,231 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:53:33,234 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:53:33,237 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:53:33,239 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:53:33,617 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 16:53:33,621 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 16:53:33,622 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:53:33,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:53:33,624 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:53:33,629 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:53:33,630 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:53:33,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 16:53:33,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 16:53:33,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 16:53:33,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 16:53:33,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 16:53:33,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 16:53:33,639 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 16:53:33,649 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 16:53:33,678 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-27 16:53:33,678 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-27 16:53:33,679 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 16:53:33,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 16:53:33,685 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:53:33,687 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 16:53:33,687 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-27 16:53:33,688 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 16:53:33,688 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:53:33,704 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:53:33,713 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:53:33,714 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-27 16:53:33,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 16:53:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:53:33,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 16:53:33,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:53:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 16:53:33,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 16:53:33,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 16:53:34,043 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:53:34,114 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:53:34,117 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:53:34,119 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 96 transitions. cyclomatic complexity: 27 Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:53:34,170 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 96 transitions. cyclomatic complexity: 27. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 117 states and 170 transitions. Complement of second has 4 states. [2021-08-27 16:53:34,171 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:53:34,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:53:34,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2021-08-27 16:53:34,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 96 transitions. Stem has 23 letters. Loop has 19 letters. [2021-08-27 16:53:34,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:53:34,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 96 transitions. Stem has 42 letters. Loop has 19 letters. [2021-08-27 16:53:34,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:53:34,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 96 transitions. Stem has 23 letters. Loop has 38 letters. [2021-08-27 16:53:34,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 16:53:34,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 170 transitions. [2021-08-27 16:53:34,181 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 16:53:34,181 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 0 states and 0 transitions. [2021-08-27 16:53:34,181 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-27 16:53:34,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-27 16:53:34,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-27 16:53:34,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:53:34,181 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 16:53:34,181 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 16:53:34,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 16:53:34,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 16:53:34,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 16:53:34,182 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 16:53:34,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 16:53:34,182 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-08-27 16:53:34,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-27 16:53:34,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2021-08-27 16:53:34,183 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 16:53:34,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2021-08-27 16:53:34,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-27 16:53:34,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-27 16:53:34,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-27 16:53:34,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 16:53:34,183 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 16:53:34,183 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 16:53:34,183 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 16:53:34,183 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 16:53:34,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-08-27 16:53:34,183 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 16:53:34,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-08-27 16:53:34,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 04:53:34 BoogieIcfgContainer [2021-08-27 16:53:34,188 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 16:53:34,189 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 16:53:34,189 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 16:53:34,189 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 16:53:34,190 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:53:30" (3/4) ... [2021-08-27 16:53:34,192 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 16:53:34,192 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 16:53:34,194 INFO L168 Benchmark]: Toolchain (without parser) took 4349.42 ms. Allocated memory was 62.9 MB in the beginning and 111.1 MB in the end (delta: 48.2 MB). Free memory was 42.3 MB in the beginning and 66.9 MB in the end (delta: -24.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 16.1 GB. [2021-08-27 16:53:34,195 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 62.9 MB. Free memory was 43.8 MB in the beginning and 43.8 MB in the end (delta: 39.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 16:53:34,196 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.03 ms. Allocated memory is still 62.9 MB. Free memory was 42.1 MB in the beginning and 43.2 MB in the end (delta: -1.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 16:53:34,198 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.34 ms. Allocated memory is still 62.9 MB. Free memory was 43.0 MB in the beginning and 40.9 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:53:34,198 INFO L168 Benchmark]: Boogie Preprocessor took 56.83 ms. Allocated memory is still 62.9 MB. Free memory was 40.9 MB in the beginning and 39.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 16:53:34,201 INFO L168 Benchmark]: RCFGBuilder took 550.52 ms. Allocated memory was 62.9 MB in the beginning and 75.5 MB in the end (delta: 12.6 MB). Free memory was 39.2 MB in the beginning and 55.1 MB in the end (delta: -15.9 MB). Peak memory consumption was 19.4 MB. Max. memory is 16.1 GB. [2021-08-27 16:53:34,201 INFO L168 Benchmark]: BuchiAutomizer took 3331.61 ms. Allocated memory was 75.5 MB in the beginning and 111.1 MB in the end (delta: 35.7 MB). Free memory was 55.1 MB in the beginning and 66.9 MB in the end (delta: -11.8 MB). Peak memory consumption was 22.9 MB. Max. memory is 16.1 GB. [2021-08-27 16:53:34,201 INFO L168 Benchmark]: Witness Printer took 2.91 ms. Allocated memory is still 111.1 MB. Free memory is still 66.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 16:53:34,205 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.20 ms. Allocated memory is still 62.9 MB. Free memory was 43.8 MB in the beginning and 43.8 MB in the end (delta: 39.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 347.03 ms. Allocated memory is still 62.9 MB. Free memory was 42.1 MB in the beginning and 43.2 MB in the end (delta: -1.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 55.34 ms. Allocated memory is still 62.9 MB. Free memory was 43.0 MB in the beginning and 40.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 56.83 ms. Allocated memory is still 62.9 MB. Free memory was 40.9 MB in the beginning and 39.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 550.52 ms. Allocated memory was 62.9 MB in the beginning and 75.5 MB in the end (delta: 12.6 MB). Free memory was 39.2 MB in the beginning and 55.1 MB in the end (delta: -15.9 MB). Peak memory consumption was 19.4 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 3331.61 ms. Allocated memory was 75.5 MB in the beginning and 111.1 MB in the end (delta: 35.7 MB). Free memory was 55.1 MB in the beginning and 66.9 MB in the end (delta: -11.8 MB). Peak memory consumption was 22.9 MB. Max. memory is 16.1 GB. * Witness Printer took 2.91 ms. Allocated memory is still 111.1 MB. Free memory is still 66.9 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 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 21.7ms AutomataMinimizationTime, 3 MinimizatonAttempts, 47 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 70 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 421 SDtfs, 173 SDslu, 664 SDs, 0 SdLazy, 35 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 38.4ms Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital98 mio100 ax136 hnf108 lsp23 ukn100 mio100 lsp100 div137 bol100 ite100 ukn100 eq164 hnf86 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 66ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-08-27 16:53:34,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...