./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89c3e5a-bb48-4de9-a442-5f384294876e/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89c3e5a-bb48-4de9-a442-5f384294876e/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89c3e5a-bb48-4de9-a442-5f384294876e/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89c3e5a-bb48-4de9-a442-5f384294876e/bin/uautomizer-QkZJyEgLgS/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89c3e5a-bb48-4de9-a442-5f384294876e/bin/uautomizer-QkZJyEgLgS/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89c3e5a-bb48-4de9-a442-5f384294876e/bin/uautomizer-QkZJyEgLgS --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 5d3b64744a19af136ca9c439b2264a15465f658e2e3d4a576a98d96e4b8aff92 --- 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-4e7fbc6 [2022-11-23 01:59:52,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 01:59:52,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 01:59:52,183 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 01:59:52,184 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 01:59:52,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 01:59:52,186 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 01:59:52,189 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 01:59:52,191 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 01:59:52,192 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 01:59:52,194 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 01:59:52,195 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 01:59:52,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 01:59:52,197 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 01:59:52,199 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 01:59:52,200 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 01:59:52,202 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 01:59:52,203 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 01:59:52,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 01:59:52,207 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 01:59:52,209 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 01:59:52,211 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 01:59:52,212 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 01:59:52,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 01:59:52,223 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 01:59:52,224 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 01:59:52,224 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 01:59:52,225 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 01:59:52,232 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 01:59:52,233 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 01:59:52,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 01:59:52,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 01:59:52,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 01:59:52,236 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 01:59:52,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 01:59:52,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 01:59:52,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 01:59:52,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 01:59:52,243 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 01:59:52,244 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 01:59:52,247 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 01:59:52,248 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89c3e5a-bb48-4de9-a442-5f384294876e/bin/uautomizer-QkZJyEgLgS/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-23 01:59:52,289 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 01:59:52,293 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 01:59:52,294 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 01:59:52,294 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 01:59:52,296 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 01:59:52,296 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 01:59:52,297 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 01:59:52,297 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-23 01:59:52,297 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-23 01:59:52,297 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-23 01:59:52,299 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-23 01:59:52,299 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-23 01:59:52,299 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-23 01:59:52,300 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 01:59:52,300 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 01:59:52,300 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 01:59:52,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 01:59:52,301 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 01:59:52,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 01:59:52,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-23 01:59:52,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-23 01:59:52,302 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-23 01:59:52,302 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 01:59:52,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 01:59:52,302 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-23 01:59:52,303 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 01:59:52,303 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-23 01:59:52,303 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 01:59:52,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 01:59:52,304 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 01:59:52,304 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 01:59:52,307 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-23 01:59:52,307 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_e89c3e5a-bb48-4de9-a442-5f384294876e/bin/uautomizer-QkZJyEgLgS/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_e89c3e5a-bb48-4de9-a442-5f384294876e/bin/uautomizer-QkZJyEgLgS 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 -> 5d3b64744a19af136ca9c439b2264a15465f658e2e3d4a576a98d96e4b8aff92 [2022-11-23 01:59:52,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 01:59:52,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 01:59:52,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 01:59:52,724 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 01:59:52,725 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 01:59:52,726 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89c3e5a-bb48-4de9-a442-5f384294876e/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c [2022-11-23 01:59:56,331 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 01:59:56,616 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 01:59:56,617 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89c3e5a-bb48-4de9-a442-5f384294876e/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c [2022-11-23 01:59:56,626 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89c3e5a-bb48-4de9-a442-5f384294876e/bin/uautomizer-QkZJyEgLgS/data/b389ba633/466ba24318944a0b90eedb228ab23b7e/FLAG3aea9933e [2022-11-23 01:59:56,643 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89c3e5a-bb48-4de9-a442-5f384294876e/bin/uautomizer-QkZJyEgLgS/data/b389ba633/466ba24318944a0b90eedb228ab23b7e [2022-11-23 01:59:56,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 01:59:56,648 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 01:59:56,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 01:59:56,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 01:59:56,653 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 01:59:56,654 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:59:56" (1/1) ... [2022-11-23 01:59:56,656 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b5a440b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:56, skipping insertion in model container [2022-11-23 01:59:56,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:59:56" (1/1) ... [2022-11-23 01:59:56,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 01:59:56,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 01:59:56,934 WARN L237 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_e89c3e5a-bb48-4de9-a442-5f384294876e/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c[8246,8259] [2022-11-23 01:59:56,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 01:59:56,951 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 01:59:57,005 WARN L237 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_e89c3e5a-bb48-4de9-a442-5f384294876e/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c[8246,8259] [2022-11-23 01:59:57,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 01:59:57,025 INFO L208 MainTranslator]: Completed translation [2022-11-23 01:59:57,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:57 WrapperNode [2022-11-23 01:59:57,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 01:59:57,027 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 01:59:57,028 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 01:59:57,028 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 01:59:57,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:57" (1/1) ... [2022-11-23 01:59:57,050 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:57" (1/1) ... [2022-11-23 01:59:57,083 INFO L138 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 244 [2022-11-23 01:59:57,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 01:59:57,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 01:59:57,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 01:59:57,085 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 01:59:57,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:57" (1/1) ... [2022-11-23 01:59:57,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:57" (1/1) ... [2022-11-23 01:59:57,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:57" (1/1) ... [2022-11-23 01:59:57,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:57" (1/1) ... [2022-11-23 01:59:57,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:57" (1/1) ... [2022-11-23 01:59:57,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:57" (1/1) ... [2022-11-23 01:59:57,117 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:57" (1/1) ... [2022-11-23 01:59:57,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:57" (1/1) ... [2022-11-23 01:59:57,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 01:59:57,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 01:59:57,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 01:59:57,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 01:59:57,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:57" (1/1) ... [2022-11-23 01:59:57,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 01:59:57,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89c3e5a-bb48-4de9-a442-5f384294876e/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 01:59:57,171 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89c3e5a-bb48-4de9-a442-5f384294876e/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-23 01:59:57,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89c3e5a-bb48-4de9-a442-5f384294876e/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-23 01:59:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 01:59:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 01:59:57,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 01:59:57,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 01:59:57,427 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 01:59:57,430 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 01:59:58,017 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 01:59:58,026 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 01:59:58,027 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-23 01:59:58,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:59:58 BoogieIcfgContainer [2022-11-23 01:59:58,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 01:59:58,031 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-23 01:59:58,032 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-23 01:59:58,037 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-23 01:59:58,038 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-23 01:59:58,038 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 01:59:56" (1/3) ... [2022-11-23 01:59:58,040 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3207f3bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:59:58, skipping insertion in model container [2022-11-23 01:59:58,040 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-23 01:59:58,040 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:59:57" (2/3) ... [2022-11-23 01:59:58,041 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3207f3bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:59:58, skipping insertion in model container [2022-11-23 01:59:58,041 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-23 01:59:58,041 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:59:58" (3/3) ... [2022-11-23 01:59:58,048 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c [2022-11-23 01:59:58,132 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-23 01:59:58,133 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-23 01:59:58,133 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-23 01:59:58,133 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-23 01:59:58,133 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-23 01:59:58,134 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-23 01:59:58,134 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-23 01:59:58,135 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-23 01:59:58,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 68 states, 67 states have (on average 1.7164179104477613) internal successors, (115), 67 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:58,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2022-11-23 01:59:58,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 01:59:58,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 01:59:58,194 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:59:58,195 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:59:58,195 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-23 01:59:58,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 68 states, 67 states have (on average 1.7164179104477613) internal successors, (115), 67 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:58,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2022-11-23 01:59:58,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 01:59:58,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 01:59:58,216 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:59:58,216 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:59:58,227 INFO L748 eck$LassoCheckResult]: Stem: 53#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(34, 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; 44#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~post23#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 54#L163true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 22#L163-1true init_#res#1 := init_~tmp~0#1; 52#L256true main_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1; 63#L312true assume !(0 == main_~i2~0#1); 15#L312-2true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 10#L322-2true [2022-11-23 01:59:58,237 INFO L750 eck$LassoCheckResult]: Loop: 10#L322-2true assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 7#L61true assume !(0 != ~mode1~0 % 256);~p1_new~0 := (if (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 <= 127 then (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 else (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 - 256);~mode1~0 := 1; 51#L61-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 8#L89true assume !(0 != ~mode2~0 % 256);~p2_new~0 := (if (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 <= 127 then (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 else (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 - 256);~mode2~0 := 1; 19#L89-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 55#L114true assume !(0 != ~mode3~0 % 256);~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256);~mode3~0 := 1; 45#L114-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 34#L139true assume !(0 != ~mode4~0 % 256);~p4_new~0 := (if (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 <= 127 then (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 else (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 - 256);~mode4~0 := 1; 20#L139-2true assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 64#L264true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 17#L264-1true check_#res#1 := check_~tmp~1#1; 65#L284true main_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret22#1;havoc main_#t~ret22#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; 23#L349true assume !(0 == assert_~arg#1 % 256); 35#L344true assume { :end_inline_assert } true;main_#t~post23#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post23#1;havoc main_#t~post23#1; 10#L322-2true [2022-11-23 01:59:58,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:58,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1932780748, now seen corresponding path program 1 times [2022-11-23 01:59:58,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:59:58,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572407315] [2022-11-23 01:59:58,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:58,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:59:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:58,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:59:58,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:59:58,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572407315] [2022-11-23 01:59:58,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572407315] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:58,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:58,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 01:59:58,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484553302] [2022-11-23 01:59:58,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:58,762 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-23 01:59:58,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:58,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1387092733, now seen corresponding path program 1 times [2022-11-23 01:59:58,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:59:58,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091456244] [2022-11-23 01:59:58,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:58,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:59:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:59,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:59:59,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:59:59,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091456244] [2022-11-23 01:59:59,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091456244] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:59,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:59,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 01:59:59,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309415483] [2022-11-23 01:59:59,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:59,372 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-23 01:59:59,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:59:59,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 01:59:59,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 01:59:59,426 INFO L87 Difference]: Start difference. First operand has 68 states, 67 states have (on average 1.7164179104477613) internal successors, (115), 67 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:59,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 01:59:59,558 INFO L93 Difference]: Finished difference Result 106 states and 170 transitions. [2022-11-23 01:59:59,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 170 transitions. [2022-11-23 01:59:59,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2022-11-23 01:59:59,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 97 states and 139 transitions. [2022-11-23 01:59:59,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2022-11-23 01:59:59,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2022-11-23 01:59:59,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 139 transitions. [2022-11-23 01:59:59,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 01:59:59,585 INFO L218 hiAutomatonCegarLoop]: Abstraction has 97 states and 139 transitions. [2022-11-23 01:59:59,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 139 transitions. [2022-11-23 01:59:59,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 63. [2022-11-23 01:59:59,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 62 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 01:59:59,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 84 transitions. [2022-11-23 01:59:59,622 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 84 transitions. [2022-11-23 01:59:59,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 01:59:59,631 INFO L428 stractBuchiCegarLoop]: Abstraction has 63 states and 84 transitions. [2022-11-23 01:59:59,631 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-23 01:59:59,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 84 transitions. [2022-11-23 01:59:59,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2022-11-23 01:59:59,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 01:59:59,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 01:59:59,640 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] [2022-11-23 01:59:59,641 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 01:59:59,643 INFO L748 eck$LassoCheckResult]: Stem: 251#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(34, 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; 244#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~post23#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 245#L163 assume 0 == ~r1~0; 224#L164 assume ~id1~0 >= 0; 213#L165 assume 0 == ~st1~0; 214#L166 assume ~send1~0 == ~id1~0; 229#L167 assume 0 == ~mode1~0 % 256; 206#L168 assume ~id2~0 >= 0; 207#L169 assume 0 == ~st2~0; 253#L170 assume ~send2~0 == ~id2~0; 248#L171 assume 0 == ~mode2~0 % 256; 246#L172 assume ~id3~0 >= 0; 247#L173 assume 0 == ~st3~0; 252#L174 assume ~send3~0 == ~id3~0; 197#L175 assume 0 == ~mode3~0 % 256; 198#L176 assume ~id4~0 >= 0; 249#L177 assume 0 == ~st4~0; 235#L178 assume ~send4~0 == ~id4~0; 236#L179 assume 0 == ~mode4~0 % 256; 192#L180 assume ~id1~0 != ~id2~0; 193#L181 assume ~id1~0 != ~id3~0; 232#L182 assume ~id1~0 != ~id4~0; 233#L183 assume ~id2~0 != ~id3~0; 218#L184 assume ~id2~0 != ~id4~0; 219#L185 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 225#L163-1 init_#res#1 := init_~tmp~0#1; 226#L256 main_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1; 250#L312 assume !(0 == main_~i2~0#1); 215#L312-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 205#L322-2 [2022-11-23 01:59:59,644 INFO L750 eck$LassoCheckResult]: Loop: 205#L322-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 199#L61 assume !(0 != ~mode1~0 % 256);~p1_new~0 := (if (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 <= 127 then (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 else (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 - 256);~mode1~0 := 1; 201#L61-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 202#L89 assume !(0 != ~mode2~0 % 256);~p2_new~0 := (if (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 <= 127 then (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 else (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 - 256);~mode2~0 := 1; 203#L89-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 222#L114 assume !(0 != ~mode3~0 % 256);~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256);~mode3~0 := 1; 234#L114-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 237#L139 assume !(0 != ~mode4~0 % 256);~p4_new~0 := (if (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 <= 127 then (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 else (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 - 256);~mode4~0 := 1; 212#L139-2 assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 223#L264 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 220#L264-1 check_#res#1 := check_~tmp~1#1; 221#L284 main_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret22#1;havoc main_#t~ret22#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; 227#L349 assume !(0 == assert_~arg#1 % 256); 228#L344 assume { :end_inline_assert } true;main_#t~post23#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post23#1;havoc main_#t~post23#1; 205#L322-2 [2022-11-23 01:59:59,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:59,647 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 1 times [2022-11-23 01:59:59,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:59:59,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217022289] [2022-11-23 01:59:59,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:59,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:59:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:59:59,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 01:59:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 01:59:59,762 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 01:59:59,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 01:59:59,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1387092733, now seen corresponding path program 2 times [2022-11-23 01:59:59,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 01:59:59,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840105706] [2022-11-23 01:59:59,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 01:59:59,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 01:59:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 01:59:59,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 01:59:59,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 01:59:59,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840105706] [2022-11-23 01:59:59,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840105706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 01:59:59,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 01:59:59,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 01:59:59,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056019644] [2022-11-23 01:59:59,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 01:59:59,968 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-23 01:59:59,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 01:59:59,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 01:59:59,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 01:59:59,969 INFO L87 Difference]: Start difference. First operand 63 states and 84 transitions. cyclomatic complexity: 22 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:00:00,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:00:00,079 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2022-11-23 02:00:00,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 86 transitions. [2022-11-23 02:00:00,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2022-11-23 02:00:00,085 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 63 states and 81 transitions. [2022-11-23 02:00:00,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2022-11-23 02:00:00,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2022-11-23 02:00:00,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 81 transitions. [2022-11-23 02:00:00,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:00:00,087 INFO L218 hiAutomatonCegarLoop]: Abstraction has 63 states and 81 transitions. [2022-11-23 02:00:00,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 81 transitions. [2022-11-23 02:00:00,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-23 02:00:00,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 62 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:00:00,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 81 transitions. [2022-11-23 02:00:00,096 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 81 transitions. [2022-11-23 02:00:00,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 02:00:00,098 INFO L428 stractBuchiCegarLoop]: Abstraction has 63 states and 81 transitions. [2022-11-23 02:00:00,098 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-23 02:00:00,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 81 transitions. [2022-11-23 02:00:00,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2022-11-23 02:00:00,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 02:00:00,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 02:00:00,101 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] [2022-11-23 02:00:00,101 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:00:00,101 INFO L748 eck$LassoCheckResult]: Stem: 392#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(34, 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; 385#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~post23#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 386#L163 assume 0 == ~r1~0; 365#L164 assume ~id1~0 >= 0; 354#L165 assume 0 == ~st1~0; 355#L166 assume ~send1~0 == ~id1~0; 370#L167 assume 0 == ~mode1~0 % 256; 347#L168 assume ~id2~0 >= 0; 348#L169 assume 0 == ~st2~0; 394#L170 assume ~send2~0 == ~id2~0; 389#L171 assume 0 == ~mode2~0 % 256; 387#L172 assume ~id3~0 >= 0; 388#L173 assume 0 == ~st3~0; 393#L174 assume ~send3~0 == ~id3~0; 338#L175 assume 0 == ~mode3~0 % 256; 339#L176 assume ~id4~0 >= 0; 390#L177 assume 0 == ~st4~0; 376#L178 assume ~send4~0 == ~id4~0; 377#L179 assume 0 == ~mode4~0 % 256; 333#L180 assume ~id1~0 != ~id2~0; 334#L181 assume ~id1~0 != ~id3~0; 373#L182 assume ~id1~0 != ~id4~0; 374#L183 assume ~id2~0 != ~id3~0; 359#L184 assume ~id2~0 != ~id4~0; 360#L185 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 366#L163-1 init_#res#1 := init_~tmp~0#1; 367#L256 main_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1; 391#L312 assume !(0 == main_~i2~0#1); 356#L312-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 346#L322-2 [2022-11-23 02:00:00,102 INFO L750 eck$LassoCheckResult]: Loop: 346#L322-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 340#L61 assume !(0 != ~mode1~0 % 256);~p1_new~0 := (if (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 <= 127 then (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 else (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 - 256);~mode1~0 := 1; 342#L61-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 343#L89 assume !(0 != ~mode2~0 % 256);~p2_new~0 := (if (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 <= 127 then (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 else (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 - 256);~mode2~0 := 1; 344#L89-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 363#L114 assume !(0 != ~mode3~0 % 256);~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256);~mode3~0 := 1; 375#L114-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 378#L139 assume !(0 != ~mode4~0 % 256);~p4_new~0 := (if (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 <= 127 then (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 else (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 - 256);~mode4~0 := 1; 353#L139-2 assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 364#L264 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 335#L265 assume ~r1~0 >= 4; 336#L269 assume ~r1~0 < 4;check_~tmp~1#1 := 1; 361#L264-1 check_#res#1 := check_~tmp~1#1; 362#L284 main_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret22#1;havoc main_#t~ret22#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; 368#L349 assume !(0 == assert_~arg#1 % 256); 369#L344 assume { :end_inline_assert } true;main_#t~post23#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post23#1;havoc main_#t~post23#1; 346#L322-2 [2022-11-23 02:00:00,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:00:00,103 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 2 times [2022-11-23 02:00:00,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:00:00,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783981602] [2022-11-23 02:00:00,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:00:00,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:00:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:00:00,135 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:00:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:00:00,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 02:00:00,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:00:00,182 INFO L85 PathProgramCache]: Analyzing trace with hash 140432525, now seen corresponding path program 1 times [2022-11-23 02:00:00,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:00:00,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958118579] [2022-11-23 02:00:00,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:00:00,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:00:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:00:00,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:00:00,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:00:00,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958118579] [2022-11-23 02:00:00,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958118579] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:00:00,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:00:00,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:00:00,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169130185] [2022-11-23 02:00:00,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:00:00,239 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-23 02:00:00,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:00:00,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:00:00,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:00:00,243 INFO L87 Difference]: Start difference. First operand 63 states and 81 transitions. cyclomatic complexity: 19 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:00:00,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:00:00,286 INFO L93 Difference]: Finished difference Result 91 states and 122 transitions. [2022-11-23 02:00:00,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 122 transitions. [2022-11-23 02:00:00,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2022-11-23 02:00:00,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 122 transitions. [2022-11-23 02:00:00,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2022-11-23 02:00:00,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2022-11-23 02:00:00,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 122 transitions. [2022-11-23 02:00:00,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-23 02:00:00,299 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 122 transitions. [2022-11-23 02:00:00,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 122 transitions. [2022-11-23 02:00:00,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-11-23 02:00:00,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 90 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:00:00,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 122 transitions. [2022-11-23 02:00:00,319 INFO L240 hiAutomatonCegarLoop]: Abstraction has 91 states and 122 transitions. [2022-11-23 02:00:00,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:00:00,321 INFO L428 stractBuchiCegarLoop]: Abstraction has 91 states and 122 transitions. [2022-11-23 02:00:00,322 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-23 02:00:00,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 122 transitions. [2022-11-23 02:00:00,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2022-11-23 02:00:00,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-23 02:00:00,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-23 02:00:00,327 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] [2022-11-23 02:00:00,328 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:00:00,329 INFO L748 eck$LassoCheckResult]: Stem: 555#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(34, 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; 546#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~post23#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~id2~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id3~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st3~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id4~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st4~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send4~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 547#L163 assume 0 == ~r1~0; 524#L164 assume ~id1~0 >= 0; 513#L165 assume 0 == ~st1~0; 514#L166 assume ~send1~0 == ~id1~0; 529#L167 assume 0 == ~mode1~0 % 256; 506#L168 assume ~id2~0 >= 0; 507#L169 assume 0 == ~st2~0; 557#L170 assume ~send2~0 == ~id2~0; 550#L171 assume 0 == ~mode2~0 % 256; 548#L172 assume ~id3~0 >= 0; 549#L173 assume 0 == ~st3~0; 556#L174 assume ~send3~0 == ~id3~0; 497#L175 assume 0 == ~mode3~0 % 256; 498#L176 assume ~id4~0 >= 0; 551#L177 assume 0 == ~st4~0; 537#L178 assume ~send4~0 == ~id4~0; 538#L179 assume 0 == ~mode4~0 % 256; 493#L180 assume ~id1~0 != ~id2~0; 494#L181 assume ~id1~0 != ~id3~0; 534#L182 assume ~id1~0 != ~id4~0; 535#L183 assume ~id2~0 != ~id3~0; 518#L184 assume ~id2~0 != ~id4~0; 519#L185 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 525#L163-1 init_#res#1 := init_~tmp~0#1; 526#L256 main_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1; 554#L312 assume !(0 == main_~i2~0#1); 515#L312-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 505#L322-2 [2022-11-23 02:00:00,329 INFO L750 eck$LassoCheckResult]: Loop: 505#L322-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 499#L61 assume !(0 != ~mode1~0 % 256);~p1_new~0 := (if (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 <= 127 then (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 else (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 - 256);~mode1~0 := 1; 501#L61-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 502#L89 assume !(0 != ~mode2~0 % 256);~p2_new~0 := (if (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 <= 127 then (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 else (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 - 256);~mode2~0 := 1; 503#L89-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 522#L114 assume !(0 != ~mode3~0 % 256);~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256);~mode3~0 := 1; 536#L114-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 539#L139 assume !(0 != ~mode4~0 % 256);~p4_new~0 := (if (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 <= 127 then (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 else (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 - 256);~mode4~0 := 1; 512#L139-2 assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 523#L264 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 560#L265 assume !(~r1~0 >= 4); 531#L268 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 532#L269 assume ~r1~0 < 4;check_~tmp~1#1 := 1; 520#L264-1 check_#res#1 := check_~tmp~1#1; 521#L284 main_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret22#1;havoc main_#t~ret22#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; 527#L349 assume !(0 == assert_~arg#1 % 256); 528#L344 assume { :end_inline_assert } true;main_#t~post23#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post23#1;havoc main_#t~post23#1; 505#L322-2 [2022-11-23 02:00:00,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:00:00,330 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 3 times [2022-11-23 02:00:00,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:00:00,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17319464] [2022-11-23 02:00:00,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:00:00,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:00:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:00:00,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:00:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:00:00,376 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 02:00:00,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:00:00,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1705012855, now seen corresponding path program 1 times [2022-11-23 02:00:00,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:00:00,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908659864] [2022-11-23 02:00:00,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:00:00,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:00:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:00:00,406 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:00:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:00:00,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 02:00:00,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:00:00,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1742065361, now seen corresponding path program 1 times [2022-11-23 02:00:00,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:00:00,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271439354] [2022-11-23 02:00:00,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:00:00,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:00:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:00:00,477 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 02:00:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 02:00:00,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-23 02:00:04,396 INFO L210 LassoAnalysis]: Preferences: [2022-11-23 02:00:04,397 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-23 02:00:04,397 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-23 02:00:04,397 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-23 02:00:04,398 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-23 02:00:04,398 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-23 02:00:04,398 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-23 02:00:04,398 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-23 02:00:04,398 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4.1.ufo.BOUNDED-8.pals.c_Iteration4_Loop [2022-11-23 02:00:04,398 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-23 02:00:04,399 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-23 02:00:04,446 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 02:00:04,460 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 02:00:04,466 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 02:00:04,470 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 02:00:04,472 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 02:00:04,474 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 02:00:04,479 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 02:00:06,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-11-23 02:00:06,262 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 02:00:06,267 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 02:00:06,275 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 02:00:06,283 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-23 02:00:08,162 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 24