./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c957cf40-7638-4023-8e3b-aa09fed7765c/bin/uautomizer-J5u9QxTXDZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c957cf40-7638-4023-8e3b-aa09fed7765c/bin/uautomizer-J5u9QxTXDZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c957cf40-7638-4023-8e3b-aa09fed7765c/bin/uautomizer-J5u9QxTXDZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c957cf40-7638-4023-8e3b-aa09fed7765c/bin/uautomizer-J5u9QxTXDZ/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c957cf40-7638-4023-8e3b-aa09fed7765c/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c957cf40-7638-4023-8e3b-aa09fed7765c/bin/uautomizer-J5u9QxTXDZ --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 acd9e872db1fd43c4a46d62b416714fdbb0fdc4944c5c8838fbbff5e8b72009f --- 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-dbf71c6-m [2022-10-17 10:21:57,839 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 10:21:57,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 10:21:57,872 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 10:21:57,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 10:21:57,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 10:21:57,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 10:21:57,878 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 10:21:57,881 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 10:21:57,882 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 10:21:57,883 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 10:21:57,885 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 10:21:57,885 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 10:21:57,886 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 10:21:57,888 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 10:21:57,890 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 10:21:57,891 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 10:21:57,892 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 10:21:57,894 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 10:21:57,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 10:21:57,899 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 10:21:57,901 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 10:21:57,902 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 10:21:57,909 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 10:21:57,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 10:21:57,920 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 10:21:57,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 10:21:57,922 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 10:21:57,923 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 10:21:57,924 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 10:21:57,924 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 10:21:57,925 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 10:21:57,927 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 10:21:57,928 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 10:21:57,931 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 10:21:57,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 10:21:57,932 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 10:21:57,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 10:21:57,932 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 10:21:57,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 10:21:57,934 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 10:21:57,935 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c957cf40-7638-4023-8e3b-aa09fed7765c/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-10-17 10:21:57,977 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 10:21:57,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 10:21:57,977 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-17 10:21:57,978 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-17 10:21:57,979 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-17 10:21:57,979 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-17 10:21:57,979 INFO L138 SettingsManager]: * Use SBE=true [2022-10-17 10:21:57,979 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-10-17 10:21:57,979 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-10-17 10:21:57,980 INFO L138 SettingsManager]: * Use old map elimination=false [2022-10-17 10:21:57,980 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-10-17 10:21:57,980 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-10-17 10:21:57,980 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-10-17 10:21:57,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 10:21:57,981 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-17 10:21:57,981 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-17 10:21:57,981 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 10:21:57,981 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-17 10:21:57,981 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 10:21:57,982 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-10-17 10:21:57,982 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-10-17 10:21:57,982 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-10-17 10:21:57,982 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-17 10:21:57,982 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-17 10:21:57,983 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-10-17 10:21:57,983 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 10:21:57,983 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-10-17 10:21:57,983 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 10:21:57,984 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-17 10:21:57,984 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 10:21:57,984 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-17 10:21:57,985 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-10-17 10:21:57,985 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_c957cf40-7638-4023-8e3b-aa09fed7765c/bin/uautomizer-J5u9QxTXDZ/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_c957cf40-7638-4023-8e3b-aa09fed7765c/bin/uautomizer-J5u9QxTXDZ 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 -> acd9e872db1fd43c4a46d62b416714fdbb0fdc4944c5c8838fbbff5e8b72009f [2022-10-17 10:21:58,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 10:21:58,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 10:21:58,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 10:21:58,255 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 10:21:58,255 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 10:21:58,257 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c957cf40-7638-4023-8e3b-aa09fed7765c/bin/uautomizer-J5u9QxTXDZ/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.UNBOUNDED.pals.c [2022-10-17 10:21:58,373 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c957cf40-7638-4023-8e3b-aa09fed7765c/bin/uautomizer-J5u9QxTXDZ/data/5686ba85f/be7dda4286aa46d0891de4e16f6ba64a/FLAGf5935657c [2022-10-17 10:21:58,865 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 10:21:58,866 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c957cf40-7638-4023-8e3b-aa09fed7765c/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.UNBOUNDED.pals.c [2022-10-17 10:21:58,876 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c957cf40-7638-4023-8e3b-aa09fed7765c/bin/uautomizer-J5u9QxTXDZ/data/5686ba85f/be7dda4286aa46d0891de4e16f6ba64a/FLAGf5935657c [2022-10-17 10:21:59,219 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c957cf40-7638-4023-8e3b-aa09fed7765c/bin/uautomizer-J5u9QxTXDZ/data/5686ba85f/be7dda4286aa46d0891de4e16f6ba64a [2022-10-17 10:21:59,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 10:21:59,225 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 10:21:59,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 10:21:59,229 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 10:21:59,233 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 10:21:59,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:21:59" (1/1) ... [2022-10-17 10:21:59,235 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ff734cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:21:59, skipping insertion in model container [2022-10-17 10:21:59,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:21:59" (1/1) ... [2022-10-17 10:21:59,243 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 10:21:59,295 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 10:21:59,650 WARN L230 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_c957cf40-7638-4023-8e3b-aa09fed7765c/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.UNBOUNDED.pals.c[11261,11274] [2022-10-17 10:21:59,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:21:59,665 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 10:21:59,714 WARN L230 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_c957cf40-7638-4023-8e3b-aa09fed7765c/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.UNBOUNDED.pals.c[11261,11274] [2022-10-17 10:21:59,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:21:59,730 INFO L208 MainTranslator]: Completed translation [2022-10-17 10:21:59,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:21:59 WrapperNode [2022-10-17 10:21:59,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 10:21:59,732 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 10:21:59,732 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 10:21:59,732 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 10:21:59,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:21:59" (1/1) ... [2022-10-17 10:21:59,774 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:21:59" (1/1) ... [2022-10-17 10:21:59,811 INFO L138 Inliner]: procedures = 25, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 314 [2022-10-17 10:21:59,812 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 10:21:59,812 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 10:21:59,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 10:21:59,813 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 10:21:59,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:21:59" (1/1) ... [2022-10-17 10:21:59,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:21:59" (1/1) ... [2022-10-17 10:21:59,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:21:59" (1/1) ... [2022-10-17 10:21:59,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:21:59" (1/1) ... [2022-10-17 10:21:59,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:21:59" (1/1) ... [2022-10-17 10:21:59,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:21:59" (1/1) ... [2022-10-17 10:21:59,843 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:21:59" (1/1) ... [2022-10-17 10:21:59,846 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:21:59" (1/1) ... [2022-10-17 10:21:59,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 10:21:59,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 10:21:59,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 10:21:59,862 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 10:21:59,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:21:59" (1/1) ... [2022-10-17 10:21:59,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-10-17 10:21:59,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c957cf40-7638-4023-8e3b-aa09fed7765c/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:21:59,921 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c957cf40-7638-4023-8e3b-aa09fed7765c/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-10-17 10:21:59,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c957cf40-7638-4023-8e3b-aa09fed7765c/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-10-17 10:21:59,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 10:21:59,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 10:21:59,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 10:21:59,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 10:22:00,088 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 10:22:00,090 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 10:22:00,603 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 10:22:00,612 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 10:22:00,613 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-10-17 10:22:00,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:22:00 BoogieIcfgContainer [2022-10-17 10:22:00,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 10:22:00,623 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-10-17 10:22:00,624 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-10-17 10:22:00,629 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-10-17 10:22:00,630 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-10-17 10:22:00,630 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.10 10:21:59" (1/3) ... [2022-10-17 10:22:00,632 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@666fa35d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.10 10:22:00, skipping insertion in model container [2022-10-17 10:22:00,632 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-10-17 10:22:00,632 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:21:59" (2/3) ... [2022-10-17 10:22:00,633 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@666fa35d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.10 10:22:00, skipping insertion in model container [2022-10-17 10:22:00,633 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-10-17 10:22:00,633 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:22:00" (3/3) ... [2022-10-17 10:22:00,635 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c [2022-10-17 10:22:00,709 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-10-17 10:22:00,709 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-10-17 10:22:00,709 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-10-17 10:22:00,709 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-10-17 10:22:00,710 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-10-17 10:22:00,710 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-10-17 10:22:00,710 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-10-17 10:22:00,710 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-10-17 10:22:00,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 94 states, 93 states have (on average 1.7096774193548387) internal successors, (159), 93 states have internal predecessors, (159), 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-10-17 10:22:00,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 53 [2022-10-17 10:22:00,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:22:00,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:22:00,751 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:22:00,755 INFO L149 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] [2022-10-17 10:22:00,757 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-10-17 10:22:00,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 94 states, 93 states have (on average 1.7096774193548387) internal successors, (159), 93 states have internal predecessors, (159), 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-10-17 10:22:00,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 53 [2022-10-17 10:22:00,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:22:00,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:22:00,771 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:22:00,772 INFO L149 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] [2022-10-17 10:22:00,782 INFO L748 eck$LassoCheckResult]: Stem: 74#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; 61#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~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~ret30#1, main_#t~ret31#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~nondet9#1;havoc main_#t~nondet9#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 72#L199true assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 94#L199-1true init_#res#1 := init_~tmp~0#1; 21#L324true main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#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; 67#L22true assume !(0 == assume_abort_if_not_~cond#1); 44#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;main_~i2~0#1 := 0; 47#L396-2true [2022-10-17 10:22:00,784 INFO L750 eck$LassoCheckResult]: Loop: 47#L396-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; 5#L71true assume !(0 != ~mode1~0 % 256); 40#L88true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 19#L88-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; 84#L71-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; 78#L100true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 73#L103true assume !(node2_~m2~0#1 != ~nomsg~0); 66#L103-1true ~mode2~0 := 0; 48#L100-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; 29#L125true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 77#L128true assume !(node3_~m3~0#1 != ~nomsg~0); 30#L128-1true ~mode3~0 := 0; 15#L125-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; 46#L150true assume !(0 != ~mode4~0 % 256); 75#L163true assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 71#L163-2true ~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; 31#L150-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; 3#L175true assume !(0 != ~mode5~0 % 256); 22#L188true assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 10#L188-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; 8#L175-2true assume { :end_inline_node5 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 42#L332true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; 56#L332-1true check_#res#1 := check_~tmp~1#1; 52#L352true main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; 59#L425true assume !(0 == assert_~arg#1 % 256); 54#L420true assume { :end_inline_assert } true; 47#L396-2true [2022-10-17 10:22:00,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:22:00,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1978587388, now seen corresponding path program 1 times [2022-10-17 10:22:00,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:22:00,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796252749] [2022-10-17 10:22:00,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:22:00,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:22:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:22:01,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:22:01,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:22:01,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796252749] [2022-10-17 10:22:01,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796252749] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:22:01,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:22:01,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-17 10:22:01,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767520877] [2022-10-17 10:22:01,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:22:01,137 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-10-17 10:22:01,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:22:01,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1980967203, now seen corresponding path program 1 times [2022-10-17 10:22:01,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:22:01,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418686081] [2022-10-17 10:22:01,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:22:01,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:22:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:22:01,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:22:01,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:22:01,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418686081] [2022-10-17 10:22:01,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418686081] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:22:01,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:22:01,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-17 10:22:01,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632411546] [2022-10-17 10:22:01,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:22:01,598 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-10-17 10:22:01,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:22:01,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 10:22:01,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-17 10:22:01,638 INFO L87 Difference]: Start difference. First operand has 94 states, 93 states have (on average 1.7096774193548387) internal successors, (159), 93 states have internal predecessors, (159), 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-10-17 10:22:01,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:22:01,753 INFO L93 Difference]: Finished difference Result 93 states and 154 transitions. [2022-10-17 10:22:01,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 154 transitions. [2022-10-17 10:22:01,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2022-10-17 10:22:01,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 89 states and 120 transitions. [2022-10-17 10:22:01,769 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2022-10-17 10:22:01,770 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2022-10-17 10:22:01,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 120 transitions. [2022-10-17 10:22:01,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:22:01,772 INFO L218 hiAutomatonCegarLoop]: Abstraction has 89 states and 120 transitions. [2022-10-17 10:22:01,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 120 transitions. [2022-10-17 10:22:01,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-10-17 10:22:01,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.348314606741573) internal successors, (120), 88 states have internal predecessors, (120), 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-10-17 10:22:01,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2022-10-17 10:22:01,811 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 120 transitions. [2022-10-17 10:22:01,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 10:22:01,817 INFO L428 stractBuchiCegarLoop]: Abstraction has 89 states and 120 transitions. [2022-10-17 10:22:01,817 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-10-17 10:22:01,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 120 transitions. [2022-10-17 10:22:01,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2022-10-17 10:22:01,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:22:01,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:22:01,826 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:22:01,826 INFO L149 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] [2022-10-17 10:22:01,827 INFO L748 eck$LassoCheckResult]: Stem: 288#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; 279#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~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~ret30#1, main_#t~ret31#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~nondet9#1;havoc main_#t~nondet9#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 280#L199 assume 0 == ~r1~0 % 256; 274#L200 assume ~id1~0 >= 0; 275#L201 assume 0 == ~st1~0; 249#L202 assume ~send1~0 == ~id1~0; 250#L203 assume 0 == ~mode1~0 % 256; 264#L204 assume ~id2~0 >= 0; 224#L205 assume 0 == ~st2~0; 225#L206 assume ~send2~0 == ~id2~0; 208#L207 assume 0 == ~mode2~0 % 256; 209#L208 assume ~id3~0 >= 0; 278#L209 assume 0 == ~st3~0; 226#L210 assume ~send3~0 == ~id3~0; 227#L211 assume 0 == ~mode3~0 % 256; 210#L212 assume ~id4~0 >= 0; 211#L213 assume 0 == ~st4~0; 290#L214 assume ~send4~0 == ~id4~0; 291#L215 assume 0 == ~mode4~0 % 256; 277#L216 assume ~id5~0 >= 0; 257#L217 assume 0 == ~st5~0; 258#L218 assume ~send5~0 == ~id5~0; 281#L219 assume 0 == ~mode5~0 % 256; 292#L220 assume ~id1~0 != ~id2~0; 245#L221 assume ~id1~0 != ~id3~0; 242#L222 assume ~id1~0 != ~id4~0; 243#L223 assume ~id1~0 != ~id5~0; 236#L224 assume ~id2~0 != ~id3~0; 237#L225 assume ~id2~0 != ~id4~0; 233#L226 assume ~id2~0 != ~id5~0; 234#L227 assume ~id3~0 != ~id4~0; 251#L228 assume ~id3~0 != ~id5~0; 252#L229 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 293#L199-1 init_#res#1 := init_~tmp~0#1; 240#L324 main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#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; 241#L22 assume !(0 == assume_abort_if_not_~cond#1); 265#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;main_~i2~0#1 := 0; 266#L396-2 [2022-10-17 10:22:01,828 INFO L750 eck$LassoCheckResult]: Loop: 266#L396-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; 212#L71 assume !(0 != ~mode1~0 % 256); 214#L88 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 238#L88-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; 239#L71-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; 289#L100 assume !(0 != ~mode2~0 % 256); 282#L113 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 283#L113-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; 270#L100-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; 253#L125 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 254#L128 assume !(node3_~m3~0#1 != ~nomsg~0); 256#L128-1 ~mode3~0 := 0; 231#L125-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; 232#L150 assume !(0 != ~mode4~0 % 256); 269#L163 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 286#L163-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; 244#L150-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; 205#L175 assume !(0 != ~mode5~0 % 256); 206#L188 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 221#L188-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; 217#L175-2 assume { :end_inline_node5 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 218#L332 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; 229#L332-1 check_#res#1 := check_~tmp~1#1; 272#L352 main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; 273#L425 assume !(0 == assert_~arg#1 % 256); 276#L420 assume { :end_inline_assert } true; 266#L396-2 [2022-10-17 10:22:01,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:22:01,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 1 times [2022-10-17 10:22:01,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:22:01,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140800337] [2022-10-17 10:22:01,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:22:01,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:22:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:22:01,869 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:22:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:22:01,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:22:01,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:22:01,956 INFO L85 PathProgramCache]: Analyzing trace with hash 40936345, now seen corresponding path program 1 times [2022-10-17 10:22:01,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:22:01,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698924318] [2022-10-17 10:22:01,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:22:01,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:22:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:22:02,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:22:02,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:22:02,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698924318] [2022-10-17 10:22:02,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698924318] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:22:02,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:22:02,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-17 10:22:02,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992789648] [2022-10-17 10:22:02,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:22:02,202 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-10-17 10:22:02,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:22:02,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 10:22:02,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-17 10:22:02,204 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. cyclomatic complexity: 32 Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-10-17 10:22:02,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:22:02,269 INFO L93 Difference]: Finished difference Result 92 states and 122 transitions. [2022-10-17 10:22:02,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 122 transitions. [2022-10-17 10:22:02,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2022-10-17 10:22:02,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 89 states and 117 transitions. [2022-10-17 10:22:02,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2022-10-17 10:22:02,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 89 [2022-10-17 10:22:02,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 117 transitions. [2022-10-17 10:22:02,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:22:02,283 INFO L218 hiAutomatonCegarLoop]: Abstraction has 89 states and 117 transitions. [2022-10-17 10:22:02,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 117 transitions. [2022-10-17 10:22:02,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-10-17 10:22:02,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.3146067415730338) internal successors, (117), 88 states have internal predecessors, (117), 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-10-17 10:22:02,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 117 transitions. [2022-10-17 10:22:02,302 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 117 transitions. [2022-10-17 10:22:02,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 10:22:02,307 INFO L428 stractBuchiCegarLoop]: Abstraction has 89 states and 117 transitions. [2022-10-17 10:22:02,307 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-10-17 10:22:02,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 117 transitions. [2022-10-17 10:22:02,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2022-10-17 10:22:02,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:22:02,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:22:02,315 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:22:02,317 INFO L149 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] [2022-10-17 10:22:02,318 INFO L748 eck$LassoCheckResult]: Stem: 481#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; 472#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~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~ret30#1, main_#t~ret31#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~nondet9#1;havoc main_#t~nondet9#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 473#L199 assume 0 == ~r1~0 % 256; 467#L200 assume ~id1~0 >= 0; 468#L201 assume 0 == ~st1~0; 439#L202 assume ~send1~0 == ~id1~0; 440#L203 assume 0 == ~mode1~0 % 256; 456#L204 assume ~id2~0 >= 0; 415#L205 assume 0 == ~st2~0; 416#L206 assume ~send2~0 == ~id2~0; 401#L207 assume 0 == ~mode2~0 % 256; 402#L208 assume ~id3~0 >= 0; 471#L209 assume 0 == ~st3~0; 422#L210 assume ~send3~0 == ~id3~0; 423#L211 assume 0 == ~mode3~0 % 256; 403#L212 assume ~id4~0 >= 0; 404#L213 assume 0 == ~st4~0; 483#L214 assume ~send4~0 == ~id4~0; 484#L215 assume 0 == ~mode4~0 % 256; 470#L216 assume ~id5~0 >= 0; 450#L217 assume 0 == ~st5~0; 451#L218 assume ~send5~0 == ~id5~0; 474#L219 assume 0 == ~mode5~0 % 256; 485#L220 assume ~id1~0 != ~id2~0; 438#L221 assume ~id1~0 != ~id3~0; 435#L222 assume ~id1~0 != ~id4~0; 436#L223 assume ~id1~0 != ~id5~0; 429#L224 assume ~id2~0 != ~id3~0; 430#L225 assume ~id2~0 != ~id4~0; 426#L226 assume ~id2~0 != ~id5~0; 427#L227 assume ~id3~0 != ~id4~0; 444#L228 assume ~id3~0 != ~id5~0; 445#L229 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 486#L199-1 init_#res#1 := init_~tmp~0#1; 433#L324 main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#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; 434#L22 assume !(0 == assume_abort_if_not_~cond#1); 458#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;main_~i2~0#1 := 0; 459#L396-2 [2022-10-17 10:22:02,318 INFO L750 eck$LassoCheckResult]: Loop: 459#L396-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; 405#L71 assume !(0 != ~mode1~0 % 256); 407#L88 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 431#L88-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; 432#L71-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; 482#L100 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 480#L103 assume !(node2_~m2~0#1 != ~nomsg~0); 442#L103-1 ~mode2~0 := 0; 463#L100-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; 446#L125 assume !(0 != ~mode3~0 % 256); 448#L138 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 455#L138-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; 424#L125-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; 425#L150 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 417#L153 assume !(node4_~m4~0#1 != ~nomsg~0); 409#L153-1 ~mode4~0 := 0; 437#L150-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; 398#L175 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 400#L178 assume !(node5_~m5~0#1 != ~nomsg~0); 461#L178-1 ~mode5~0 := 0; 410#L175-2 assume { :end_inline_node5 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 411#L332 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 457#L333 assume ~r1~0 % 256 >= 5; 419#L337 assume ~r1~0 % 256 < 5;check_~tmp~1#1 := 1; 420#L332-1 check_#res#1 := check_~tmp~1#1; 465#L352 main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; 466#L425 assume !(0 == assert_~arg#1 % 256); 469#L420 assume { :end_inline_assert } true; 459#L396-2 [2022-10-17 10:22:02,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:22:02,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 2 times [2022-10-17 10:22:02,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:22:02,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664558382] [2022-10-17 10:22:02,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:22:02,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:22:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:22:02,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:22:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:22:02,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:22:02,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:22:02,401 INFO L85 PathProgramCache]: Analyzing trace with hash 364338877, now seen corresponding path program 1 times [2022-10-17 10:22:02,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:22:02,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115819489] [2022-10-17 10:22:02,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:22:02,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:22:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:22:02,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:22:02,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:22:02,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115819489] [2022-10-17 10:22:02,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115819489] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:22:02,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:22:02,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:22:02,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538663243] [2022-10-17 10:22:02,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:22:02,435 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-10-17 10:22:02,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:22:02,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:22:02,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:22:02,437 INFO L87 Difference]: Start difference. First operand 89 states and 117 transitions. cyclomatic complexity: 29 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-10-17 10:22:02,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:22:02,478 INFO L93 Difference]: Finished difference Result 135 states and 186 transitions. [2022-10-17 10:22:02,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 186 transitions. [2022-10-17 10:22:02,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 98 [2022-10-17 10:22:02,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 135 states and 186 transitions. [2022-10-17 10:22:02,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 135 [2022-10-17 10:22:02,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2022-10-17 10:22:02,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 186 transitions. [2022-10-17 10:22:02,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:22:02,497 INFO L218 hiAutomatonCegarLoop]: Abstraction has 135 states and 186 transitions. [2022-10-17 10:22:02,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 186 transitions. [2022-10-17 10:22:02,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2022-10-17 10:22:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 133 states have (on average 1.3759398496240602) internal successors, (183), 132 states have internal predecessors, (183), 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-10-17 10:22:02,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 183 transitions. [2022-10-17 10:22:02,506 INFO L240 hiAutomatonCegarLoop]: Abstraction has 133 states and 183 transitions. [2022-10-17 10:22:02,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:22:02,512 INFO L428 stractBuchiCegarLoop]: Abstraction has 133 states and 183 transitions. [2022-10-17 10:22:02,513 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-10-17 10:22:02,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 183 transitions. [2022-10-17 10:22:02,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2022-10-17 10:22:02,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-10-17 10:22:02,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-10-17 10:22:02,522 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:22:02,522 INFO L149 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] [2022-10-17 10:22:02,523 INFO L748 eck$LassoCheckResult]: Stem: 714#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; 705#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~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~ret30#1, main_#t~ret31#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~nondet9#1;havoc main_#t~nondet9#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 706#L199 assume 0 == ~r1~0 % 256; 700#L200 assume ~id1~0 >= 0; 701#L201 assume 0 == ~st1~0; 672#L202 assume ~send1~0 == ~id1~0; 673#L203 assume 0 == ~mode1~0 % 256; 689#L204 assume ~id2~0 >= 0; 647#L205 assume 0 == ~st2~0; 648#L206 assume ~send2~0 == ~id2~0; 631#L207 assume 0 == ~mode2~0 % 256; 632#L208 assume ~id3~0 >= 0; 704#L209 assume 0 == ~st3~0; 651#L210 assume ~send3~0 == ~id3~0; 652#L211 assume 0 == ~mode3~0 % 256; 640#L212 assume ~id4~0 >= 0; 641#L213 assume 0 == ~st4~0; 718#L214 assume ~send4~0 == ~id4~0; 719#L215 assume 0 == ~mode4~0 % 256; 703#L216 assume ~id5~0 >= 0; 680#L217 assume 0 == ~st5~0; 681#L218 assume ~send5~0 == ~id5~0; 707#L219 assume 0 == ~mode5~0 % 256; 720#L220 assume ~id1~0 != ~id2~0; 668#L221 assume ~id1~0 != ~id3~0; 665#L222 assume ~id1~0 != ~id4~0; 666#L223 assume ~id1~0 != ~id5~0; 659#L224 assume ~id2~0 != ~id3~0; 660#L225 assume ~id2~0 != ~id4~0; 655#L226 assume ~id2~0 != ~id5~0; 656#L227 assume ~id3~0 != ~id4~0; 674#L228 assume ~id3~0 != ~id5~0; 675#L229 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 721#L199-1 init_#res#1 := init_~tmp~0#1; 663#L324 main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#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; 664#L22 assume !(0 == assume_abort_if_not_~cond#1); 690#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;main_~i2~0#1 := 0; 691#L396-2 [2022-10-17 10:22:02,523 INFO L750 eck$LassoCheckResult]: Loop: 691#L396-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; 754#L71 assume !(0 != ~mode1~0 % 256); 753#L88 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 752#L88-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; 685#L71-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; 750#L100 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 749#L103 assume !(node2_~m2~0#1 != ~nomsg~0); 746#L103-1 ~mode2~0 := 0; 744#L100-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; 743#L125 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 741#L128 assume !(node3_~m3~0#1 != ~nomsg~0); 738#L128-1 ~mode3~0 := 0; 736#L125-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; 735#L150 assume !(0 != ~mode4~0 % 256); 715#L163 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 716#L163-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; 730#L150-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; 728#L175 assume !(0 != ~mode5~0 % 256); 727#L188 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; 725#L188-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; 724#L175-2 assume { :end_inline_node5 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 723#L332 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 722#L333 assume !(~r1~0 % 256 >= 5); 657#L336 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; 658#L337 assume ~r1~0 % 256 < 5;check_~tmp~1#1 := 1; 760#L332-1 check_#res#1 := check_~tmp~1#1; 757#L352 main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; 756#L425 assume !(0 == assert_~arg#1 % 256); 755#L420 assume { :end_inline_assert } true; 691#L396-2 [2022-10-17 10:22:02,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:22:02,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 3 times [2022-10-17 10:22:02,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:22:02,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210139357] [2022-10-17 10:22:02,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:22:02,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:22:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:22:02,555 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:22:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:22:02,598 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:22:02,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:22:02,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1445795707, now seen corresponding path program 1 times [2022-10-17 10:22:02,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:22:02,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802536061] [2022-10-17 10:22:02,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:22:02,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:22:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:22:02,625 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:22:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:22:02,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:22:02,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:22:02,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1050041683, now seen corresponding path program 1 times [2022-10-17 10:22:02,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:22:02,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152838987] [2022-10-17 10:22:02,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:22:02,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:22:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:22:02,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:22:02,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:22:02,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152838987] [2022-10-17 10:22:02,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152838987] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:22:02,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:22:02,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-17 10:22:02,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346473807] [2022-10-17 10:22:02,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:22:04,256 INFO L210 LassoAnalysis]: Preferences: [2022-10-17 10:22:04,257 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-10-17 10:22:04,257 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-10-17 10:22:04,257 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-10-17 10:22:04,258 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-10-17 10:22:04,258 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-10-17 10:22:04,258 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-10-17 10:22:04,258 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-10-17 10:22:04,258 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2022-10-17 10:22:04,258 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-10-17 10:22:04,259 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-10-17 10:22:04,286 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:04,300 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:04,303 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:04,309 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:04,313 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:04,316 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:04,580 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:04,587 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:04,590 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:04,593 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:04,599 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:04,603 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:04,609 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:04,612 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:04,619 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:04,623 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:05,377 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2022-10-17 10:22:32,615 WARN L233 SmtUtils]: Spent 27.10s on a formula simplification. DAG size of input: 338 DAG size of output: 186 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2022-10-17 10:22:32,784 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-10-17 10:22:32,785 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-10-17 10:22:32,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-10-17 10:22:32,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c957cf40-7638-4023-8e3b-aa09fed7765c/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:22:32,793 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c957cf40-7638-4023-8e3b-aa09fed7765c/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-10-17 10:22:32,798 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-10-17 10:22:32,798 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-10-17 10:22:32,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c957cf40-7638-4023-8e3b-aa09fed7765c/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-10-17 10:22:32,894 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c957cf40-7638-4023-8e3b-aa09fed7765c/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-10-17 10:22:32,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-10-17 10:22:32,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c957cf40-7638-4023-8e3b-aa09fed7765c/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:22:32,895 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c957cf40-7638-4023-8e3b-aa09fed7765c/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-10-17 10:22:32,905 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-10-17 10:22:32,906 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-10-17 10:22:32,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c957cf40-7638-4023-8e3b-aa09fed7765c/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-10-17 10:22:33,216 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-10-17 10:22:33,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c957cf40-7638-4023-8e3b-aa09fed7765c/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-10-17 10:22:33,224 INFO L210 LassoAnalysis]: Preferences: [2022-10-17 10:22:33,224 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-10-17 10:22:33,224 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-10-17 10:22:33,224 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-10-17 10:22:33,224 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-10-17 10:22:33,224 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-10-17 10:22:33,224 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-10-17 10:22:33,225 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-10-17 10:22:33,225 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2022-10-17 10:22:33,225 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-10-17 10:22:33,225 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-10-17 10:22:33,234 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:33,240 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:33,245 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:33,248 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:33,251 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:33,253 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:33,255 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:33,260 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:33,501 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:33,504 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:33,510 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:33,515 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:33,518 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:33,520 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:33,525 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:33,528 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-10-17 10:22:34,182 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9