./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ca09f7b-0e97-4db4-b0ac-aa28f77a523b/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ca09f7b-0e97-4db4-b0ac-aa28f77a523b/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ca09f7b-0e97-4db4-b0ac-aa28f77a523b/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ca09f7b-0e97-4db4-b0ac-aa28f77a523b/bin/uautomizer-tPACEb0tL8/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ca09f7b-0e97-4db4-b0ac-aa28f77a523b/bin/uautomizer-tPACEb0tL8/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ca09f7b-0e97-4db4-b0ac-aa28f77a523b/bin/uautomizer-tPACEb0tL8 --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 92be10af768295be2ee9c176bac2a7de85c1afeb202e4b441d20022190d8e93f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:51:35,944 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:51:35,946 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:51:35,968 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:51:35,969 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:51:35,970 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:51:35,972 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:51:35,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:51:35,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:51:35,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:51:35,978 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:51:35,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:51:35,982 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:51:35,984 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:51:35,987 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:51:35,990 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:51:35,992 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:51:35,997 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:51:36,000 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:51:36,002 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:51:36,009 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:51:36,011 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:51:36,012 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:51:36,013 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:51:36,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:51:36,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:51:36,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:51:36,019 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:51:36,019 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:51:36,020 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:51:36,021 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:51:36,022 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:51:36,023 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:51:36,023 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:51:36,025 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:51:36,025 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:51:36,026 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:51:36,026 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:51:36,026 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:51:36,028 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:51:36,028 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:51:36,029 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ca09f7b-0e97-4db4-b0ac-aa28f77a523b/bin/uautomizer-tPACEb0tL8/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-16 11:51:36,059 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:51:36,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:51:36,064 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:51:36,065 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:51:36,066 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:51:36,066 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:51:36,067 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:51:36,067 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-16 11:51:36,067 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-16 11:51:36,067 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-16 11:51:36,068 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-16 11:51:36,069 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-16 11:51:36,069 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-16 11:51:36,069 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:51:36,069 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:51:36,070 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:51:36,070 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:51:36,070 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:51:36,070 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:51:36,071 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-16 11:51:36,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-16 11:51:36,071 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-16 11:51:36,071 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:51:36,071 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:51:36,072 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-16 11:51:36,072 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:51:36,072 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-16 11:51:36,072 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:51:36,073 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:51:36,073 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:51:36,073 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:51:36,075 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-16 11:51:36,075 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ca09f7b-0e97-4db4-b0ac-aa28f77a523b/bin/uautomizer-tPACEb0tL8/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ca09f7b-0e97-4db4-b0ac-aa28f77a523b/bin/uautomizer-tPACEb0tL8 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 -> 92be10af768295be2ee9c176bac2a7de85c1afeb202e4b441d20022190d8e93f [2022-11-16 11:51:36,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:51:36,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:51:36,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:51:36,417 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:51:36,419 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:51:36,420 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ca09f7b-0e97-4db4-b0ac-aa28f77a523b/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.c [2022-11-16 11:51:36,506 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ca09f7b-0e97-4db4-b0ac-aa28f77a523b/bin/uautomizer-tPACEb0tL8/data/e0ca5d415/b3c3c8a856484c80836b8004488145ed/FLAG0d0708849 [2022-11-16 11:51:37,167 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:51:37,168 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ca09f7b-0e97-4db4-b0ac-aa28f77a523b/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.c [2022-11-16 11:51:37,177 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ca09f7b-0e97-4db4-b0ac-aa28f77a523b/bin/uautomizer-tPACEb0tL8/data/e0ca5d415/b3c3c8a856484c80836b8004488145ed/FLAG0d0708849 [2022-11-16 11:51:37,192 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ca09f7b-0e97-4db4-b0ac-aa28f77a523b/bin/uautomizer-tPACEb0tL8/data/e0ca5d415/b3c3c8a856484c80836b8004488145ed [2022-11-16 11:51:37,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:51:37,199 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:51:37,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:51:37,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:51:37,208 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:51:37,210 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:51:37" (1/1) ... [2022-11-16 11:51:37,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bf383f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:37, skipping insertion in model container [2022-11-16 11:51:37,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:51:37" (1/1) ... [2022-11-16 11:51:37,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:51:37,248 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:51:37,521 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ca09f7b-0e97-4db4-b0ac-aa28f77a523b/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.c[6043,6056] [2022-11-16 11:51:37,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:51:37,534 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:51:37,578 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ca09f7b-0e97-4db4-b0ac-aa28f77a523b/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.UNBOUNDED.pals.c[6043,6056] [2022-11-16 11:51:37,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:51:37,595 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:51:37,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:37 WrapperNode [2022-11-16 11:51:37,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:51:37,597 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:51:37,597 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:51:37,597 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:51:37,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:37" (1/1) ... [2022-11-16 11:51:37,615 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:37" (1/1) ... [2022-11-16 11:51:37,659 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 196 [2022-11-16 11:51:37,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:51:37,660 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:51:37,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:51:37,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:51:37,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:37" (1/1) ... [2022-11-16 11:51:37,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:37" (1/1) ... [2022-11-16 11:51:37,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:37" (1/1) ... [2022-11-16 11:51:37,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:37" (1/1) ... [2022-11-16 11:51:37,707 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:37" (1/1) ... [2022-11-16 11:51:37,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:37" (1/1) ... [2022-11-16 11:51:37,714 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:37" (1/1) ... [2022-11-16 11:51:37,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:37" (1/1) ... [2022-11-16 11:51:37,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:51:37,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:51:37,734 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:51:37,734 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:51:37,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:37" (1/1) ... [2022-11-16 11:51:37,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:51:37,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ca09f7b-0e97-4db4-b0ac-aa28f77a523b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:37,770 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ca09f7b-0e97-4db4-b0ac-aa28f77a523b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:51:37,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5ca09f7b-0e97-4db4-b0ac-aa28f77a523b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-16 11:51:37,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:51:37,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:51:37,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:51:37,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:51:37,931 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:51:37,934 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:51:38,333 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:51:38,341 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:51:38,359 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 11:51:38,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:51:38 BoogieIcfgContainer [2022-11-16 11:51:38,362 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:51:38,363 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-16 11:51:38,363 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-16 11:51:38,368 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-16 11:51:38,369 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 11:51:38,369 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 11:51:37" (1/3) ... [2022-11-16 11:51:38,370 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5922a4fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 11:51:38, skipping insertion in model container [2022-11-16 11:51:38,378 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 11:51:38,379 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:37" (2/3) ... [2022-11-16 11:51:38,379 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5922a4fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 11:51:38, skipping insertion in model container [2022-11-16 11:51:38,379 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 11:51:38,380 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:51:38" (3/3) ... [2022-11-16 11:51:38,381 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c [2022-11-16 11:51:38,470 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-16 11:51:38,470 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-16 11:51:38,470 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-16 11:51:38,471 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-16 11:51:38,471 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-16 11:51:38,471 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-16 11:51:38,471 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-16 11:51:38,472 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-16 11:51:38,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 57 states, 56 states have (on average 1.6785714285714286) internal successors, (94), 56 states have internal predecessors, (94), 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-11-16 11:51:38,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2022-11-16 11:51:38,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:51:38,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:51:38,536 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:51:38,537 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:51:38,537 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-16 11:51:38,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 57 states, 56 states have (on average 1.6785714285714286) internal successors, (94), 56 states have internal predecessors, (94), 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-11-16 11:51:38,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2022-11-16 11:51:38,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:51:38,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:51:38,552 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:51:38,553 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:51:38,563 INFO L748 eck$LassoCheckResult]: Stem: 42#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);~p1~0 := 0;~nomsg~0 := -1;~p2~0 := 0;~p3~0 := 0;~mode3~0 := 0;~p2_old~0 := 0;~send1~0 := 0;~send2~0 := 0;~p2_new~0 := 0;~send3~0 := 0;~st2~0 := 0;~st1~0 := 0;~p3_old~0 := 0;~st3~0 := 0;~id2~0 := 0;~p1_old~0 := 0;~id1~0 := 0;~id3~0 := 0;~p1_new~0 := 0;~mode2~0 := 0;~mode1~0 := 0;~p3_new~0 := 0;~r1~0 := 0; 34#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, 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~ret17#1, main_#t~ret18#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~nondet4#1;havoc main_#t~nondet4#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 31#L135true assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 9#L135-1true init_#res#1 := init_~tmp~0#1; 30#L200true main_#t~ret17#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret17#1;havoc main_#t~ret17#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; 36#L22true assume !(0 == assume_abort_if_not_~cond#1); 22#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;main_~i2~0#1 := 0; 20#L260-2true [2022-11-16 11:51:38,572 INFO L750 eck$LassoCheckResult]: Loop: 20#L260-2true assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 55#L57true assume !(0 != ~mode1~0 % 256);~p1_new~0 := (if (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 <= 127 then (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 else (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 - 256);~mode1~0 := 1; 46#L57-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 3#L86true assume !(0 != ~mode2~0 % 256);~p2_new~0 := (if (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 <= 127 then (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 else (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 - 256);~mode2~0 := 1; 54#L86-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 15#L111true assume !(0 != ~mode3~0 % 256);~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256);~mode3~0 := 1; 23#L111-2true assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 33#L208true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 41#L208-1true check_#res#1 := check_~tmp~1#1; 12#L228true main_#t~ret18#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret18#1;havoc main_#t~ret18#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; 21#L283true assume !(0 == assert_~arg#1 % 256); 56#L278true assume { :end_inline_assert } true; 20#L260-2true [2022-11-16 11:51:38,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:38,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1892699938, now seen corresponding path program 1 times [2022-11-16 11:51:38,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:38,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749814207] [2022-11-16 11:51:38,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:38,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:39,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:51:39,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:39,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749814207] [2022-11-16 11:51:39,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749814207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:51:39,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:51:39,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:51:39,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740769344] [2022-11-16 11:51:39,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:51:39,027 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-16 11:51:39,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:39,031 INFO L85 PathProgramCache]: Analyzing trace with hash 920486509, now seen corresponding path program 1 times [2022-11-16 11:51:39,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:39,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62080662] [2022-11-16 11:51:39,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:39,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:39,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:51:39,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:39,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62080662] [2022-11-16 11:51:39,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62080662] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:51:39,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:51:39,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:51:39,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304281545] [2022-11-16 11:51:39,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:51:39,500 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 11:51:39,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:39,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:51:39,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:51:39,555 INFO L87 Difference]: Start difference. First operand has 57 states, 56 states have (on average 1.6785714285714286) internal successors, (94), 56 states have internal predecessors, (94), 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-11-16 11:51:39,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:39,682 INFO L93 Difference]: Finished difference Result 56 states and 89 transitions. [2022-11-16 11:51:39,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 89 transitions. [2022-11-16 11:51:39,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2022-11-16 11:51:39,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 52 states and 70 transitions. [2022-11-16 11:51:39,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2022-11-16 11:51:39,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2022-11-16 11:51:39,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 70 transitions. [2022-11-16 11:51:39,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:51:39,697 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 70 transitions. [2022-11-16 11:51:39,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 70 transitions. [2022-11-16 11:51:39,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-11-16 11:51:39,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 51 states have internal predecessors, (70), 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-11-16 11:51:39,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 70 transitions. [2022-11-16 11:51:39,736 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 70 transitions. [2022-11-16 11:51:39,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:51:39,742 INFO L428 stractBuchiCegarLoop]: Abstraction has 52 states and 70 transitions. [2022-11-16 11:51:39,742 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-16 11:51:39,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 70 transitions. [2022-11-16 11:51:39,744 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2022-11-16 11:51:39,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:51:39,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:51:39,746 INFO L148 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] [2022-11-16 11:51:39,746 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:51:39,747 INFO L748 eck$LassoCheckResult]: Stem: 178#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);~p1~0 := 0;~nomsg~0 := -1;~p2~0 := 0;~p3~0 := 0;~mode3~0 := 0;~p2_old~0 := 0;~send1~0 := 0;~send2~0 := 0;~p2_new~0 := 0;~send3~0 := 0;~st2~0 := 0;~st1~0 := 0;~p3_old~0 := 0;~st3~0 := 0;~id2~0 := 0;~p1_old~0 := 0;~id1~0 := 0;~id3~0 := 0;~p1_new~0 := 0;~mode2~0 := 0;~mode1~0 := 0;~p3_new~0 := 0;~r1~0 := 0; 176#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, 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~ret17#1, main_#t~ret18#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~nondet4#1;havoc main_#t~nondet4#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 173#L135 assume 0 == ~r1~0 % 256; 145#L136 assume ~id1~0 >= 0; 146#L137 assume 0 == ~st1~0; 182#L138 assume ~send1~0 == ~id1~0; 166#L139 assume 0 == ~mode1~0 % 256; 167#L140 assume ~id2~0 >= 0; 177#L141 assume 0 == ~st2~0; 170#L142 assume ~send2~0 == ~id2~0; 169#L143 assume 0 == ~mode2~0 % 256; 139#L144 assume ~id3~0 >= 0; 140#L145 assume 0 == ~st3~0; 149#L146 assume ~send3~0 == ~id3~0; 150#L147 assume 0 == ~mode3~0 % 256; 168#L148 assume ~id1~0 != ~id2~0; 159#L149 assume ~id1~0 != ~id3~0; 160#L150 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 141#L135-1 init_#res#1 := init_~tmp~0#1; 142#L200 main_#t~ret17#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret17#1;havoc main_#t~ret17#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; 172#L22 assume !(0 == assume_abort_if_not_~cond#1); 164#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;main_~i2~0#1 := 0; 161#L260-2 [2022-11-16 11:51:39,747 INFO L750 eck$LassoCheckResult]: Loop: 161#L260-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 162#L57 assume !(0 != ~mode1~0 % 256);~p1_new~0 := (if (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 <= 127 then (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 else (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 - 256);~mode1~0 := 1; 180#L57-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 131#L86 assume !(0 != ~mode2~0 % 256);~p2_new~0 := (if (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 <= 127 then (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 else (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 - 256);~mode2~0 := 1; 133#L86-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 153#L111 assume !(0 != ~mode3~0 % 256);~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256);~mode3~0 := 1; 155#L111-2 assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 165#L208 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 137#L208-1 check_#res#1 := check_~tmp~1#1; 147#L228 main_#t~ret18#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret18#1;havoc main_#t~ret18#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; 148#L283 assume !(0 == assert_~arg#1 % 256); 163#L278 assume { :end_inline_assert } true; 161#L260-2 [2022-11-16 11:51:39,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:39,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 1 times [2022-11-16 11:51:39,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:39,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435694154] [2022-11-16 11:51:39,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:39,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:51:39,790 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:51:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:51:39,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:51:39,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:39,835 INFO L85 PathProgramCache]: Analyzing trace with hash 920486509, now seen corresponding path program 2 times [2022-11-16 11:51:39,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:39,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452241227] [2022-11-16 11:51:39,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:39,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:40,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:51:40,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:40,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452241227] [2022-11-16 11:51:40,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452241227] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:51:40,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:51:40,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:51:40,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936743337] [2022-11-16 11:51:40,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:51:40,015 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 11:51:40,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:40,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:51:40,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:51:40,017 INFO L87 Difference]: Start difference. First operand 52 states and 70 transitions. cyclomatic complexity: 19 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-11-16 11:51:40,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:40,117 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2022-11-16 11:51:40,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 72 transitions. [2022-11-16 11:51:40,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2022-11-16 11:51:40,120 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 52 states and 67 transitions. [2022-11-16 11:51:40,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2022-11-16 11:51:40,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2022-11-16 11:51:40,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 67 transitions. [2022-11-16 11:51:40,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:51:40,121 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 67 transitions. [2022-11-16 11:51:40,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 67 transitions. [2022-11-16 11:51:40,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-11-16 11:51:40,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 51 states have internal predecessors, (67), 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-11-16 11:51:40,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2022-11-16 11:51:40,126 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 67 transitions. [2022-11-16 11:51:40,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:51:40,128 INFO L428 stractBuchiCegarLoop]: Abstraction has 52 states and 67 transitions. [2022-11-16 11:51:40,128 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-16 11:51:40,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 67 transitions. [2022-11-16 11:51:40,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2022-11-16 11:51:40,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:51:40,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:51:40,131 INFO L148 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] [2022-11-16 11:51:40,131 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:51:40,131 INFO L748 eck$LassoCheckResult]: Stem: 297#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);~p1~0 := 0;~nomsg~0 := -1;~p2~0 := 0;~p3~0 := 0;~mode3~0 := 0;~p2_old~0 := 0;~send1~0 := 0;~send2~0 := 0;~p2_new~0 := 0;~send3~0 := 0;~st2~0 := 0;~st1~0 := 0;~p3_old~0 := 0;~st3~0 := 0;~id2~0 := 0;~p1_old~0 := 0;~id1~0 := 0;~id3~0 := 0;~p1_new~0 := 0;~mode2~0 := 0;~mode1~0 := 0;~p3_new~0 := 0;~r1~0 := 0; 295#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, 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~ret17#1, main_#t~ret18#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~nondet4#1;havoc main_#t~nondet4#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 292#L135 assume 0 == ~r1~0 % 256; 263#L136 assume ~id1~0 >= 0; 264#L137 assume 0 == ~st1~0; 301#L138 assume ~send1~0 == ~id1~0; 285#L139 assume 0 == ~mode1~0 % 256; 286#L140 assume ~id2~0 >= 0; 296#L141 assume 0 == ~st2~0; 289#L142 assume ~send2~0 == ~id2~0; 288#L143 assume 0 == ~mode2~0 % 256; 257#L144 assume ~id3~0 >= 0; 258#L145 assume 0 == ~st3~0; 267#L146 assume ~send3~0 == ~id3~0; 268#L147 assume 0 == ~mode3~0 % 256; 287#L148 assume ~id1~0 != ~id2~0; 278#L149 assume ~id1~0 != ~id3~0; 279#L150 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 259#L135-1 init_#res#1 := init_~tmp~0#1; 260#L200 main_#t~ret17#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret17#1;havoc main_#t~ret17#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; 291#L22 assume !(0 == assume_abort_if_not_~cond#1); 283#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;main_~i2~0#1 := 0; 280#L260-2 [2022-11-16 11:51:40,132 INFO L750 eck$LassoCheckResult]: Loop: 280#L260-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 281#L57 assume !(0 != ~mode1~0 % 256);~p1_new~0 := (if (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 <= 127 then (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 else (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 - 256);~mode1~0 := 1; 299#L57-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 250#L86 assume !(0 != ~mode2~0 % 256);~p2_new~0 := (if (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 <= 127 then (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 else (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 - 256);~mode2~0 := 1; 252#L86-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 271#L111 assume !(0 != ~mode3~0 % 256);~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256);~mode3~0 := 1; 273#L111-2 assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 284#L208 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 294#L209 assume ~r1~0 % 256 >= 3; 256#L213 assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; 275#L208-1 check_#res#1 := check_~tmp~1#1; 265#L228 main_#t~ret18#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret18#1;havoc main_#t~ret18#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; 266#L283 assume !(0 == assert_~arg#1 % 256); 282#L278 assume { :end_inline_assert } true; 280#L260-2 [2022-11-16 11:51:40,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:40,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 2 times [2022-11-16 11:51:40,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:40,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152883147] [2022-11-16 11:51:40,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:40,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:51:40,148 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:51:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:51:40,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:51:40,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:40,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1591551907, now seen corresponding path program 1 times [2022-11-16 11:51:40,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:40,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416091373] [2022-11-16 11:51:40,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:40,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:40,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:51:40,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:40,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416091373] [2022-11-16 11:51:40,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416091373] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:51:40,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:51:40,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:51:40,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009101430] [2022-11-16 11:51:40,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:51:40,204 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 11:51:40,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:40,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:51:40,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:51:40,205 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-11-16 11:51:40,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:40,244 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2022-11-16 11:51:40,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 101 transitions. [2022-11-16 11:51:40,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 54 [2022-11-16 11:51:40,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 101 transitions. [2022-11-16 11:51:40,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2022-11-16 11:51:40,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2022-11-16 11:51:40,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 101 transitions. [2022-11-16 11:51:40,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:51:40,249 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 101 transitions. [2022-11-16 11:51:40,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 101 transitions. [2022-11-16 11:51:40,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2022-11-16 11:51:40,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 73 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:51:40,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 98 transitions. [2022-11-16 11:51:40,256 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 98 transitions. [2022-11-16 11:51:40,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:51:40,257 INFO L428 stractBuchiCegarLoop]: Abstraction has 74 states and 98 transitions. [2022-11-16 11:51:40,257 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-16 11:51:40,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 98 transitions. [2022-11-16 11:51:40,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2022-11-16 11:51:40,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:51:40,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:51:40,260 INFO L148 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] [2022-11-16 11:51:40,260 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:51:40,261 INFO L748 eck$LassoCheckResult]: Stem: 435#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);~p1~0 := 0;~nomsg~0 := -1;~p2~0 := 0;~p3~0 := 0;~mode3~0 := 0;~p2_old~0 := 0;~send1~0 := 0;~send2~0 := 0;~p2_new~0 := 0;~send3~0 := 0;~st2~0 := 0;~st1~0 := 0;~p3_old~0 := 0;~st3~0 := 0;~id2~0 := 0;~p1_old~0 := 0;~id1~0 := 0;~id3~0 := 0;~p1_new~0 := 0;~mode2~0 := 0;~mode1~0 := 0;~p3_new~0 := 0;~r1~0 := 0; 431#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, 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~ret17#1, main_#t~ret18#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~nondet4#1;havoc main_#t~nondet4#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 428#L135 assume 0 == ~r1~0 % 256; 398#L136 assume ~id1~0 >= 0; 399#L137 assume 0 == ~st1~0; 440#L138 assume ~send1~0 == ~id1~0; 421#L139 assume 0 == ~mode1~0 % 256; 422#L140 assume ~id2~0 >= 0; 433#L141 assume 0 == ~st2~0; 425#L142 assume ~send2~0 == ~id2~0; 424#L143 assume 0 == ~mode2~0 % 256; 392#L144 assume ~id3~0 >= 0; 393#L145 assume 0 == ~st3~0; 402#L146 assume ~send3~0 == ~id3~0; 403#L147 assume 0 == ~mode3~0 % 256; 423#L148 assume ~id1~0 != ~id2~0; 413#L149 assume ~id1~0 != ~id3~0; 414#L150 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 394#L135-1 init_#res#1 := init_~tmp~0#1; 395#L200 main_#t~ret17#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret17#1;havoc main_#t~ret17#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; 427#L22 assume !(0 == assume_abort_if_not_~cond#1); 418#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;main_~i2~0#1 := 0; 419#L260-2 [2022-11-16 11:51:40,261 INFO L750 eck$LassoCheckResult]: Loop: 419#L260-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 453#L57 assume !(0 != ~mode1~0 % 256);~p1_new~0 := (if (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 <= 127 then (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 else (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 - 256);~mode1~0 := 1; 439#L57-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 450#L86 assume !(0 != ~mode2~0 % 256);~p2_new~0 := (if (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 <= 127 then (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 else (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 - 256);~mode2~0 := 1; 449#L86-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 445#L111 assume !(0 != ~mode3~0 % 256);~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256);~mode3~0 := 1; 443#L111-2 assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 442#L208 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 441#L209 assume !(~r1~0 % 256 >= 3); 390#L212 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 391#L213 assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; 457#L208-1 check_#res#1 := check_~tmp~1#1; 456#L228 main_#t~ret18#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret18#1;havoc main_#t~ret18#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; 455#L283 assume !(0 == assert_~arg#1 % 256); 454#L278 assume { :end_inline_assert } true; 419#L260-2 [2022-11-16 11:51:40,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:40,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 3 times [2022-11-16 11:51:40,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:40,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253694284] [2022-11-16 11:51:40,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:40,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:51:40,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:51:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:51:40,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:51:40,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:40,295 INFO L85 PathProgramCache]: Analyzing trace with hash -446897046, now seen corresponding path program 1 times [2022-11-16 11:51:40,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:40,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965070087] [2022-11-16 11:51:40,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:40,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:51:40,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:51:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:51:40,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:51:40,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:40,346 INFO L85 PathProgramCache]: Analyzing trace with hash 423141932, now seen corresponding path program 1 times [2022-11-16 11:51:40,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:40,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863781173] [2022-11-16 11:51:40,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:40,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:51:40,390 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:51:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:51:40,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:51:42,663 INFO L210 LassoAnalysis]: Preferences: [2022-11-16 11:51:42,663 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-16 11:51:42,664 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-16 11:51:42,664 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-16 11:51:42,664 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-16 11:51:42,664 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:51:42,664 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-16 11:51:42,664 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-16 11:51:42,664 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2022-11-16 11:51:42,665 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-16 11:51:42,665 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-16 11:51:42,707 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:51:42,722 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:51:42,728 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:51:42,735 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:51:42,739 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:51:42,742 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:51:42,746 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:51:42,752 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:51:43,765 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:51:45,078 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2022-11-16 11:52:13,094 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 781218 conjuctions. This might take some time...