./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.7.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 791161d1 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.7.ufo.UNBOUNDED.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 760447de6aa5739f187553f004f72c898b25c540c6dba08996c9520ae7051de1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 15:49:47,283 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 15:49:47,285 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 15:49:47,329 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 15:49:47,329 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 15:49:47,330 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 15:49:47,331 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 15:49:47,332 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 15:49:47,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 15:49:47,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 15:49:47,335 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 15:49:47,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 15:49:47,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 15:49:47,337 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 15:49:47,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 15:49:47,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 15:49:47,339 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 15:49:47,340 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 15:49:47,341 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 15:49:47,343 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 15:49:47,344 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 15:49:47,345 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 15:49:47,346 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 15:49:47,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 15:49:47,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 15:49:47,351 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 15:49:47,354 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 15:49:47,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 15:49:47,355 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 15:49:47,356 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 15:49:47,357 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 15:49:47,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 15:49:47,359 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 15:49:47,359 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 15:49:47,360 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 15:49:47,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 15:49:47,362 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 15:49:47,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 15:49:47,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 15:49:47,363 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 15:49:47,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 15:49:47,366 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 15:49:47,367 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-23 15:49:47,394 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 15:49:47,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 15:49:47,395 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 15:49:47,395 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 15:49:47,397 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 15:49:47,397 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 15:49:47,397 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 15:49:47,397 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-23 15:49:47,398 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-23 15:49:47,398 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-23 15:49:47,398 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-23 15:49:47,399 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-23 15:49:47,399 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-23 15:49:47,399 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 15:49:47,399 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 15:49:47,399 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 15:49:47,400 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 15:49:47,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 15:49:47,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 15:49:47,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-23 15:49:47,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-23 15:49:47,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-23 15:49:47,402 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 15:49:47,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 15:49:47,402 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-23 15:49:47,402 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 15:49:47,402 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-23 15:49:47,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 15:49:47,403 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 15:49:47,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 15:49:47,403 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 15:49:47,404 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-23 15:49:47,404 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 -> 760447de6aa5739f187553f004f72c898b25c540c6dba08996c9520ae7051de1 [2022-07-23 15:49:47,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 15:49:47,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 15:49:47,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 15:49:47,669 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 15:49:47,670 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 15:49:47,671 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.7.ufo.UNBOUNDED.pals.c [2022-07-23 15:49:47,745 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45383bdec/4b55666e39494cb5a4aca25be4218db7/FLAG24121ac30 [2022-07-23 15:49:48,171 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 15:49:48,172 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.ufo.UNBOUNDED.pals.c [2022-07-23 15:49:48,181 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45383bdec/4b55666e39494cb5a4aca25be4218db7/FLAG24121ac30 [2022-07-23 15:49:48,193 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45383bdec/4b55666e39494cb5a4aca25be4218db7 [2022-07-23 15:49:48,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 15:49:48,200 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 15:49:48,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 15:49:48,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 15:49:48,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 15:49:48,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 03:49:48" (1/1) ... [2022-07-23 15:49:48,206 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4668aab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:49:48, skipping insertion in model container [2022-07-23 15:49:48,206 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 03:49:48" (1/1) ... [2022-07-23 15:49:48,212 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 15:49:48,258 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 15:49:48,446 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.ufo.UNBOUNDED.pals.c[20047,20060] [2022-07-23 15:49:48,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 15:49:48,455 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 15:49:48,513 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.ufo.UNBOUNDED.pals.c[20047,20060] [2022-07-23 15:49:48,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 15:49:48,527 INFO L208 MainTranslator]: Completed translation [2022-07-23 15:49:48,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:49:48 WrapperNode [2022-07-23 15:49:48,528 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 15:49:48,528 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 15:49:48,528 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 15:49:48,529 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 15:49:48,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:49:48" (1/1) ... [2022-07-23 15:49:48,549 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:49:48" (1/1) ... [2022-07-23 15:49:48,581 INFO L137 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 428 [2022-07-23 15:49:48,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 15:49:48,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 15:49:48,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 15:49:48,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 15:49:48,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:49:48" (1/1) ... [2022-07-23 15:49:48,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:49:48" (1/1) ... [2022-07-23 15:49:48,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:49:48" (1/1) ... [2022-07-23 15:49:48,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:49:48" (1/1) ... [2022-07-23 15:49:48,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:49:48" (1/1) ... [2022-07-23 15:49:48,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:49:48" (1/1) ... [2022-07-23 15:49:48,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:49:48" (1/1) ... [2022-07-23 15:49:48,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 15:49:48,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 15:49:48,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 15:49:48,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 15:49:48,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:49:48" (1/1) ... [2022-07-23 15:49:48,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:49:48,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:49:48,661 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 15:49:48,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-23 15:49:48,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 15:49:48,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 15:49:48,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 15:49:48,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 15:49:48,766 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 15:49:48,768 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 15:49:49,195 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 15:49:49,204 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 15:49:49,204 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-23 15:49:49,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:49:49 BoogieIcfgContainer [2022-07-23 15:49:49,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 15:49:49,207 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-23 15:49:49,207 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-23 15:49:49,214 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-23 15:49:49,215 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 15:49:49,215 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.07 03:49:48" (1/3) ... [2022-07-23 15:49:49,216 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d920d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 03:49:49, skipping insertion in model container [2022-07-23 15:49:49,216 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 15:49:49,216 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:49:48" (2/3) ... [2022-07-23 15:49:49,217 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d920d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 03:49:49, skipping insertion in model container [2022-07-23 15:49:49,217 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 15:49:49,217 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:49:49" (3/3) ... [2022-07-23 15:49:49,218 INFO L354 chiAutomizerObserver]: Analyzing ICFG pals_lcr.7.ufo.UNBOUNDED.pals.c [2022-07-23 15:49:49,281 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-23 15:49:49,281 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-23 15:49:49,281 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-23 15:49:49,282 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-23 15:49:49,282 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-23 15:49:49,282 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-23 15:49:49,282 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-23 15:49:49,282 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-23 15:49:49,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 129 states, 128 states have (on average 1.7421875) internal successors, (223), 128 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:49:49,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2022-07-23 15:49:49,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:49:49,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:49:49,327 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:49:49,327 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:49:49,327 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-23 15:49:49,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 129 states, 128 states have (on average 1.7421875) internal successors, (223), 128 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:49:49,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2022-07-23 15:49:49,337 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:49:49,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:49:49,339 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:49:49,341 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:49:49,348 INFO L752 eck$LassoCheckResult]: Stem: 114#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0; 37#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 120#L263true assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 127#L263-1true init_#res#1 := init_~tmp~0#1; 104#L464true main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 40#L22true assume !(0 == assume_abort_if_not_~cond#1); 97#L21true assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 11#L548-2true [2022-07-23 15:49:49,354 INFO L754 eck$LassoCheckResult]: Loop: 11#L548-2true assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 34#L85true assume !(0 != ~mode1~0 % 256); 44#L102true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 43#L102-2true ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 6#L85-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 53#L114true assume !(0 != ~mode2~0 % 256); 116#L127true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 59#L127-2true ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 38#L114-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 26#L139true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 101#L142true assume !(node3_~m3~0#1 != ~nomsg~0); 71#L142-1true ~mode3~0 := 0; 16#L139-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 81#L164true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 17#L167true assume !(node4_~m4~0#1 != ~nomsg~0); 110#L167-1true ~mode4~0 := 0; 57#L164-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 85#L189true assume !(0 != ~mode5~0 % 256); 82#L202true assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 103#L202-2true ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 49#L189-2true assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 119#L214true assume !(0 != ~mode6~0 % 256); 96#L227true assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 36#L227-2true ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 13#L214-2true assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 24#L239true assume !(0 != ~mode7~0 % 256); 51#L252true assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 126#L252-2true ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; 47#L239-2true assume { :end_inline_node7 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 32#L472true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; 98#L472-1true check_#res#1 := check_~tmp~1#1; 112#L492true main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 93#L583true assume !(0 == assert_~arg#1 % 256); 46#L578true assume { :end_inline_assert } true; 11#L548-2true [2022-07-23 15:49:49,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:49:49,359 INFO L85 PathProgramCache]: Analyzing trace with hash 2087378158, now seen corresponding path program 1 times [2022-07-23 15:49:49,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:49:49,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062105136] [2022-07-23 15:49:49,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:49:49,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:49:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:49:49,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:49:49,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:49:49,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062105136] [2022-07-23 15:49:49,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062105136] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:49:49,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:49:49,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 15:49:49,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886228751] [2022-07-23 15:49:49,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:49:49,621 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 15:49:49,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:49:49,624 INFO L85 PathProgramCache]: Analyzing trace with hash 400549401, now seen corresponding path program 1 times [2022-07-23 15:49:49,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:49:49,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866039279] [2022-07-23 15:49:49,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:49:49,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:49:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:49:49,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:49:49,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:49:49,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866039279] [2022-07-23 15:49:49,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866039279] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:49:49,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:49:49,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 15:49:49,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620936180] [2022-07-23 15:49:49,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:49:49,817 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 15:49:49,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:49:49,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 15:49:49,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 15:49:49,855 INFO L87 Difference]: Start difference. First operand has 129 states, 128 states have (on average 1.7421875) internal successors, (223), 128 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:49:49,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:49:49,982 INFO L93 Difference]: Finished difference Result 128 states and 218 transitions. [2022-07-23 15:49:49,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 15:49:49,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 218 transitions. [2022-07-23 15:49:50,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-07-23 15:49:50,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 124 states and 165 transitions. [2022-07-23 15:49:50,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2022-07-23 15:49:50,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2022-07-23 15:49:50,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 165 transitions. [2022-07-23 15:49:50,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 15:49:50,015 INFO L369 hiAutomatonCegarLoop]: Abstraction has 124 states and 165 transitions. [2022-07-23 15:49:50,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 165 transitions. [2022-07-23 15:49:50,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-23 15:49:50,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.3306451612903225) internal successors, (165), 123 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:49:50,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 165 transitions. [2022-07-23 15:49:50,049 INFO L392 hiAutomatonCegarLoop]: Abstraction has 124 states and 165 transitions. [2022-07-23 15:49:50,049 INFO L374 stractBuchiCegarLoop]: Abstraction has 124 states and 165 transitions. [2022-07-23 15:49:50,050 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-23 15:49:50,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 165 transitions. [2022-07-23 15:49:50,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-07-23 15:49:50,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:49:50,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:49:50,056 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:49:50,056 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:49:50,058 INFO L752 eck$LassoCheckResult]: Stem: 396#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0; 335#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 336#L263 assume 0 == ~r1~0 % 256; 364#L264 assume ~id1~0 >= 0; 365#L265 assume 0 == ~st1~0; 299#L266 assume ~send1~0 == ~id1~0; 300#L267 assume 0 == ~mode1~0 % 256; 305#L268 assume ~id2~0 >= 0; 306#L269 assume 0 == ~st2~0; 291#L270 assume ~send2~0 == ~id2~0; 292#L271 assume 0 == ~mode2~0 % 256; 324#L272 assume ~id3~0 >= 0; 342#L273 assume 0 == ~st3~0; 362#L274 assume ~send3~0 == ~id3~0; 386#L275 assume 0 == ~mode3~0 % 256; 277#L276 assume ~id4~0 >= 0; 278#L277 assume 0 == ~st4~0; 397#L278 assume ~send4~0 == ~id4~0; 355#L279 assume 0 == ~mode4~0 % 256; 356#L280 assume ~id5~0 >= 0; 301#L281 assume 0 == ~st5~0; 279#L282 assume ~send5~0 == ~id5~0; 280#L283 assume 0 == ~mode5~0 % 256; 366#L284 assume ~id6~0 >= 0; 367#L285 assume 0 == ~st6~0; 381#L286 assume ~send6~0 == ~id6~0; 371#L287 assume 0 == ~mode6~0 % 256; 315#L288 assume ~id7~0 >= 0; 316#L289 assume 0 == ~st7~0; 328#L290 assume ~send7~0 == ~id7~0; 377#L291 assume 0 == ~mode7~0 % 256; 378#L292 assume ~id1~0 != ~id2~0; 387#L293 assume ~id1~0 != ~id3~0; 395#L294 assume ~id1~0 != ~id4~0; 286#L295 assume ~id1~0 != ~id5~0; 287#L296 assume ~id1~0 != ~id6~0; 325#L297 assume ~id1~0 != ~id7~0; 321#L298 assume ~id2~0 != ~id3~0; 322#L299 assume ~id2~0 != ~id4~0; 333#L300 assume ~id2~0 != ~id5~0; 372#L301 assume ~id2~0 != ~id6~0; 379#L302 assume ~id2~0 != ~id7~0; 380#L303 assume ~id3~0 != ~id4~0; 391#L304 assume ~id3~0 != ~id5~0; 368#L305 assume ~id3~0 != ~id6~0; 369#L306 assume ~id3~0 != ~id7~0; 375#L307 assume ~id4~0 != ~id5~0; 295#L308 assume ~id4~0 != ~id6~0; 296#L309 assume ~id4~0 != ~id7~0; 373#L310 assume ~id5~0 != ~id6~0; 349#L311 assume ~id5~0 != ~id7~0; 350#L312 assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; 398#L263-1 init_#res#1 := init_~tmp~0#1; 393#L464 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 340#L22 assume !(0 == assume_abort_if_not_~cond#1); 341#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 293#L548-2 [2022-07-23 15:49:50,058 INFO L754 eck$LassoCheckResult]: Loop: 293#L548-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 294#L85 assume !(0 != ~mode1~0 % 256); 332#L102 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 343#L102-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 281#L85-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 282#L114 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 288#L117 assume !(node2_~m2~0#1 != ~nomsg~0); 289#L117-1 ~mode2~0 := 0; 337#L114-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 318#L139 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 320#L142 assume !(node3_~m3~0#1 != ~nomsg~0); 374#L142-1 ~mode3~0 := 0; 302#L139-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 303#L164 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 304#L167 assume !(node4_~m4~0#1 != ~nomsg~0); 284#L167-1 ~mode4~0 := 0; 360#L164-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 361#L189 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 385#L192 assume !(node5_~m5~0#1 != ~nomsg~0); 358#L192-1 ~mode5~0 := 0; 347#L189-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 348#L214 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 307#L217 assume !(node6_~m6~0#1 != ~nomsg~0); 308#L217-1 ~mode6~0 := 0; 297#L214-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 298#L239 assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 313#L242 assume !(node7_~m7~0#1 != ~nomsg~0); 346#L242-1 ~mode7~0 := 0; 345#L239-2 assume { :end_inline_node7 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 326#L472 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; 311#L472-1 check_#res#1 := check_~tmp~1#1; 390#L492 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 388#L583 assume !(0 == assert_~arg#1 % 256); 344#L578 assume { :end_inline_assert } true; 293#L548-2 [2022-07-23 15:49:50,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:49:50,059 INFO L85 PathProgramCache]: Analyzing trace with hash 292839954, now seen corresponding path program 1 times [2022-07-23 15:49:50,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:49:50,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141225441] [2022-07-23 15:49:50,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:49:50,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:49:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:49:50,118 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:49:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:49:50,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:49:50,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:49:50,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1180487745, now seen corresponding path program 1 times [2022-07-23 15:49:50,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:49:50,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142350761] [2022-07-23 15:49:50,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:49:50,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:49:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:49:50,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:49:50,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:49:50,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142350761] [2022-07-23 15:49:50,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142350761] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:49:50,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:49:50,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 15:49:50,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906745724] [2022-07-23 15:49:50,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:49:50,285 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 15:49:50,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:49:50,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 15:49:50,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 15:49:50,287 INFO L87 Difference]: Start difference. First operand 124 states and 165 transitions. cyclomatic complexity: 42 Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:49:50,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:49:50,349 INFO L93 Difference]: Finished difference Result 127 states and 167 transitions. [2022-07-23 15:49:50,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 15:49:50,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 167 transitions. [2022-07-23 15:49:50,353 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-07-23 15:49:50,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 124 states and 162 transitions. [2022-07-23 15:49:50,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2022-07-23 15:49:50,355 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2022-07-23 15:49:50,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 162 transitions. [2022-07-23 15:49:50,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 15:49:50,357 INFO L369 hiAutomatonCegarLoop]: Abstraction has 124 states and 162 transitions. [2022-07-23 15:49:50,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 162 transitions. [2022-07-23 15:49:50,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-23 15:49:50,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.3064516129032258) internal successors, (162), 123 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:49:50,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 162 transitions. [2022-07-23 15:49:50,369 INFO L392 hiAutomatonCegarLoop]: Abstraction has 124 states and 162 transitions. [2022-07-23 15:49:50,369 INFO L374 stractBuchiCegarLoop]: Abstraction has 124 states and 162 transitions. [2022-07-23 15:49:50,369 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-23 15:49:50,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 162 transitions. [2022-07-23 15:49:50,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-07-23 15:49:50,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:49:50,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:49:50,374 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:49:50,375 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:49:50,375 INFO L752 eck$LassoCheckResult]: Stem: 659#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0; 598#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 599#L263 assume 0 == ~r1~0 % 256; 627#L264 assume ~id1~0 >= 0; 628#L265 assume 0 == ~st1~0; 562#L266 assume ~send1~0 == ~id1~0; 563#L267 assume 0 == ~mode1~0 % 256; 568#L268 assume ~id2~0 >= 0; 569#L269 assume 0 == ~st2~0; 554#L270 assume ~send2~0 == ~id2~0; 555#L271 assume 0 == ~mode2~0 % 256; 587#L272 assume ~id3~0 >= 0; 605#L273 assume 0 == ~st3~0; 625#L274 assume ~send3~0 == ~id3~0; 649#L275 assume 0 == ~mode3~0 % 256; 540#L276 assume ~id4~0 >= 0; 541#L277 assume 0 == ~st4~0; 660#L278 assume ~send4~0 == ~id4~0; 618#L279 assume 0 == ~mode4~0 % 256; 619#L280 assume ~id5~0 >= 0; 564#L281 assume 0 == ~st5~0; 542#L282 assume ~send5~0 == ~id5~0; 543#L283 assume 0 == ~mode5~0 % 256; 629#L284 assume ~id6~0 >= 0; 630#L285 assume 0 == ~st6~0; 644#L286 assume ~send6~0 == ~id6~0; 634#L287 assume 0 == ~mode6~0 % 256; 578#L288 assume ~id7~0 >= 0; 579#L289 assume 0 == ~st7~0; 591#L290 assume ~send7~0 == ~id7~0; 640#L291 assume 0 == ~mode7~0 % 256; 641#L292 assume ~id1~0 != ~id2~0; 650#L293 assume ~id1~0 != ~id3~0; 658#L294 assume ~id1~0 != ~id4~0; 549#L295 assume ~id1~0 != ~id5~0; 550#L296 assume ~id1~0 != ~id6~0; 588#L297 assume ~id1~0 != ~id7~0; 584#L298 assume ~id2~0 != ~id3~0; 585#L299 assume ~id2~0 != ~id4~0; 596#L300 assume ~id2~0 != ~id5~0; 635#L301 assume ~id2~0 != ~id6~0; 642#L302 assume ~id2~0 != ~id7~0; 643#L303 assume ~id3~0 != ~id4~0; 654#L304 assume ~id3~0 != ~id5~0; 631#L305 assume ~id3~0 != ~id6~0; 632#L306 assume ~id3~0 != ~id7~0; 638#L307 assume ~id4~0 != ~id5~0; 558#L308 assume ~id4~0 != ~id6~0; 559#L309 assume ~id4~0 != ~id7~0; 636#L310 assume ~id5~0 != ~id6~0; 612#L311 assume ~id5~0 != ~id7~0; 613#L312 assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; 661#L263-1 init_#res#1 := init_~tmp~0#1; 656#L464 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 603#L22 assume !(0 == assume_abort_if_not_~cond#1); 604#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 556#L548-2 [2022-07-23 15:49:50,375 INFO L754 eck$LassoCheckResult]: Loop: 556#L548-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 557#L85 assume !(0 != ~mode1~0 % 256); 595#L102 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 606#L102-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 544#L85-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 545#L114 assume !(0 != ~mode2~0 % 256); 615#L127 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 626#L127-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 600#L114-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 581#L139 assume !(0 != ~mode3~0 % 256); 582#L152 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 586#L152-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 565#L139-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 566#L164 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 567#L167 assume !(node4_~m4~0#1 != ~nomsg~0); 547#L167-1 ~mode4~0 := 0; 623#L164-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 624#L189 assume !(0 != ~mode5~0 % 256); 645#L202 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 646#L202-2 ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 610#L189-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 611#L214 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 570#L217 assume !(node6_~m6~0#1 != ~nomsg~0); 571#L217-1 ~mode6~0 := 0; 560#L214-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 561#L239 assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 576#L242 assume !(node7_~m7~0#1 != ~nomsg~0); 609#L242-1 ~mode7~0 := 0; 608#L239-2 assume { :end_inline_node7 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 589#L472 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1; 590#L473 assume ~r1~0 % 256 >= 7; 580#L477 assume ~r1~0 % 256 < 7;check_~tmp~1#1 := 1; 574#L472-1 check_#res#1 := check_~tmp~1#1; 653#L492 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 651#L583 assume !(0 == assert_~arg#1 % 256); 607#L578 assume { :end_inline_assert } true; 556#L548-2 [2022-07-23 15:49:50,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:49:50,376 INFO L85 PathProgramCache]: Analyzing trace with hash 292839954, now seen corresponding path program 2 times [2022-07-23 15:49:50,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:49:50,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460481642] [2022-07-23 15:49:50,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:49:50,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:49:50,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:49:50,420 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:49:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:49:50,450 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:49:50,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:49:50,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1560049331, now seen corresponding path program 1 times [2022-07-23 15:49:50,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:49:50,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931314709] [2022-07-23 15:49:50,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:49:50,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:49:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:49:50,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:49:50,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:49:50,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931314709] [2022-07-23 15:49:50,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931314709] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:49:50,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:49:50,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 15:49:50,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117344317] [2022-07-23 15:49:50,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:49:50,507 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 15:49:50,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:49:50,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 15:49:50,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 15:49:50,510 INFO L87 Difference]: Start difference. First operand 124 states and 162 transitions. cyclomatic complexity: 39 Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:49:50,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:49:50,538 INFO L93 Difference]: Finished difference Result 186 states and 257 transitions. [2022-07-23 15:49:50,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 15:49:50,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 257 transitions. [2022-07-23 15:49:50,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 130 [2022-07-23 15:49:50,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 186 states and 257 transitions. [2022-07-23 15:49:50,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2022-07-23 15:49:50,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2022-07-23 15:49:50,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 257 transitions. [2022-07-23 15:49:50,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 15:49:50,544 INFO L369 hiAutomatonCegarLoop]: Abstraction has 186 states and 257 transitions. [2022-07-23 15:49:50,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 257 transitions. [2022-07-23 15:49:50,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2022-07-23 15:49:50,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 184 states have (on average 1.3804347826086956) internal successors, (254), 183 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 15:49:50,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 254 transitions. [2022-07-23 15:49:50,550 INFO L392 hiAutomatonCegarLoop]: Abstraction has 184 states and 254 transitions. [2022-07-23 15:49:50,550 INFO L374 stractBuchiCegarLoop]: Abstraction has 184 states and 254 transitions. [2022-07-23 15:49:50,551 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-23 15:49:50,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 184 states and 254 transitions. [2022-07-23 15:49:50,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 128 [2022-07-23 15:49:50,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:49:50,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:49:50,553 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:49:50,553 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:49:50,553 INFO L752 eck$LassoCheckResult]: Stem: 978#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0; 915#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 916#L263 assume 0 == ~r1~0 % 256; 944#L264 assume ~id1~0 >= 0; 945#L265 assume 0 == ~st1~0; 878#L266 assume ~send1~0 == ~id1~0; 879#L267 assume 0 == ~mode1~0 % 256; 887#L268 assume ~id2~0 >= 0; 888#L269 assume 0 == ~st2~0; 870#L270 assume ~send2~0 == ~id2~0; 871#L271 assume 0 == ~mode2~0 % 256; 903#L272 assume ~id3~0 >= 0; 922#L273 assume 0 == ~st3~0; 942#L274 assume ~send3~0 == ~id3~0; 966#L275 assume 0 == ~mode3~0 % 256; 856#L276 assume ~id4~0 >= 0; 857#L277 assume 0 == ~st4~0; 979#L278 assume ~send4~0 == ~id4~0; 935#L279 assume 0 == ~mode4~0 % 256; 936#L280 assume ~id5~0 >= 0; 880#L281 assume 0 == ~st5~0; 858#L282 assume ~send5~0 == ~id5~0; 859#L283 assume 0 == ~mode5~0 % 256; 946#L284 assume ~id6~0 >= 0; 947#L285 assume 0 == ~st6~0; 961#L286 assume ~send6~0 == ~id6~0; 951#L287 assume 0 == ~mode6~0 % 256; 894#L288 assume ~id7~0 >= 0; 895#L289 assume 0 == ~st7~0; 907#L290 assume ~send7~0 == ~id7~0; 957#L291 assume 0 == ~mode7~0 % 256; 958#L292 assume ~id1~0 != ~id2~0; 967#L293 assume ~id1~0 != ~id3~0; 977#L294 assume ~id1~0 != ~id4~0; 865#L295 assume ~id1~0 != ~id5~0; 866#L296 assume ~id1~0 != ~id6~0; 904#L297 assume ~id1~0 != ~id7~0; 900#L298 assume ~id2~0 != ~id3~0; 901#L299 assume ~id2~0 != ~id4~0; 912#L300 assume ~id2~0 != ~id5~0; 952#L301 assume ~id2~0 != ~id6~0; 959#L302 assume ~id2~0 != ~id7~0; 960#L303 assume ~id3~0 != ~id4~0; 972#L304 assume ~id3~0 != ~id5~0; 948#L305 assume ~id3~0 != ~id6~0; 949#L306 assume ~id3~0 != ~id7~0; 955#L307 assume ~id4~0 != ~id5~0; 874#L308 assume ~id4~0 != ~id6~0; 875#L309 assume ~id4~0 != ~id7~0; 953#L310 assume ~id5~0 != ~id6~0; 929#L311 assume ~id5~0 != ~id7~0; 930#L312 assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; 980#L263-1 init_#res#1 := init_~tmp~0#1; 975#L464 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 920#L22 assume !(0 == assume_abort_if_not_~cond#1); 921#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 970#L548-2 [2022-07-23 15:49:50,554 INFO L754 eck$LassoCheckResult]: Loop: 970#L548-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 1033#L85 assume !(0 != ~mode1~0 % 256); 1032#L102 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 1031#L102-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 974#L85-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 1030#L114 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 1028#L117 assume !(node2_~m2~0#1 != ~nomsg~0); 1025#L117-1 ~mode2~0 := 0; 1023#L114-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 1022#L139 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 1020#L142 assume !(node3_~m3~0#1 != ~nomsg~0); 1017#L142-1 ~mode3~0 := 0; 1015#L139-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 1014#L164 assume !(0 != ~mode4~0 % 256); 1010#L177 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 1009#L177-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 1007#L164-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 1006#L189 assume !(0 != ~mode5~0 % 256); 1002#L202 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 1001#L202-2 ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 999#L189-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 998#L214 assume !(0 != ~mode6~0 % 256); 994#L227 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 993#L227-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 991#L214-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 990#L239 assume !(0 != ~mode7~0 % 256); 986#L252 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 985#L252-2 ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; 983#L239-2 assume { :end_inline_node7 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 982#L472 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1; 981#L473 assume !(~r1~0 % 256 >= 7); 918#L476 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0; 919#L477 assume ~r1~0 % 256 < 7;check_~tmp~1#1 := 1; 1037#L472-1 check_#res#1 := check_~tmp~1#1; 1036#L492 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 1035#L583 assume !(0 == assert_~arg#1 % 256); 1034#L578 assume { :end_inline_assert } true; 970#L548-2 [2022-07-23 15:49:50,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:49:50,554 INFO L85 PathProgramCache]: Analyzing trace with hash 292839954, now seen corresponding path program 3 times [2022-07-23 15:49:50,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:49:50,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720003669] [2022-07-23 15:49:50,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:49:50,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:49:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:49:50,575 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:49:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:49:50,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:49:50,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:49:50,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1335319549, now seen corresponding path program 1 times [2022-07-23 15:49:50,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:49:50,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689227273] [2022-07-23 15:49:50,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:49:50,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:49:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:49:50,629 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:49:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:49:50,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:49:50,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:49:50,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1306912914, now seen corresponding path program 1 times [2022-07-23 15:49:50,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:49:50,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378077589] [2022-07-23 15:49:50,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:49:50,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:49:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:49:50,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:49:50,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:49:50,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378077589] [2022-07-23 15:49:50,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378077589] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:49:50,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:49:50,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 15:49:50,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145734224] [2022-07-23 15:49:50,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:49:52,469 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 15:49:52,469 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 15:49:52,470 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 15:49:52,470 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 15:49:52,470 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-23 15:49:52,470 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:49:52,470 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 15:49:52,470 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 15:49:52,470 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.7.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2022-07-23 15:49:52,471 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 15:49:52,471 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 15:49:52,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:49:52,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:49:52,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:49:52,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:49:52,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:49:52,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:49:52,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:49:52,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:49:52,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:49:52,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:49:52,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:49:52,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:49:52,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:49:52,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:49:52,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:49:52,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:49:52,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:49:52,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:49:52,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:49:52,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:49:53,900 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2022-07-23 15:49:54,300 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 7776 conjuctions. This might take some time... [2022-07-23 15:50:08,478 INFO L192 XnfTransformerHelper]: Simplified to disjunction of 7776 conjuctions.