./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4_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_921dd4e1-addb-42f2-9b78-9ed773f32928/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921dd4e1-addb-42f2-9b78-9ed773f32928/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_921dd4e1-addb-42f2-9b78-9ed773f32928/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921dd4e1-addb-42f2-9b78-9ed773f32928/bin/uautomizer-tPACEb0tL8/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921dd4e1-addb-42f2-9b78-9ed773f32928/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_921dd4e1-addb-42f2-9b78-9ed773f32928/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 8cf9a91c8f1111f4616406dfb4a7fdeef392d21e591ff8d6357140f3015668db --- 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 12:43:24,560 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:43:24,562 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:43:24,590 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:43:24,597 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:43:24,602 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:43:24,605 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:43:24,612 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:43:24,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:43:24,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:43:24,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:43:24,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:43:24,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:43:24,629 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:43:24,631 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:43:24,634 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:43:24,636 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:43:24,637 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:43:24,639 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:43:24,647 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:43:24,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:43:24,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:43:24,655 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:43:24,656 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:43:24,666 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:43:24,666 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:43:24,667 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:43:24,669 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:43:24,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:43:24,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:43:24,671 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:43:24,673 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:43:24,674 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:43:24,676 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:43:24,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:43:24,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:43:24,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:43:24,678 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:43:24,678 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:43:24,679 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:43:24,680 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:43:24,681 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921dd4e1-addb-42f2-9b78-9ed773f32928/bin/uautomizer-tPACEb0tL8/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-16 12:43:24,714 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:43:24,714 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:43:24,715 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:43:24,715 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:43:24,720 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:43:24,720 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:43:24,720 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:43:24,721 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-16 12:43:24,721 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-16 12:43:24,721 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-16 12:43:24,722 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-16 12:43:24,722 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-16 12:43:24,723 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-16 12:43:24,723 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:43:24,723 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:43:24,723 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:43:24,724 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:43:24,724 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:43:24,724 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:43:24,724 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-16 12:43:24,725 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-16 12:43:24,725 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-16 12:43:24,725 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:43:24,726 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:43:24,726 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-16 12:43:24,726 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:43:24,726 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-16 12:43:24,727 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:43:24,727 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:43:24,727 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:43:24,727 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:43:24,729 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-16 12:43:24,729 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_921dd4e1-addb-42f2-9b78-9ed773f32928/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_921dd4e1-addb-42f2-9b78-9ed773f32928/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 -> 8cf9a91c8f1111f4616406dfb4a7fdeef392d21e591ff8d6357140f3015668db [2022-11-16 12:43:25,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:43:25,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:43:25,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:43:25,093 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:43:25,093 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:43:25,095 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921dd4e1-addb-42f2-9b78-9ed773f32928/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c [2022-11-16 12:43:25,165 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921dd4e1-addb-42f2-9b78-9ed773f32928/bin/uautomizer-tPACEb0tL8/data/bb5e17f8c/5f4d56e5e12c4b17894ab1e697dc6703/FLAGeb842711e [2022-11-16 12:43:25,638 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:43:25,639 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921dd4e1-addb-42f2-9b78-9ed773f32928/sv-benchmarks/c/seq-mthreaded/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c [2022-11-16 12:43:25,668 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921dd4e1-addb-42f2-9b78-9ed773f32928/bin/uautomizer-tPACEb0tL8/data/bb5e17f8c/5f4d56e5e12c4b17894ab1e697dc6703/FLAGeb842711e [2022-11-16 12:43:26,006 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921dd4e1-addb-42f2-9b78-9ed773f32928/bin/uautomizer-tPACEb0tL8/data/bb5e17f8c/5f4d56e5e12c4b17894ab1e697dc6703 [2022-11-16 12:43:26,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:43:26,011 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:43:26,013 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:43:26,013 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:43:26,017 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:43:26,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:43:26" (1/1) ... [2022-11-16 12:43:26,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30b8f28a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:26, skipping insertion in model container [2022-11-16 12:43:26,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:43:26" (1/1) ... [2022-11-16 12:43:26,028 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:43:26,057 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:43:26,304 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_921dd4e1-addb-42f2-9b78-9ed773f32928/sv-benchmarks/c/seq-mthreaded/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c[8379,8392] [2022-11-16 12:43:26,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:43:26,315 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:43:26,375 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_921dd4e1-addb-42f2-9b78-9ed773f32928/sv-benchmarks/c/seq-mthreaded/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c[8379,8392] [2022-11-16 12:43:26,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:43:26,406 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:43:26,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:26 WrapperNode [2022-11-16 12:43:26,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:43:26,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:43:26,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:43:26,409 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:43:26,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:26" (1/1) ... [2022-11-16 12:43:26,425 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:26" (1/1) ... [2022-11-16 12:43:26,455 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 242 [2022-11-16 12:43:26,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:43:26,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:43:26,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:43:26,465 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:43:26,474 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:26" (1/1) ... [2022-11-16 12:43:26,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:26" (1/1) ... [2022-11-16 12:43:26,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:26" (1/1) ... [2022-11-16 12:43:26,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:26" (1/1) ... [2022-11-16 12:43:26,484 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:26" (1/1) ... [2022-11-16 12:43:26,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:26" (1/1) ... [2022-11-16 12:43:26,493 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:26" (1/1) ... [2022-11-16 12:43:26,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:26" (1/1) ... [2022-11-16 12:43:26,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:43:26,499 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:43:26,499 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:43:26,500 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:43:26,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:26" (1/1) ... [2022-11-16 12:43:26,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 12:43:26,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921dd4e1-addb-42f2-9b78-9ed773f32928/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:43:26,535 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921dd4e1-addb-42f2-9b78-9ed773f32928/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 12:43:26,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_921dd4e1-addb-42f2-9b78-9ed773f32928/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-16 12:43:26,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:43:26,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:43:26,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:43:26,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:43:26,672 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:43:26,674 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:43:27,047 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:43:27,054 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:43:27,055 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 12:43:27,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:43:27 BoogieIcfgContainer [2022-11-16 12:43:27,057 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:43:27,058 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-16 12:43:27,058 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-16 12:43:27,081 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-16 12:43:27,082 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 12:43:27,082 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:43:26" (1/3) ... [2022-11-16 12:43:27,083 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a6a219f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:43:27, skipping insertion in model container [2022-11-16 12:43:27,083 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 12:43:27,083 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:43:26" (2/3) ... [2022-11-16 12:43:27,084 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a6a219f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:43:27, skipping insertion in model container [2022-11-16 12:43:27,084 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 12:43:27,084 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:43:27" (3/3) ... [2022-11-16 12:43:27,086 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c [2022-11-16 12:43:27,147 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-16 12:43:27,148 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-16 12:43:27,148 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-16 12:43:27,148 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-16 12:43:27,148 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-16 12:43:27,149 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-16 12:43:27,149 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-16 12:43:27,149 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-16 12:43:27,154 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-16 12:43:27,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2022-11-16 12:43:27,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 12:43:27,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 12:43:27,187 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:43:27,187 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:43:27,188 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-16 12:43:27,188 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-16 12:43:27,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2022-11-16 12:43:27,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 12:43:27,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 12:43:27,201 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:43:27,201 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:43:27,210 INFO L748 eck$LassoCheckResult]: Stem: 54#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;~p2~0 := 0;~mode4~0 := 0;~p3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~mode2~0 := 0;~mode1~0 := 0;~nomsg~0 := -1;~p2_old~0 := 0;~send4~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;~id2~0 := 0;~id1~0 := 0;~id4~0 := 0;~id3~0 := 0;~p3_new~0 := 0;~r1~0 := 0; 41#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_~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; 22#L166true assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 12#L166-1true init_#res#1 := init_~tmp~0#1; 4#L259true 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;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; 53#L24true assume !(0 == assume_abort_if_not_~cond#1); 13#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;main_~i2~0#1 := 0; 37#L325-2true [2022-11-16 12:43:27,212 INFO L750 eck$LassoCheckResult]: Loop: 37#L325-2true assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 39#L66true 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; 45#L66-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; 46#L92true 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; 62#L92-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; 10#L117true 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; 21#L117-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; 35#L142true 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; 28#L142-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; 23#L267true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 40#L267-1true check_#res#1 := check_~tmp~1#1; 64#L287true 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; 5#L351true assume !(0 == assert_~arg#1 % 256); 50#L346true assume { :end_inline_assert } true; 37#L325-2true [2022-11-16 12:43:27,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:27,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1932780748, now seen corresponding path program 1 times [2022-11-16 12:43:27,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:27,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647617461] [2022-11-16 12:43:27,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:27,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:27,510 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 12:43:27,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:27,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647617461] [2022-11-16 12:43:27,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647617461] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:43:27,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:43:27,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:43:27,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073777076] [2022-11-16 12:43:27,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:43:27,520 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-16 12:43:27,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:27,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1387092733, now seen corresponding path program 1 times [2022-11-16 12:43:27,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:27,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22465287] [2022-11-16 12:43:27,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:27,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:28,022 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 12:43:28,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:28,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22465287] [2022-11-16 12:43:28,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22465287] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:43:28,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:43:28,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:43:28,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247614856] [2022-11-16 12:43:28,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:43:28,030 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 12:43:28,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:28,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:43:28,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:43:28,084 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-16 12:43:28,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:28,226 INFO L93 Difference]: Finished difference Result 67 states and 110 transitions. [2022-11-16 12:43:28,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 110 transitions. [2022-11-16 12:43:28,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2022-11-16 12:43:28,240 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 63 states and 84 transitions. [2022-11-16 12:43:28,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2022-11-16 12:43:28,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2022-11-16 12:43:28,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 84 transitions. [2022-11-16 12:43:28,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:43:28,243 INFO L218 hiAutomatonCegarLoop]: Abstraction has 63 states and 84 transitions. [2022-11-16 12:43:28,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 84 transitions. [2022-11-16 12:43:28,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-16 12:43:28,270 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-16 12:43:28,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 84 transitions. [2022-11-16 12:43:28,272 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 84 transitions. [2022-11-16 12:43:28,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:43:28,276 INFO L428 stractBuchiCegarLoop]: Abstraction has 63 states and 84 transitions. [2022-11-16 12:43:28,277 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-16 12:43:28,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 84 transitions. [2022-11-16 12:43:28,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2022-11-16 12:43:28,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 12:43:28,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 12:43:28,279 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-16 12:43:28,280 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:43:28,280 INFO L748 eck$LassoCheckResult]: Stem: 212#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;~p2~0 := 0;~mode4~0 := 0;~p3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~mode2~0 := 0;~mode1~0 := 0;~nomsg~0 := -1;~p2_old~0 := 0;~send4~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;~id2~0 := 0;~id1~0 := 0;~id4~0 := 0;~id3~0 := 0;~p3_new~0 := 0;~r1~0 := 0; 205#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_~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; 190#L166 assume 0 == ~r1~0 % 256; 182#L167 assume ~id1~0 >= 0; 163#L168 assume 0 == ~st1~0; 164#L169 assume ~send1~0 == ~id1~0; 215#L170 assume 0 == ~mode1~0 % 256; 209#L171 assume ~id2~0 >= 0; 206#L172 assume 0 == ~st2~0; 207#L173 assume ~send2~0 == ~id2~0; 214#L174 assume 0 == ~mode2~0 % 256; 161#L175 assume ~id3~0 >= 0; 162#L176 assume 0 == ~st3~0; 211#L177 assume ~send3~0 == ~id3~0; 197#L178 assume 0 == ~mode3~0 % 256; 198#L179 assume ~id4~0 >= 0; 153#L180 assume 0 == ~st4~0; 154#L181 assume ~send4~0 == ~id4~0; 193#L182 assume 0 == ~mode4~0 % 256; 196#L183 assume ~id1~0 != ~id2~0; 176#L184 assume ~id1~0 != ~id3~0; 177#L185 assume ~id1~0 != ~id4~0; 199#L186 assume ~id2~0 != ~id3~0; 213#L187 assume ~id2~0 != ~id4~0; 178#L188 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 171#L166-1 init_#res#1 := init_~tmp~0#1; 157#L259 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;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; 158#L24 assume !(0 == assume_abort_if_not_~cond#1); 174#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;main_~i2~0#1 := 0; 175#L325-2 [2022-11-16 12:43:28,280 INFO L750 eck$LassoCheckResult]: Loop: 175#L325-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 202#L66 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; 194#L66-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; 210#L92 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; 200#L92-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; 167#L117 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; 169#L117-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; 189#L142 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; 195#L142-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; 191#L267 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 160#L267-1 check_#res#1 := check_~tmp~1#1; 204#L287 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; 155#L351 assume !(0 == assert_~arg#1 % 256); 156#L346 assume { :end_inline_assert } true; 175#L325-2 [2022-11-16 12:43:28,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:28,281 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 1 times [2022-11-16 12:43:28,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:28,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122322784] [2022-11-16 12:43:28,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:28,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:43:28,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:43:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:43:28,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:43:28,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:28,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1387092733, now seen corresponding path program 2 times [2022-11-16 12:43:28,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:28,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777085196] [2022-11-16 12:43:28,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:28,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:28,509 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 12:43:28,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:28,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777085196] [2022-11-16 12:43:28,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777085196] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:43:28,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:43:28,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:43:28,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789220036] [2022-11-16 12:43:28,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:43:28,512 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 12:43:28,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:28,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 12:43:28,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:43:28,514 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-16 12:43:28,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:28,568 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2022-11-16 12:43:28,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 86 transitions. [2022-11-16 12:43:28,570 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2022-11-16 12:43:28,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 63 states and 81 transitions. [2022-11-16 12:43:28,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2022-11-16 12:43:28,571 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2022-11-16 12:43:28,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 81 transitions. [2022-11-16 12:43:28,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:43:28,572 INFO L218 hiAutomatonCegarLoop]: Abstraction has 63 states and 81 transitions. [2022-11-16 12:43:28,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 81 transitions. [2022-11-16 12:43:28,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-16 12:43:28,591 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-16 12:43:28,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 81 transitions. [2022-11-16 12:43:28,592 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 81 transitions. [2022-11-16 12:43:28,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:43:28,593 INFO L428 stractBuchiCegarLoop]: Abstraction has 63 states and 81 transitions. [2022-11-16 12:43:28,593 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-16 12:43:28,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 81 transitions. [2022-11-16 12:43:28,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2022-11-16 12:43:28,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 12:43:28,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 12:43:28,596 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-16 12:43:28,596 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 12:43:28,596 INFO L748 eck$LassoCheckResult]: Stem: 353#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;~p2~0 := 0;~mode4~0 := 0;~p3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~mode2~0 := 0;~mode1~0 := 0;~nomsg~0 := -1;~p2_old~0 := 0;~send4~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;~id2~0 := 0;~id1~0 := 0;~id4~0 := 0;~id3~0 := 0;~p3_new~0 := 0;~r1~0 := 0; 346#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_~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; 331#L166 assume 0 == ~r1~0 % 256; 323#L167 assume ~id1~0 >= 0; 306#L168 assume 0 == ~st1~0; 307#L169 assume ~send1~0 == ~id1~0; 356#L170 assume 0 == ~mode1~0 % 256; 351#L171 assume ~id2~0 >= 0; 347#L172 assume 0 == ~st2~0; 348#L173 assume ~send2~0 == ~id2~0; 355#L174 assume 0 == ~mode2~0 % 256; 302#L175 assume ~id3~0 >= 0; 303#L176 assume 0 == ~st3~0; 352#L177 assume ~send3~0 == ~id3~0; 338#L178 assume 0 == ~mode3~0 % 256; 339#L179 assume ~id4~0 >= 0; 294#L180 assume 0 == ~st4~0; 295#L181 assume ~send4~0 == ~id4~0; 335#L182 assume 0 == ~mode4~0 % 256; 337#L183 assume ~id1~0 != ~id2~0; 317#L184 assume ~id1~0 != ~id3~0; 318#L185 assume ~id1~0 != ~id4~0; 340#L186 assume ~id2~0 != ~id3~0; 354#L187 assume ~id2~0 != ~id4~0; 319#L188 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 312#L166-1 init_#res#1 := init_~tmp~0#1; 298#L259 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;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; 299#L24 assume !(0 == assume_abort_if_not_~cond#1); 315#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;main_~i2~0#1 := 0; 316#L325-2 [2022-11-16 12:43:28,597 INFO L750 eck$LassoCheckResult]: Loop: 316#L325-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 343#L66 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; 334#L66-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; 350#L92 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; 341#L92-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; 308#L117 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; 310#L117-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; 330#L142 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; 336#L142-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; 332#L267 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 327#L268 assume ~r1~0 % 256 >= 4; 328#L272 assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; 301#L267-1 check_#res#1 := check_~tmp~1#1; 345#L287 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; 296#L351 assume !(0 == assert_~arg#1 % 256); 297#L346 assume { :end_inline_assert } true; 316#L325-2 [2022-11-16 12:43:28,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:28,598 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 2 times [2022-11-16 12:43:28,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:28,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806669058] [2022-11-16 12:43:28,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:28,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:43:28,615 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:43:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:43:28,633 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:43:28,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:28,634 INFO L85 PathProgramCache]: Analyzing trace with hash 140432525, now seen corresponding path program 1 times [2022-11-16 12:43:28,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:28,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180001830] [2022-11-16 12:43:28,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:28,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:43:28,667 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 12:43:28,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:43:28,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180001830] [2022-11-16 12:43:28,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180001830] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:43:28,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:43:28,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:43:28,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964336532] [2022-11-16 12:43:28,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:43:28,670 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 12:43:28,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:43:28,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:43:28,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:43:28,671 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-16 12:43:28,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:43:28,706 INFO L93 Difference]: Finished difference Result 91 states and 122 transitions. [2022-11-16 12:43:28,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 122 transitions. [2022-11-16 12:43:28,707 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2022-11-16 12:43:28,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 122 transitions. [2022-11-16 12:43:28,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2022-11-16 12:43:28,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2022-11-16 12:43:28,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 122 transitions. [2022-11-16 12:43:28,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:43:28,710 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 122 transitions. [2022-11-16 12:43:28,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 122 transitions. [2022-11-16 12:43:28,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-11-16 12:43:28,715 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-16 12:43:28,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 122 transitions. [2022-11-16 12:43:28,716 INFO L240 hiAutomatonCegarLoop]: Abstraction has 91 states and 122 transitions. [2022-11-16 12:43:28,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:43:28,717 INFO L428 stractBuchiCegarLoop]: Abstraction has 91 states and 122 transitions. [2022-11-16 12:43:28,718 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-16 12:43:28,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 122 transitions. [2022-11-16 12:43:28,719 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2022-11-16 12:43:28,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 12:43:28,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 12:43:28,720 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-16 12:43:28,721 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-16 12:43:28,721 INFO L748 eck$LassoCheckResult]: Stem: 516#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;~p2~0 := 0;~mode4~0 := 0;~p3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~mode2~0 := 0;~mode1~0 := 0;~nomsg~0 := -1;~p2_old~0 := 0;~send4~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;~id2~0 := 0;~id1~0 := 0;~id4~0 := 0;~id3~0 := 0;~p3_new~0 := 0;~r1~0 := 0; 509#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_~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; 490#L166 assume 0 == ~r1~0 % 256; 483#L167 assume ~id1~0 >= 0; 466#L168 assume 0 == ~st1~0; 467#L169 assume ~send1~0 == ~id1~0; 519#L170 assume 0 == ~mode1~0 % 256; 514#L171 assume ~id2~0 >= 0; 510#L172 assume 0 == ~st2~0; 511#L173 assume ~send2~0 == ~id2~0; 518#L174 assume 0 == ~mode2~0 % 256; 462#L175 assume ~id3~0 >= 0; 463#L176 assume 0 == ~st3~0; 515#L177 assume ~send3~0 == ~id3~0; 497#L178 assume 0 == ~mode3~0 % 256; 498#L179 assume ~id4~0 >= 0; 454#L180 assume 0 == ~st4~0; 455#L181 assume ~send4~0 == ~id4~0; 494#L182 assume 0 == ~mode4~0 % 256; 496#L183 assume ~id1~0 != ~id2~0; 477#L184 assume ~id1~0 != ~id3~0; 478#L185 assume ~id1~0 != ~id4~0; 499#L186 assume ~id2~0 != ~id3~0; 517#L187 assume ~id2~0 != ~id4~0; 479#L188 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 472#L166-1 init_#res#1 := init_~tmp~0#1; 456#L259 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;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; 457#L24 assume !(0 == assume_abort_if_not_~cond#1); 473#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;main_~i2~0#1 := 0; 474#L325-2 [2022-11-16 12:43:28,721 INFO L750 eck$LassoCheckResult]: Loop: 474#L325-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 540#L66 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; 493#L66-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; 535#L92 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; 532#L92-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; 530#L117 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; 526#L117-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; 524#L142 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; 522#L142-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; 521#L267 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 520#L268 assume !(~r1~0 % 256 >= 4); 502#L271 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 503#L272 assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; 544#L267-1 check_#res#1 := check_~tmp~1#1; 543#L287 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; 542#L351 assume !(0 == assert_~arg#1 % 256); 541#L346 assume { :end_inline_assert } true; 474#L325-2 [2022-11-16 12:43:28,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:28,722 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 3 times [2022-11-16 12:43:28,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:28,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494713038] [2022-11-16 12:43:28,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:28,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:43:28,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:43:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:43:28,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:43:28,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:28,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1705012855, now seen corresponding path program 1 times [2022-11-16 12:43:28,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:28,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797982890] [2022-11-16 12:43:28,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:28,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:43:28,847 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:43:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:43:28,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:43:28,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:43:28,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1742065361, now seen corresponding path program 1 times [2022-11-16 12:43:28,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:43:28,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970055964] [2022-11-16 12:43:28,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:43:28,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:43:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:43:28,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 12:43:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 12:43:29,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 12:43:32,606 INFO L210 LassoAnalysis]: Preferences: [2022-11-16 12:43:32,607 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-16 12:43:32,607 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-16 12:43:32,607 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-16 12:43:32,608 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-16 12:43:32,608 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 12:43:32,608 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-16 12:43:32,608 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-16 12:43:32,608 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c_Iteration4_Loop [2022-11-16 12:43:32,609 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-16 12:43:32,609 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-16 12:43:32,653 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 12:43:32,665 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 12:43:32,670 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 12:43:32,674 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 12:43:32,676 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 12:43:32,681 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 12:43:34,269 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 12:43:34,274 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 12:43:34,280 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 12:43:34,285 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 12:43:35,834 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 22