./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55cc95d1-1f63-42da-92a7-cfc578f3907f/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55cc95d1-1f63-42da-92a7-cfc578f3907f/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55cc95d1-1f63-42da-92a7-cfc578f3907f/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55cc95d1-1f63-42da-92a7-cfc578f3907f/bin/uautomizer-tPACEb0tL8/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55cc95d1-1f63-42da-92a7-cfc578f3907f/bin/uautomizer-tPACEb0tL8/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55cc95d1-1f63-42da-92a7-cfc578f3907f/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6994f5bfaf30a704120445031d2592cb0b289806736d22478b28cc84ed2b2216 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:29:59,010 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:29:59,014 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:29:59,039 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:29:59,040 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:29:59,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:29:59,042 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:29:59,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:29:59,046 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:29:59,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:29:59,047 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:29:59,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:29:59,049 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:29:59,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:29:59,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:29:59,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:29:59,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:29:59,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:29:59,056 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:29:59,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:29:59,059 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:29:59,061 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:29:59,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:29:59,067 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:29:59,071 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:29:59,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:29:59,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:29:59,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:29:59,076 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:29:59,077 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:29:59,078 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:29:59,079 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:29:59,080 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:29:59,082 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:29:59,083 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:29:59,084 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:29:59,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:29:59,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:29:59,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:29:59,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:29:59,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:29:59,088 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55cc95d1-1f63-42da-92a7-cfc578f3907f/bin/uautomizer-tPACEb0tL8/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-16 11:29:59,128 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:29:59,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:29:59,129 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:29:59,129 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:29:59,130 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:29:59,130 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:29:59,131 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:29:59,131 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-16 11:29:59,131 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-16 11:29:59,131 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-16 11:29:59,132 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-16 11:29:59,133 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-16 11:29:59,133 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-16 11:29:59,133 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:29:59,133 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:29:59,133 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:29:59,134 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:29:59,134 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:29:59,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:29:59,134 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-16 11:29:59,134 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-16 11:29:59,135 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-16 11:29:59,135 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:29:59,137 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:29:59,137 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-16 11:29:59,137 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:29:59,137 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-16 11:29:59,137 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:29:59,138 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:29:59,138 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:29:59,138 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:29:59,140 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-16 11:29:59,140 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_55cc95d1-1f63-42da-92a7-cfc578f3907f/bin/uautomizer-tPACEb0tL8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55cc95d1-1f63-42da-92a7-cfc578f3907f/bin/uautomizer-tPACEb0tL8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6994f5bfaf30a704120445031d2592cb0b289806736d22478b28cc84ed2b2216 [2022-11-16 11:29:59,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:29:59,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:29:59,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:29:59,446 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:29:59,447 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:29:59,448 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55cc95d1-1f63-42da-92a7-cfc578f3907f/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c [2022-11-16 11:29:59,523 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55cc95d1-1f63-42da-92a7-cfc578f3907f/bin/uautomizer-tPACEb0tL8/data/194b228b0/b8ce470b890a4a5a84a7fee86b5abb01/FLAG87ef0ecb9 [2022-11-16 11:29:59,981 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:29:59,982 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55cc95d1-1f63-42da-92a7-cfc578f3907f/sv-benchmarks/c/seq-mthreaded/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c [2022-11-16 11:29:59,996 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55cc95d1-1f63-42da-92a7-cfc578f3907f/bin/uautomizer-tPACEb0tL8/data/194b228b0/b8ce470b890a4a5a84a7fee86b5abb01/FLAG87ef0ecb9 [2022-11-16 11:30:00,346 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55cc95d1-1f63-42da-92a7-cfc578f3907f/bin/uautomizer-tPACEb0tL8/data/194b228b0/b8ce470b890a4a5a84a7fee86b5abb01 [2022-11-16 11:30:00,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:30:00,350 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:30:00,351 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:30:00,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:30:00,355 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:30:00,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:30:00" (1/1) ... [2022-11-16 11:30:00,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e926537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:30:00, skipping insertion in model container [2022-11-16 11:30:00,358 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:30:00" (1/1) ... [2022-11-16 11:30:00,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:30:00,397 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:30:00,628 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55cc95d1-1f63-42da-92a7-cfc578f3907f/sv-benchmarks/c/seq-mthreaded/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c[11335,11348] [2022-11-16 11:30:00,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:30:00,647 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:30:00,710 WARN L229 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55cc95d1-1f63-42da-92a7-cfc578f3907f/sv-benchmarks/c/seq-mthreaded/pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c[11335,11348] [2022-11-16 11:30:00,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:30:00,727 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:30:00,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:30:00 WrapperNode [2022-11-16 11:30:00,728 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:30:00,729 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:30:00,729 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:30:00,729 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:30:00,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:30:00" (1/1) ... [2022-11-16 11:30:00,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:30:00" (1/1) ... [2022-11-16 11:30:00,783 INFO L138 Inliner]: procedures = 25, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 292 [2022-11-16 11:30:00,785 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:30:00,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:30:00,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:30:00,787 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:30:00,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:30:00" (1/1) ... [2022-11-16 11:30:00,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:30:00" (1/1) ... [2022-11-16 11:30:00,815 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:30:00" (1/1) ... [2022-11-16 11:30:00,815 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:30:00" (1/1) ... [2022-11-16 11:30:00,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:30:00" (1/1) ... [2022-11-16 11:30:00,832 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:30:00" (1/1) ... [2022-11-16 11:30:00,834 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:30:00" (1/1) ... [2022-11-16 11:30:00,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:30:00" (1/1) ... [2022-11-16 11:30:00,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:30:00,840 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:30:00,840 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:30:00,840 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:30:00,841 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:30:00" (1/1) ... [2022-11-16 11:30:00,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:30:00,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55cc95d1-1f63-42da-92a7-cfc578f3907f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:30:00,912 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55cc95d1-1f63-42da-92a7-cfc578f3907f/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:30:00,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55cc95d1-1f63-42da-92a7-cfc578f3907f/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-16 11:30:00,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:30:00,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:30:00,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:30:00,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:30:01,094 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:30:01,096 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:30:01,619 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:30:01,627 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:30:01,627 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 11:30:01,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:30:01 BoogieIcfgContainer [2022-11-16 11:30:01,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:30:01,631 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-16 11:30:01,631 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-16 11:30:01,646 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-16 11:30:01,647 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 11:30:01,647 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 11:30:00" (1/3) ... [2022-11-16 11:30:01,648 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d827248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 11:30:01, skipping insertion in model container [2022-11-16 11:30:01,649 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 11:30:01,649 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:30:00" (2/3) ... [2022-11-16 11:30:01,649 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d827248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 11:30:01, skipping insertion in model container [2022-11-16 11:30:01,650 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 11:30:01,650 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:30:01" (3/3) ... [2022-11-16 11:30:01,651 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c [2022-11-16 11:30:01,709 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-16 11:30:01,709 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-16 11:30:01,709 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-16 11:30:01,709 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-16 11:30:01,710 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-16 11:30:01,710 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-16 11:30:01,710 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-16 11:30:01,710 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-16 11:30:01,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 82 states, 81 states have (on average 1.7407407407407407) internal successors, (141), 81 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:30:01,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2022-11-16 11:30:01,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:30:01,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:30:01,746 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:30:01,747 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:30:01,747 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-16 11:30:01,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 82 states, 81 states have (on average 1.7407407407407407) internal successors, (141), 81 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:30:01,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2022-11-16 11:30:01,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:30:01,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:30:01,761 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:30:01,761 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:30:01,769 INFO L748 eck$LassoCheckResult]: Stem: 66#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(41, 2);call #Ultimate.allocInit(12, 3);~p1~0 := 0;~mode5~0 := 0;~p2~0 := 0;~mode4~0 := 0;~p3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p5~0 := 0;~p4_new~0 := 0;~p5_new~0 := 0;~p1_old~0 := 0;~p5_old~0 := 0;~p1_new~0 := 0;~mode2~0 := 0;~mode1~0 := 0;~nomsg~0 := -1;~p2_old~0 := 0;~send4~0 := 0;~send5~0 := 0;~send1~0 := 0;~send2~0 := 0;~p2_new~0 := 0;~send3~0 := 0;~st2~0 := 0;~st1~0 := 0;~p3_old~0 := 0;~st4~0 := 0;~st3~0 := 0;~st5~0 := 0;~id2~0 := 0;~id1~0 := 0;~id4~0 := 0;~id3~0 := 0;~id5~0 := 0;~p3_new~0 := 0;~r1~0 := 0; 50#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~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#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;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 6#L198true assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 31#L198-1true init_#res#1 := init_~tmp~0#1; 4#L323true main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#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; 61#L24true assume !(0 == assume_abort_if_not_~cond#1); 19#L23true 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; 17#L395-2true [2022-11-16 11:30:01,770 INFO L750 eck$LassoCheckResult]: Loop: 17#L395-2true assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 40#L73true 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; 41#L73-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; 53#L99true 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; 58#L99-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; 20#L124true 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; 77#L124-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; 32#L149true 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; 65#L149-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 76#L174true assume !(0 != ~mode5~0 % 256);~p5_new~0 := (if (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 <= 127 then (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 else (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 - 256);~mode5~0 := 1; 57#L174-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; 14#L331true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; 36#L331-1true check_#res#1 := check_~tmp~1#1; 3#L351true main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; 55#L424true assume !(0 == assert_~arg#1 % 256); 5#L419true assume { :end_inline_assert } true; 17#L395-2true [2022-11-16 11:30:01,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:30:01,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1978587388, now seen corresponding path program 1 times [2022-11-16 11:30:01,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:30:01,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399007886] [2022-11-16 11:30:01,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:01,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:30:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:02,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:30:02,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:30:02,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399007886] [2022-11-16 11:30:02,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399007886] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:30:02,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:30:02,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:30:02,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260860424] [2022-11-16 11:30:02,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:30:02,162 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-16 11:30:02,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:30:02,163 INFO L85 PathProgramCache]: Analyzing trace with hash 908352820, now seen corresponding path program 1 times [2022-11-16 11:30:02,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:30:02,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495706202] [2022-11-16 11:30:02,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:02,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:30:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:02,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:30:02,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:30:02,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495706202] [2022-11-16 11:30:02,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495706202] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:30:02,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:30:02,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:30:02,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121474560] [2022-11-16 11:30:02,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:30:02,647 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 11:30:02,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:30:02,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:30:02,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:30:02,694 INFO L87 Difference]: Start difference. First operand has 82 states, 81 states have (on average 1.7407407407407407) internal successors, (141), 81 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:30:02,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:30:02,854 INFO L93 Difference]: Finished difference Result 81 states and 136 transitions. [2022-11-16 11:30:02,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 136 transitions. [2022-11-16 11:30:02,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2022-11-16 11:30:02,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 77 states and 102 transitions. [2022-11-16 11:30:02,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2022-11-16 11:30:02,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2022-11-16 11:30:02,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 102 transitions. [2022-11-16 11:30:02,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:30:02,875 INFO L218 hiAutomatonCegarLoop]: Abstraction has 77 states and 102 transitions. [2022-11-16 11:30:02,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 102 transitions. [2022-11-16 11:30:02,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-11-16 11:30:02,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 76 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:30:02,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 102 transitions. [2022-11-16 11:30:02,905 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 102 transitions. [2022-11-16 11:30:02,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:30:02,911 INFO L428 stractBuchiCegarLoop]: Abstraction has 77 states and 102 transitions. [2022-11-16 11:30:02,911 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-16 11:30:02,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 102 transitions. [2022-11-16 11:30:02,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2022-11-16 11:30:02,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:30:02,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:30:02,915 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-11-16 11:30:02,915 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:30:02,916 INFO L748 eck$LassoCheckResult]: Stem: 252#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(41, 2);call #Ultimate.allocInit(12, 3);~p1~0 := 0;~mode5~0 := 0;~p2~0 := 0;~mode4~0 := 0;~p3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p5~0 := 0;~p4_new~0 := 0;~p5_new~0 := 0;~p1_old~0 := 0;~p5_old~0 := 0;~p1_new~0 := 0;~mode2~0 := 0;~mode1~0 := 0;~nomsg~0 := -1;~p2_old~0 := 0;~send4~0 := 0;~send5~0 := 0;~send1~0 := 0;~send2~0 := 0;~p2_new~0 := 0;~send3~0 := 0;~st2~0 := 0;~st1~0 := 0;~p3_old~0 := 0;~st4~0 := 0;~st3~0 := 0;~st5~0 := 0;~id2~0 := 0;~id1~0 := 0;~id4~0 := 0;~id3~0 := 0;~id5~0 := 0;~p3_new~0 := 0;~r1~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~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#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;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 187#L198 assume 0 == ~r1~0 % 256; 188#L199 assume ~id1~0 >= 0; 240#L200 assume 0 == ~st1~0; 241#L201 assume ~send1~0 == ~id1~0; 221#L202 assume 0 == ~mode1~0 % 256; 222#L203 assume ~id2~0 >= 0; 237#L204 assume 0 == ~st2~0; 196#L205 assume ~send2~0 == ~id2~0; 197#L206 assume 0 == ~mode2~0 % 256; 189#L207 assume ~id3~0 >= 0; 190#L208 assume 0 == ~st3~0; 243#L209 assume ~send3~0 == ~id3~0; 201#L210 assume 0 == ~mode3~0 % 256; 202#L211 assume ~id4~0 >= 0; 191#L212 assume 0 == ~st4~0; 192#L213 assume ~send4~0 == ~id4~0; 255#L214 assume 0 == ~mode4~0 % 256; 256#L215 assume ~id5~0 >= 0; 242#L216 assume 0 == ~st5~0; 229#L217 assume ~send5~0 == ~id5~0; 230#L218 assume 0 == ~mode5~0 % 256; 245#L219 assume ~id1~0 != ~id2~0; 257#L220 assume ~id1~0 != ~id3~0; 220#L221 assume ~id1~0 != ~id4~0; 218#L222 assume ~id1~0 != ~id5~0; 219#L223 assume ~id2~0 != ~id3~0; 212#L224 assume ~id2~0 != ~id4~0; 213#L225 assume ~id2~0 != ~id5~0; 207#L226 assume ~id3~0 != ~id4~0; 208#L227 assume ~id3~0 != ~id5~0; 223#L228 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 224#L198-1 init_#res#1 := init_~tmp~0#1; 183#L323 main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#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; 184#L24 assume !(0 == assume_abort_if_not_~cond#1); 214#L23 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; 186#L395-2 [2022-11-16 11:30:02,916 INFO L750 eck$LassoCheckResult]: Loop: 186#L395-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 211#L73 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; 226#L73-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; 239#L99 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; 228#L99-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; 215#L124 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; 217#L124-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; 233#L149 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; 203#L149-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 251#L174 assume !(0 != ~mode5~0 % 256);~p5_new~0 := (if (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 <= 127 then (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 else (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 - 256);~mode5~0 := 1; 248#L174-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; 204#L331 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; 206#L331-1 check_#res#1 := check_~tmp~1#1; 181#L351 main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; 182#L424 assume !(0 == assert_~arg#1 % 256); 185#L419 assume { :end_inline_assert } true; 186#L395-2 [2022-11-16 11:30:02,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:30:02,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 1 times [2022-11-16 11:30:02,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:30:02,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191276082] [2022-11-16 11:30:02,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:02,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:30:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:30:02,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:30:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:30:03,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:30:03,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:30:03,037 INFO L85 PathProgramCache]: Analyzing trace with hash 908352820, now seen corresponding path program 2 times [2022-11-16 11:30:03,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:30:03,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384051261] [2022-11-16 11:30:03,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:03,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:30:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:03,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:30:03,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:30:03,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384051261] [2022-11-16 11:30:03,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384051261] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:30:03,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:30:03,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:30:03,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716457655] [2022-11-16 11:30:03,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:30:03,253 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 11:30:03,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:30:03,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:30:03,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:30:03,256 INFO L87 Difference]: Start difference. First operand 77 states and 102 transitions. cyclomatic complexity: 26 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-16 11:30:03,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:30:03,323 INFO L93 Difference]: Finished difference Result 80 states and 104 transitions. [2022-11-16 11:30:03,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 104 transitions. [2022-11-16 11:30:03,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2022-11-16 11:30:03,330 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 77 states and 99 transitions. [2022-11-16 11:30:03,330 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2022-11-16 11:30:03,330 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2022-11-16 11:30:03,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 99 transitions. [2022-11-16 11:30:03,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:30:03,332 INFO L218 hiAutomatonCegarLoop]: Abstraction has 77 states and 99 transitions. [2022-11-16 11:30:03,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 99 transitions. [2022-11-16 11:30:03,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-11-16 11:30:03,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 76 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:30:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 99 transitions. [2022-11-16 11:30:03,337 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 99 transitions. [2022-11-16 11:30:03,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:30:03,340 INFO L428 stractBuchiCegarLoop]: Abstraction has 77 states and 99 transitions. [2022-11-16 11:30:03,341 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-16 11:30:03,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 99 transitions. [2022-11-16 11:30:03,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2022-11-16 11:30:03,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:30:03,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:30:03,346 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-11-16 11:30:03,348 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:30:03,349 INFO L748 eck$LassoCheckResult]: Stem: 421#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(41, 2);call #Ultimate.allocInit(12, 3);~p1~0 := 0;~mode5~0 := 0;~p2~0 := 0;~mode4~0 := 0;~p3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p5~0 := 0;~p4_new~0 := 0;~p5_new~0 := 0;~p1_old~0 := 0;~p5_old~0 := 0;~p1_new~0 := 0;~mode2~0 := 0;~mode1~0 := 0;~nomsg~0 := -1;~p2_old~0 := 0;~send4~0 := 0;~send5~0 := 0;~send1~0 := 0;~send2~0 := 0;~p2_new~0 := 0;~send3~0 := 0;~st2~0 := 0;~st1~0 := 0;~p3_old~0 := 0;~st4~0 := 0;~st3~0 := 0;~st5~0 := 0;~id2~0 := 0;~id1~0 := 0;~id4~0 := 0;~id3~0 := 0;~id5~0 := 0;~p3_new~0 := 0;~r1~0 := 0; 413#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~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#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;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 356#L198 assume 0 == ~r1~0 % 256; 357#L199 assume ~id1~0 >= 0; 409#L200 assume 0 == ~st1~0; 410#L201 assume ~send1~0 == ~id1~0; 390#L202 assume 0 == ~mode1~0 % 256; 391#L203 assume ~id2~0 >= 0; 404#L204 assume 0 == ~st2~0; 362#L205 assume ~send2~0 == ~id2~0; 363#L206 assume 0 == ~mode2~0 % 256; 358#L207 assume ~id3~0 >= 0; 359#L208 assume 0 == ~st3~0; 412#L209 assume ~send3~0 == ~id3~0; 367#L210 assume 0 == ~mode3~0 % 256; 368#L211 assume ~id4~0 >= 0; 360#L212 assume 0 == ~st4~0; 361#L213 assume ~send4~0 == ~id4~0; 424#L214 assume 0 == ~mode4~0 % 256; 425#L215 assume ~id5~0 >= 0; 411#L216 assume 0 == ~st5~0; 396#L217 assume ~send5~0 == ~id5~0; 397#L218 assume 0 == ~mode5~0 % 256; 414#L219 assume ~id1~0 != ~id2~0; 426#L220 assume ~id1~0 != ~id3~0; 389#L221 assume ~id1~0 != ~id4~0; 387#L222 assume ~id1~0 != ~id5~0; 388#L223 assume ~id2~0 != ~id3~0; 381#L224 assume ~id2~0 != ~id4~0; 382#L225 assume ~id2~0 != ~id5~0; 375#L226 assume ~id3~0 != ~id4~0; 376#L227 assume ~id3~0 != ~id5~0; 392#L228 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 393#L198-1 init_#res#1 := init_~tmp~0#1; 352#L323 main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#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; 353#L24 assume !(0 == assume_abort_if_not_~cond#1); 383#L23 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; 355#L395-2 [2022-11-16 11:30:03,350 INFO L750 eck$LassoCheckResult]: Loop: 355#L395-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 380#L73 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; 395#L73-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; 408#L99 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; 399#L99-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; 384#L124 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; 386#L124-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; 402#L149 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; 372#L149-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 420#L174 assume !(0 != ~mode5~0 % 256);~p5_new~0 := (if (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 <= 127 then (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 else (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 - 256);~mode5~0 := 1; 417#L174-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; 373#L331 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 374#L332 assume ~r1~0 % 256 >= 5; 377#L336 assume ~r1~0 % 256 < 5;check_~tmp~1#1 := 1; 378#L331-1 check_#res#1 := check_~tmp~1#1; 350#L351 main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; 351#L424 assume !(0 == assert_~arg#1 % 256); 354#L419 assume { :end_inline_assert } true; 355#L395-2 [2022-11-16 11:30:03,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:30:03,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 2 times [2022-11-16 11:30:03,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:30:03,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970552687] [2022-11-16 11:30:03,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:03,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:30:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:30:03,371 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:30:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:30:03,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:30:03,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:30:03,403 INFO L85 PathProgramCache]: Analyzing trace with hash -367120828, now seen corresponding path program 1 times [2022-11-16 11:30:03,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:30:03,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865989274] [2022-11-16 11:30:03,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:03,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:30:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:30:03,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:30:03,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:30:03,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865989274] [2022-11-16 11:30:03,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865989274] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:30:03,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:30:03,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:30:03,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825164691] [2022-11-16 11:30:03,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:30:03,474 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 11:30:03,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:30:03,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:30:03,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:30:03,477 INFO L87 Difference]: Start difference. First operand 77 states and 99 transitions. cyclomatic complexity: 23 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:30:03,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:30:03,524 INFO L93 Difference]: Finished difference Result 111 states and 150 transitions. [2022-11-16 11:30:03,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 150 transitions. [2022-11-16 11:30:03,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2022-11-16 11:30:03,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 111 states and 150 transitions. [2022-11-16 11:30:03,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2022-11-16 11:30:03,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 111 [2022-11-16 11:30:03,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 150 transitions. [2022-11-16 11:30:03,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:30:03,538 INFO L218 hiAutomatonCegarLoop]: Abstraction has 111 states and 150 transitions. [2022-11-16 11:30:03,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 150 transitions. [2022-11-16 11:30:03,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-11-16 11:30:03,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 111 states have (on average 1.3513513513513513) internal successors, (150), 110 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:30:03,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 150 transitions. [2022-11-16 11:30:03,551 INFO L240 hiAutomatonCegarLoop]: Abstraction has 111 states and 150 transitions. [2022-11-16 11:30:03,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:30:03,552 INFO L428 stractBuchiCegarLoop]: Abstraction has 111 states and 150 transitions. [2022-11-16 11:30:03,552 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-16 11:30:03,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 150 transitions. [2022-11-16 11:30:03,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2022-11-16 11:30:03,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:30:03,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:30:03,555 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-11-16 11:30:03,555 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] [2022-11-16 11:30:03,556 INFO L748 eck$LassoCheckResult]: Stem: 623#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(41, 2);call #Ultimate.allocInit(12, 3);~p1~0 := 0;~mode5~0 := 0;~p2~0 := 0;~mode4~0 := 0;~p3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p5~0 := 0;~p4_new~0 := 0;~p5_new~0 := 0;~p1_old~0 := 0;~p5_old~0 := 0;~p1_new~0 := 0;~mode2~0 := 0;~mode1~0 := 0;~nomsg~0 := -1;~p2_old~0 := 0;~send4~0 := 0;~send5~0 := 0;~send1~0 := 0;~send2~0 := 0;~p2_new~0 := 0;~send3~0 := 0;~st2~0 := 0;~st1~0 := 0;~p3_old~0 := 0;~st4~0 := 0;~st3~0 := 0;~st5~0 := 0;~id2~0 := 0;~id1~0 := 0;~id4~0 := 0;~id3~0 := 0;~id5~0 := 0;~p3_new~0 := 0;~r1~0 := 0; 612#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~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#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;~id5~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st5~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send5~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode5~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 550#L198 assume 0 == ~r1~0 % 256; 551#L199 assume ~id1~0 >= 0; 608#L200 assume 0 == ~st1~0; 609#L201 assume ~send1~0 == ~id1~0; 584#L202 assume 0 == ~mode1~0 % 256; 585#L203 assume ~id2~0 >= 0; 601#L204 assume 0 == ~st2~0; 559#L205 assume ~send2~0 == ~id2~0; 560#L206 assume 0 == ~mode2~0 % 256; 552#L207 assume ~id3~0 >= 0; 553#L208 assume 0 == ~st3~0; 611#L209 assume ~send3~0 == ~id3~0; 561#L210 assume 0 == ~mode3~0 % 256; 562#L211 assume ~id4~0 >= 0; 554#L212 assume 0 == ~st4~0; 555#L213 assume ~send4~0 == ~id4~0; 626#L214 assume 0 == ~mode4~0 % 256; 627#L215 assume ~id5~0 >= 0; 610#L216 assume 0 == ~st5~0; 592#L217 assume ~send5~0 == ~id5~0; 593#L218 assume 0 == ~mode5~0 % 256; 613#L219 assume ~id1~0 != ~id2~0; 629#L220 assume ~id1~0 != ~id3~0; 583#L221 assume ~id1~0 != ~id4~0; 581#L222 assume ~id1~0 != ~id5~0; 582#L223 assume ~id2~0 != ~id3~0; 575#L224 assume ~id2~0 != ~id4~0; 576#L225 assume ~id2~0 != ~id5~0; 570#L226 assume ~id3~0 != ~id4~0; 571#L227 assume ~id3~0 != ~id5~0; 586#L228 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 587#L198-1 init_#res#1 := init_~tmp~0#1; 548#L323 main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#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; 549#L24 assume !(0 == assume_abort_if_not_~cond#1); 580#L23 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; 547#L395-2 [2022-11-16 11:30:03,556 INFO L750 eck$LassoCheckResult]: Loop: 547#L395-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 574#L73 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; 589#L73-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; 643#L99 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; 642#L99-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; 640#L124 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; 638#L124-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; 597#L149 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; 567#L149-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 634#L174 assume !(0 != ~mode5~0 % 256);~p5_new~0 := (if (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 <= 127 then (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 else (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 - 256);~mode5~0 := 1; 632#L174-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; 631#L331 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 630#L332 assume !(~r1~0 % 256 >= 5); 595#L335 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; 596#L336 assume ~r1~0 % 256 < 5;check_~tmp~1#1 := 1; 602#L331-1 check_#res#1 := check_~tmp~1#1; 544#L351 main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; 545#L424 assume !(0 == assert_~arg#1 % 256); 546#L419 assume { :end_inline_assert } true; 547#L395-2 [2022-11-16 11:30:03,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:30:03,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 3 times [2022-11-16 11:30:03,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:30:03,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646573408] [2022-11-16 11:30:03,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:03,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:30:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:30:03,574 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:30:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:30:03,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:30:03,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:30:03,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1144239126, now seen corresponding path program 1 times [2022-11-16 11:30:03,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:30:03,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752176238] [2022-11-16 11:30:03,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:03,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:30:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:30:03,626 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:30:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:30:03,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:30:03,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:30:03,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1687762376, now seen corresponding path program 1 times [2022-11-16 11:30:03,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:30:03,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261564159] [2022-11-16 11:30:03,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:30:03,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:30:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:30:03,708 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:30:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:30:03,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:30:09,013 INFO L210 LassoAnalysis]: Preferences: [2022-11-16 11:30:09,014 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-16 11:30:09,014 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-16 11:30:09,015 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-16 11:30:09,015 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-16 11:30:09,015 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:30:09,015 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-16 11:30:09,015 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-16 11:30:09,016 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5_overflow.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2022-11-16 11:30:09,016 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-16 11:30:09,016 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-16 11:30:09,063 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:30:09,076 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:30:09,088 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:30:09,092 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:30:11,915 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:30:11,921 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:30:11,928 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:30:11,934 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:30:11,937 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:30:11,943 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:30:11,947 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-16 11:30:14,492 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 30