./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e5878b7d2af5fd4b66050c0dbed52215fb6ea8477622dc26391a98be7bc7f1ca --- 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-38b53e6 [2022-11-26 00:29:48,471 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:29:48,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:29:48,496 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:29:48,496 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:29:48,497 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:29:48,499 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:29:48,500 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:29:48,502 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:29:48,503 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:29:48,504 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:29:48,505 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:29:48,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:29:48,506 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:29:48,507 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:29:48,509 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:29:48,509 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:29:48,510 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:29:48,512 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:29:48,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:29:48,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:29:48,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:29:48,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:29:48,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:29:48,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:29:48,522 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:29:48,522 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:29:48,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:29:48,529 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:29:48,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:29:48,531 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:29:48,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:29:48,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:29:48,533 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:29:48,534 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:29:48,534 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:29:48,535 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:29:48,535 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:29:48,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:29:48,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:29:48,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:29:48,541 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-26 00:29:48,574 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:29:48,575 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:29:48,575 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:29:48,575 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:29:48,576 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:29:48,577 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:29:48,577 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:29:48,577 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:29:48,577 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:29:48,578 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:29:48,579 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:29:48,579 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:29:48,579 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:29:48,579 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:29:48,580 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:29:48,580 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:29:48,580 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:29:48,580 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:29:48,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:29:48,581 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:29:48,581 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 00:29:48,582 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:29:48,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:29:48,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:29:48,582 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:29:48,582 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:29:48,583 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:29:48,583 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-26 00:29:48,583 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:29:48,583 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:29:48,583 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:29:48,584 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:29:48,584 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:29:48,584 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:29:48,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:29:48,585 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:29:48,585 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:29:48,585 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:29:48,585 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:29:48,587 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:29:48,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:29:48,587 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:29:48,587 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:29:48,588 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/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_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur 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(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> e5878b7d2af5fd4b66050c0dbed52215fb6ea8477622dc26391a98be7bc7f1ca [2022-11-26 00:29:48,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:29:48,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:29:48,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:29:48,983 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:29:48,984 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:29:48,985 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2022-11-26 00:29:52,046 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:29:52,241 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:29:52,242 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2022-11-26 00:29:52,250 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/data/cff8083ff/6ce1368af3a845db80c993c0ebd0b78d/FLAGd81ff6d49 [2022-11-26 00:29:52,266 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/data/cff8083ff/6ce1368af3a845db80c993c0ebd0b78d [2022-11-26 00:29:52,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:29:52,270 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:29:52,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:29:52,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:29:52,275 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:29:52,276 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:29:52" (1/1) ... [2022-11-26 00:29:52,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67390eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:29:52, skipping insertion in model container [2022-11-26 00:29:52,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:29:52" (1/1) ... [2022-11-26 00:29:52,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:29:52,307 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:29:52,537 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c[6117,6130] [2022-11-26 00:29:52,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:29:52,549 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:29:52,590 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c[6117,6130] [2022-11-26 00:29:52,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:29:52,605 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:29:52,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:29:52 WrapperNode [2022-11-26 00:29:52,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:29:52,607 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:29:52,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:29:52,607 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:29:52,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:29:52" (1/1) ... [2022-11-26 00:29:52,623 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:29:52" (1/1) ... [2022-11-26 00:29:52,647 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 219 [2022-11-26 00:29:52,648 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:29:52,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:29:52,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:29:52,649 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:29:52,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:29:52" (1/1) ... [2022-11-26 00:29:52,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:29:52" (1/1) ... [2022-11-26 00:29:52,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:29:52" (1/1) ... [2022-11-26 00:29:52,674 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:29:52" (1/1) ... [2022-11-26 00:29:52,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:29:52" (1/1) ... [2022-11-26 00:29:52,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:29:52" (1/1) ... [2022-11-26 00:29:52,700 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:29:52" (1/1) ... [2022-11-26 00:29:52,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:29:52" (1/1) ... [2022-11-26 00:29:52,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:29:52,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:29:52,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:29:52,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:29:52,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:29:52" (1/1) ... [2022-11-26 00:29:52,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:29:52,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:29:52,749 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:29:52,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:29:52,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:29:52,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:29:52,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:29:52,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:29:52,879 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:29:52,881 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:29:53,297 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:29:53,674 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:29:53,675 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-26 00:29:53,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:29:53 BoogieIcfgContainer [2022-11-26 00:29:53,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:29:53,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:29:53,681 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:29:53,684 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:29:53,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:29:52" (1/3) ... [2022-11-26 00:29:53,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4deb9a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:29:53, skipping insertion in model container [2022-11-26 00:29:53,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:29:52" (2/3) ... [2022-11-26 00:29:53,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4deb9a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:29:53, skipping insertion in model container [2022-11-26 00:29:53,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:29:53" (3/3) ... [2022-11-26 00:29:53,690 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2022-11-26 00:29:53,710 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:29:53,711 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-11-26 00:29:53,782 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:29:53,791 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2a4d2439, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:29:53,791 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-26 00:29:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 37 states have internal predecessors, (43), 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-26 00:29:53,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-26 00:29:53,805 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:29:53,806 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-26 00:29:53,806 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:29:53,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:29:53,816 INFO L85 PathProgramCache]: Analyzing trace with hash 11377276, now seen corresponding path program 1 times [2022-11-26 00:29:53,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:29:53,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695295651] [2022-11-26 00:29:53,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:29:53,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:29:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:29:54,525 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-26 00:29:54,526 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:29:54,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695295651] [2022-11-26 00:29:54,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695295651] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:29:54,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:29:54,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:29:54,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341523826] [2022-11-26 00:29:54,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:29:54,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:29:54,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:29:54,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:29:54,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:29:54,590 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 37 states have internal predecessors, (43), 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 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-26 00:29:54,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:29:54,713 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2022-11-26 00:29:54,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:29:54,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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) Word has length 4 [2022-11-26 00:29:54,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:29:54,726 INFO L225 Difference]: With dead ends: 104 [2022-11-26 00:29:54,727 INFO L226 Difference]: Without dead ends: 67 [2022-11-26 00:29:54,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:29:54,735 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 34 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:29:54,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 98 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:29:54,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-26 00:29:54,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2022-11-26 00:29:54,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.7674418604651163) internal successors, (76), 54 states have internal predecessors, (76), 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-26 00:29:54,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 76 transitions. [2022-11-26 00:29:54,799 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 76 transitions. Word has length 4 [2022-11-26 00:29:54,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:29:54,800 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 76 transitions. [2022-11-26 00:29:54,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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-26 00:29:54,801 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 76 transitions. [2022-11-26 00:29:54,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-26 00:29:54,802 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:29:54,802 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-26 00:29:54,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:29:54,803 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:29:54,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:29:54,805 INFO L85 PathProgramCache]: Analyzing trace with hash 352724648, now seen corresponding path program 1 times [2022-11-26 00:29:54,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:29:54,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285253627] [2022-11-26 00:29:54,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:29:54,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:29:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:29:55,283 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-26 00:29:55,284 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:29:55,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285253627] [2022-11-26 00:29:55,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285253627] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:29:55,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:29:55,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:29:55,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929992954] [2022-11-26 00:29:55,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:29:55,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:29:55,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:29:55,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:29:55,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:29:55,291 INFO L87 Difference]: Start difference. First operand 55 states and 76 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-26 00:29:55,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:29:55,547 INFO L93 Difference]: Finished difference Result 93 states and 119 transitions. [2022-11-26 00:29:55,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:29:55,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 5 [2022-11-26 00:29:55,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:29:55,550 INFO L225 Difference]: With dead ends: 93 [2022-11-26 00:29:55,550 INFO L226 Difference]: Without dead ends: 90 [2022-11-26 00:29:55,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:29:55,552 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 34 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:29:55,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 27 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:29:55,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-26 00:29:55,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 71. [2022-11-26 00:29:55,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.728813559322034) internal successors, (102), 70 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-26 00:29:55,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 102 transitions. [2022-11-26 00:29:55,563 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 102 transitions. Word has length 5 [2022-11-26 00:29:55,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:29:55,563 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 102 transitions. [2022-11-26 00:29:55,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-26 00:29:55,564 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2022-11-26 00:29:55,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 00:29:55,564 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:29:55,564 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-26 00:29:55,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 00:29:55,565 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:29:55,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:29:55,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1950437567, now seen corresponding path program 1 times [2022-11-26 00:29:55,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:29:55,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954521968] [2022-11-26 00:29:55,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:29:55,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:29:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:29:55,849 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-26 00:29:55,849 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:29:55,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954521968] [2022-11-26 00:29:55,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954521968] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:29:55,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:29:55,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:29:55,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824352285] [2022-11-26 00:29:55,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:29:55,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:29:55,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:29:55,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:29:55,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:29:55,853 INFO L87 Difference]: Start difference. First operand 71 states and 102 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-26 00:29:55,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:29:55,975 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2022-11-26 00:29:55,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:29:55,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2022-11-26 00:29:55,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:29:55,977 INFO L225 Difference]: With dead ends: 89 [2022-11-26 00:29:55,977 INFO L226 Difference]: Without dead ends: 86 [2022-11-26 00:29:55,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:29:55,979 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 30 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:29:55,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 30 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:29:55,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-26 00:29:55,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 72. [2022-11-26 00:29:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 71 states have internal predecessors, (101), 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-26 00:29:55,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2022-11-26 00:29:55,991 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 101 transitions. Word has length 6 [2022-11-26 00:29:55,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:29:55,991 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 101 transitions. [2022-11-26 00:29:55,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-26 00:29:55,992 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 101 transitions. [2022-11-26 00:29:55,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-26 00:29:55,992 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:29:55,992 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:29:55,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 00:29:55,993 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:29:55,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:29:55,993 INFO L85 PathProgramCache]: Analyzing trace with hash -334022198, now seen corresponding path program 1 times [2022-11-26 00:29:55,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:29:55,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782626189] [2022-11-26 00:29:55,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:29:55,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:29:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:29:56,418 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-26 00:29:56,418 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:29:56,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782626189] [2022-11-26 00:29:56,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782626189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:29:56,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:29:56,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:29:56,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842235138] [2022-11-26 00:29:56,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:29:56,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:29:56,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:29:56,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:29:56,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:29:56,424 INFO L87 Difference]: Start difference. First operand 72 states and 101 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-26 00:29:56,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:29:56,589 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2022-11-26 00:29:56,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:29:56,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Word has length 7 [2022-11-26 00:29:56,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:29:56,593 INFO L225 Difference]: With dead ends: 86 [2022-11-26 00:29:56,593 INFO L226 Difference]: Without dead ends: 83 [2022-11-26 00:29:56,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:29:56,604 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:29:56,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 33 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:29:56,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-26 00:29:56,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 73. [2022-11-26 00:29:56,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.639344262295082) internal successors, (100), 72 states have internal predecessors, (100), 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-26 00:29:56,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 100 transitions. [2022-11-26 00:29:56,624 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 100 transitions. Word has length 7 [2022-11-26 00:29:56,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:29:56,624 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 100 transitions. [2022-11-26 00:29:56,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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-26 00:29:56,625 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 100 transitions. [2022-11-26 00:29:56,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 00:29:56,625 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:29:56,625 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:29:56,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-26 00:29:56,626 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:29:56,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:29:56,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1764753309, now seen corresponding path program 1 times [2022-11-26 00:29:56,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:29:56,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713908703] [2022-11-26 00:29:56,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:29:56,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:29:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:29:57,017 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-26 00:29:57,017 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:29:57,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713908703] [2022-11-26 00:29:57,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713908703] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:29:57,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:29:57,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:29:57,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644519693] [2022-11-26 00:29:57,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:29:57,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:29:57,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:29:57,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:29:57,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:29:57,022 INFO L87 Difference]: Start difference. First operand 73 states and 100 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-26 00:29:57,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:29:57,138 INFO L93 Difference]: Finished difference Result 134 states and 184 transitions. [2022-11-26 00:29:57,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:29:57,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 8 [2022-11-26 00:29:57,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:29:57,140 INFO L225 Difference]: With dead ends: 134 [2022-11-26 00:29:57,140 INFO L226 Difference]: Without dead ends: 80 [2022-11-26 00:29:57,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:29:57,147 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:29:57,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 37 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:29:57,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-26 00:29:57,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2022-11-26 00:29:57,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 62 states have (on average 1.5806451612903225) internal successors, (98), 73 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:29:57,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 98 transitions. [2022-11-26 00:29:57,156 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 98 transitions. Word has length 8 [2022-11-26 00:29:57,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:29:57,156 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 98 transitions. [2022-11-26 00:29:57,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-26 00:29:57,156 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2022-11-26 00:29:57,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-26 00:29:57,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:29:57,157 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:29:57,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-26 00:29:57,158 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:29:57,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:29:57,158 INFO L85 PathProgramCache]: Analyzing trace with hash -2077909877, now seen corresponding path program 1 times [2022-11-26 00:29:57,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:29:57,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553877808] [2022-11-26 00:29:57,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:29:57,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:29:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:29:57,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:29:57,269 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:29:57,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553877808] [2022-11-26 00:29:57,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553877808] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:29:57,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:29:57,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:29:57,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255128093] [2022-11-26 00:29:57,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:29:57,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:29:57,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:29:57,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:29:57,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:29:57,271 INFO L87 Difference]: Start difference. First operand 74 states and 98 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 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-26 00:29:57,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:29:57,321 INFO L93 Difference]: Finished difference Result 155 states and 206 transitions. [2022-11-26 00:29:57,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:29:57,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 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) Word has length 16 [2022-11-26 00:29:57,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:29:57,323 INFO L225 Difference]: With dead ends: 155 [2022-11-26 00:29:57,323 INFO L226 Difference]: Without dead ends: 96 [2022-11-26 00:29:57,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:29:57,326 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 20 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:29:57,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 64 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:29:57,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-26 00:29:57,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2022-11-26 00:29:57,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 72 states have (on average 1.6111111111111112) internal successors, (116), 83 states have internal predecessors, (116), 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-26 00:29:57,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2022-11-26 00:29:57,350 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 16 [2022-11-26 00:29:57,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:29:57,351 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2022-11-26 00:29:57,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 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-26 00:29:57,352 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2022-11-26 00:29:57,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-26 00:29:57,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:29:57,354 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:29:57,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-26 00:29:57,354 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:29:57,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:29:57,355 INFO L85 PathProgramCache]: Analyzing trace with hash -946674433, now seen corresponding path program 1 times [2022-11-26 00:29:57,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:29:57,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001907554] [2022-11-26 00:29:57,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:29:57,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:29:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:29:57,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:29:57,481 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:29:57,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001907554] [2022-11-26 00:29:57,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001907554] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:29:57,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:29:57,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:29:57,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599741504] [2022-11-26 00:29:57,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:29:57,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:29:57,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:29:57,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:29:57,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:29:57,484 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-26 00:29:57,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:29:57,528 INFO L93 Difference]: Finished difference Result 155 states and 198 transitions. [2022-11-26 00:29:57,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:29:57,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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) Word has length 20 [2022-11-26 00:29:57,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:29:57,530 INFO L225 Difference]: With dead ends: 155 [2022-11-26 00:29:57,530 INFO L226 Difference]: Without dead ends: 85 [2022-11-26 00:29:57,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:29:57,533 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 23 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:29:57,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 85 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:29:57,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-26 00:29:57,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 70. [2022-11-26 00:29:57,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 69 states have internal predecessors, (91), 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-26 00:29:57,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2022-11-26 00:29:57,549 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 20 [2022-11-26 00:29:57,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:29:57,550 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2022-11-26 00:29:57,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-26 00:29:57,550 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2022-11-26 00:29:57,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-26 00:29:57,551 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:29:57,551 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:29:57,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-26 00:29:57,552 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:29:57,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:29:57,553 INFO L85 PathProgramCache]: Analyzing trace with hash 751304214, now seen corresponding path program 1 times [2022-11-26 00:29:57,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:29:57,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483004837] [2022-11-26 00:29:57,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:29:57,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:29:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:29:58,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:29:58,365 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:29:58,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483004837] [2022-11-26 00:29:58,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483004837] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:29:58,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135254176] [2022-11-26 00:29:58,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:29:58,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:29:58,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:29:58,371 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:29:58,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 00:29:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:29:58,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-26 00:29:58,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:29:59,673 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:29:59,674 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:29:59,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135254176] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:29:59,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 00:29:59,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 7 [2022-11-26 00:29:59,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676800696] [2022-11-26 00:29:59,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:29:59,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:29:59,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:29:59,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:29:59,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:29:59,676 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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-26 00:29:59,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:29:59,806 INFO L93 Difference]: Finished difference Result 129 states and 170 transitions. [2022-11-26 00:29:59,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:29:59,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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) Word has length 22 [2022-11-26 00:29:59,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:29:59,808 INFO L225 Difference]: With dead ends: 129 [2022-11-26 00:29:59,808 INFO L226 Difference]: Without dead ends: 75 [2022-11-26 00:29:59,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:29:59,809 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:29:59,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 46 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:29:59,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-26 00:29:59,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2022-11-26 00:29:59,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 58 states have (on average 1.5517241379310345) internal successors, (90), 69 states have internal predecessors, (90), 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-26 00:29:59,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2022-11-26 00:29:59,816 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 22 [2022-11-26 00:29:59,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:29:59,816 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2022-11-26 00:29:59,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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-26 00:29:59,817 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2022-11-26 00:29:59,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-26 00:29:59,820 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:29:59,820 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:29:59,832 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-26 00:30:00,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:30:00,027 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:30:00,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:30:00,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1098712592, now seen corresponding path program 1 times [2022-11-26 00:30:00,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:30:00,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617898850] [2022-11-26 00:30:00,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:30:00,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:30:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:30:00,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:30:00,620 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:30:00,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617898850] [2022-11-26 00:30:00,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617898850] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:30:00,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853798313] [2022-11-26 00:30:00,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:30:00,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:30:00,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:30:00,622 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:30:00,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 00:30:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:30:00,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-26 00:30:00,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:30:02,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:30:02,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:30:05,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:30:05,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853798313] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:30:05,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [647039276] [2022-11-26 00:30:05,023 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-26 00:30:05,023 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:30:05,027 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:30:05,033 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:30:05,034 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:30:13,757 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:30:19,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [647039276] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:30:19,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:30:19,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [3, 7, 8] total 30 [2022-11-26 00:30:19,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223428045] [2022-11-26 00:30:19,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:30:19,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-26 00:30:19,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:30:19,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-26 00:30:19,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=669, Unknown=0, NotChecked=0, Total=992 [2022-11-26 00:30:19,606 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 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-26 00:30:27,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:30:27,931 INFO L93 Difference]: Finished difference Result 174 states and 248 transitions. [2022-11-26 00:30:27,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-26 00:30:27,931 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 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) Word has length 23 [2022-11-26 00:30:27,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:30:27,932 INFO L225 Difference]: With dead ends: 174 [2022-11-26 00:30:27,933 INFO L226 Difference]: Without dead ends: 120 [2022-11-26 00:30:27,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=517, Invalid=1043, Unknown=0, NotChecked=0, Total=1560 [2022-11-26 00:30:27,934 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 71 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:30:27,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 44 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-26 00:30:27,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-26 00:30:27,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2022-11-26 00:30:27,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 101 states have (on average 1.396039603960396) internal successors, (141), 112 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-26 00:30:27,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 141 transitions. [2022-11-26 00:30:27,960 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 141 transitions. Word has length 23 [2022-11-26 00:30:27,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:30:27,960 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 141 transitions. [2022-11-26 00:30:27,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 13 states have internal predecessors, (21), 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-26 00:30:27,960 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 141 transitions. [2022-11-26 00:30:27,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-26 00:30:27,961 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:30:27,961 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:30:27,972 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 00:30:28,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:30:28,168 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:30:28,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:30:28,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1351812139, now seen corresponding path program 1 times [2022-11-26 00:30:28,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:30:28,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926032168] [2022-11-26 00:30:28,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:30:28,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:30:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:30:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:30:28,399 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:30:28,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926032168] [2022-11-26 00:30:28,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926032168] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:30:28,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224586010] [2022-11-26 00:30:28,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:30:28,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:30:28,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:30:28,401 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:30:28,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 00:30:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:30:28,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-26 00:30:28,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:30:28,567 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 00:30:28,567 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:30:28,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224586010] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:30:28,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 00:30:28,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-26 00:30:28,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282772266] [2022-11-26 00:30:28,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:30:28,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:30:28,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:30:28,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:30:28,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:30:28,569 INFO L87 Difference]: Start difference. First operand 113 states and 141 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-26 00:30:28,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:30:28,664 INFO L93 Difference]: Finished difference Result 180 states and 216 transitions. [2022-11-26 00:30:28,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:30:28,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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) Word has length 32 [2022-11-26 00:30:28,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:30:28,666 INFO L225 Difference]: With dead ends: 180 [2022-11-26 00:30:28,666 INFO L226 Difference]: Without dead ends: 125 [2022-11-26 00:30:28,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:30:28,667 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 28 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:30:28,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 147 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:30:28,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-26 00:30:28,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 113. [2022-11-26 00:30:28,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 101 states have (on average 1.3564356435643565) internal successors, (137), 112 states have internal predecessors, (137), 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-26 00:30:28,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 137 transitions. [2022-11-26 00:30:28,700 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 137 transitions. Word has length 32 [2022-11-26 00:30:28,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:30:28,700 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 137 transitions. [2022-11-26 00:30:28,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-26 00:30:28,701 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 137 transitions. [2022-11-26 00:30:28,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-26 00:30:28,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:30:28,702 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:30:28,719 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-26 00:30:28,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-26 00:30:28,902 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:30:28,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:30:28,903 INFO L85 PathProgramCache]: Analyzing trace with hash -249000925, now seen corresponding path program 1 times [2022-11-26 00:30:28,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:30:28,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683485744] [2022-11-26 00:30:28,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:30:28,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:30:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:30:28,961 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-26 00:30:28,961 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:30:28,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683485744] [2022-11-26 00:30:28,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683485744] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:30:28,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:30:28,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:30:28,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224434220] [2022-11-26 00:30:28,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:30:28,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:30:28,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:30:28,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:30:28,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:30:28,963 INFO L87 Difference]: Start difference. First operand 113 states and 137 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-26 00:30:29,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:30:29,023 INFO L93 Difference]: Finished difference Result 188 states and 234 transitions. [2022-11-26 00:30:29,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:30:29,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) Word has length 34 [2022-11-26 00:30:29,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:30:29,026 INFO L225 Difference]: With dead ends: 188 [2022-11-26 00:30:29,026 INFO L226 Difference]: Without dead ends: 134 [2022-11-26 00:30:29,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:30:29,028 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 25 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:30:29,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 67 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:30:29,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-26 00:30:29,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 125. [2022-11-26 00:30:29,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 113 states have (on average 1.345132743362832) internal successors, (152), 124 states have internal predecessors, (152), 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-26 00:30:29,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2022-11-26 00:30:29,058 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 34 [2022-11-26 00:30:29,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:30:29,058 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2022-11-26 00:30:29,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-26 00:30:29,058 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2022-11-26 00:30:29,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-26 00:30:29,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:30:29,059 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:30:29,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-26 00:30:29,060 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:30:29,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:30:29,060 INFO L85 PathProgramCache]: Analyzing trace with hash -2053411338, now seen corresponding path program 1 times [2022-11-26 00:30:29,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:30:29,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345605846] [2022-11-26 00:30:29,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:30:29,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:30:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:30:29,277 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:30:29,277 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:30:29,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345605846] [2022-11-26 00:30:29,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345605846] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:30:29,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079958302] [2022-11-26 00:30:29,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:30:29,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:30:29,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:30:29,280 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:30:29,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 00:30:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:30:29,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-26 00:30:29,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:30:30,936 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:30:30,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:30:32,075 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:30:32,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079958302] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:30:32,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [461518458] [2022-11-26 00:30:32,078 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-26 00:30:32,078 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:30:32,078 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:30:32,079 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:30:32,079 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:30:48,678 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:30:58,549 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3494#(and (<= 0 |ULTIMATE.start_main_~c1~0#1|) (<= 0 ~id3~0) (= ~nomsg~0 ~p1_new~0) (<= 0 ~mode1~0) (<= 1 |ULTIMATE.start_init_~tmp~0#1|) (<= 0 ~id1~0) (= ~p2~0 0) (<= |ULTIMATE.start_init_~tmp~0#1| 1) (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= ~p3_new~0 ~nomsg~0) (<= |ULTIMATE.start_init_#res#1| 1) (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (= |ULTIMATE.start_main_~i2~0#1| 0) (or (and (<= 0 (+ ~p3_old~0 1)) (or (and (not (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|)) (or (= ~st3~0 1) (and (<= 0 ~st3~0) (not (= ~id3~0 |ULTIMATE.start_node3_~m3~0#1|)))) (<= 0 ~send3~0)) (and (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|) (= ~send3~0 |ULTIMATE.start_node3_~m3~0#1|) (<= 0 ~st3~0))) (<= (+ ~p3_old~0 1) 0) (= ~mode3~0 0)) (and (= ~mode3~0 1) (exists ((v_~p3_new~0_48 Int)) (and (<= 0 (+ v_~p3_new~0_48 1)) (= ~p3_old~0 (ite (<= (mod (ite (and (= v_~p3_new~0_48 ~nomsg~0) (not (= ~send3~0 ~nomsg~0))) ~send3~0 v_~p3_new~0_48) 256) 127) (mod (ite (and (= v_~p3_new~0_48 ~nomsg~0) (not (= ~send3~0 ~nomsg~0))) ~send3~0 v_~p3_new~0_48) 256) (+ (mod (ite (and (= v_~p3_new~0_48 ~nomsg~0) (not (= ~send3~0 ~nomsg~0))) ~send3~0 v_~p3_new~0_48) 256) (- 256)))) (<= (+ v_~p3_new~0_48 1) 0))) (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|) (<= 0 ~st3~0) (<= 0 ~send3~0))) (<= |ULTIMATE.start_main_~c1~0#1| 1) (<= ~id1~0 127) (= ~nomsg~0 ~p2_new~0) (<= (+ ~nomsg~0 1) 0) (<= ~mode1~0 1) (<= 1 |ULTIMATE.start_init_#res#1|) (not (<= 0 (+ ~st2~0 ~st1~0 2147483648))) (or (and (= ~mode2~0 0) (<= 0 (+ ~p2_old~0 1)) (or (and (<= 0 ~st2~0) (= ~send2~0 |ULTIMATE.start_node2_~m2~0#1|) (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|)) (and (<= 0 ~send2~0) (or (= ~st2~0 1) (and (not (= |ULTIMATE.start_node2_~m2~0#1| ~id2~0)) (<= 0 ~st2~0))) (not (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|)))) (<= (+ ~p2_old~0 1) 0)) (and (= ~mode2~0 1) (<= 0 ~st2~0) (<= 0 ~send2~0) (= ~nomsg~0 |ULTIMATE.start_node2_~m2~0#1|) (exists ((v_~p2_new~0_56 Int)) (and (= (ite (<= (mod (ite (and (= v_~p2_new~0_56 ~nomsg~0) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_56) 256) 127) (mod (ite (and (= v_~p2_new~0_56 ~nomsg~0) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_56) 256) (+ (- 256) (mod (ite (and (= v_~p2_new~0_56 ~nomsg~0) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_56) 256))) ~p2_old~0) (<= (+ v_~p2_new~0_56 1) 0) (<= 0 (+ v_~p2_new~0_56 1)))))) (<= ~id3~0 127) (<= 0 ~id2~0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 127) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= ~p3~0 0) (= ~p1~0 0) (<= 0 |#StackHeapBarrier|) (<= 0 ~send1~0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-26 00:30:58,549 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:30:58,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:30:58,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 22 [2022-11-26 00:30:58,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238203869] [2022-11-26 00:30:58,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:30:58,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-26 00:30:58,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:30:58,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-26 00:30:58,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=1548, Unknown=0, NotChecked=0, Total=1806 [2022-11-26 00:30:58,552 INFO L87 Difference]: Start difference. First operand 125 states and 152 transitions. Second operand has 23 states, 22 states have (on average 5.136363636363637) internal successors, (113), 23 states have internal predecessors, (113), 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-26 00:30:59,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:30:59,258 INFO L93 Difference]: Finished difference Result 166 states and 185 transitions. [2022-11-26 00:30:59,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-26 00:30:59,259 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.136363636363637) internal successors, (113), 23 states have internal predecessors, (113), 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) Word has length 38 [2022-11-26 00:30:59,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:30:59,260 INFO L225 Difference]: With dead ends: 166 [2022-11-26 00:30:59,260 INFO L226 Difference]: Without dead ends: 163 [2022-11-26 00:30:59,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=407, Invalid=2245, Unknown=0, NotChecked=0, Total=2652 [2022-11-26 00:30:59,263 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 150 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:30:59,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 53 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 00:30:59,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-11-26 00:30:59,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 122. [2022-11-26 00:30:59,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 113 states have (on average 1.2831858407079646) internal successors, (145), 121 states have internal predecessors, (145), 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-26 00:30:59,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2022-11-26 00:30:59,297 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 38 [2022-11-26 00:30:59,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:30:59,299 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2022-11-26 00:30:59,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.136363636363637) internal successors, (113), 23 states have internal predecessors, (113), 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-26 00:30:59,300 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2022-11-26 00:30:59,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-26 00:30:59,303 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:30:59,303 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:30:59,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-26 00:30:59,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-26 00:30:59,509 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:30:59,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:30:59,510 INFO L85 PathProgramCache]: Analyzing trace with hash 768758195, now seen corresponding path program 1 times [2022-11-26 00:30:59,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:30:59,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284458476] [2022-11-26 00:30:59,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:30:59,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:30:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:30:59,742 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:30:59,742 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:30:59,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284458476] [2022-11-26 00:30:59,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284458476] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:30:59,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259633784] [2022-11-26 00:30:59,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:30:59,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:30:59,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:30:59,744 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:30:59,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 00:30:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:30:59,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-26 00:30:59,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:31:01,215 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:31:01,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:31:02,118 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:31:02,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259633784] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:31:02,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1320492851] [2022-11-26 00:31:02,126 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-26 00:31:02,127 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:31:02,127 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:31:02,127 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:31:02,127 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:31:16,791 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:31:25,892 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4139#(and (<= 0 |ULTIMATE.start_main_~c1~0#1|) (<= 0 ~id3~0) (<= 0 (+ ~p3_new~0 1)) (<= 0 ~mode1~0) (<= 1 |ULTIMATE.start_init_~tmp~0#1|) (<= 0 ~id1~0) (= ~p2~0 0) (<= (+ ~p1_new~0 1) 0) (<= |ULTIMATE.start_init_~tmp~0#1| 1) (<= 0 ~mode3~0) (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (<= |ULTIMATE.start_init_#res#1| 1) (<= ~mode2~0 1) (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (= |ULTIMATE.start_main_~i2~0#1| 0) (<= ~mode3~0 1) (<= |ULTIMATE.start_main_~c1~0#1| 1) (<= 0 ~send2~0) (<= ~id1~0 127) (<= ~st1~0 1) (<= 0 (+ ~p2_new~0 1)) (<= (+ ~nomsg~0 1) 0) (<= ~mode1~0 1) (<= (+ ~p2_new~0 1) 0) (<= 1 |ULTIMATE.start_init_#res#1|) (not (<= (+ ~st2~0 ~st1~0) 2147483647)) (<= ~id3~0 127) (<= 0 ~id2~0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= 0 ~mode2~0) (<= ~id2~0 127) (<= 0 ~st3~0) (<= (+ ~p3_new~0 1) 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= ~p3~0 0) (<= 0 (+ ~p1_new~0 1)) (<= 0 ~send3~0) (= ~p1~0 0) (<= 0 |#StackHeapBarrier|) (<= 0 ~send1~0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-26 00:31:25,892 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:31:25,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:31:25,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 22 [2022-11-26 00:31:25,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150047225] [2022-11-26 00:31:25,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:31:25,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-26 00:31:25,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:31:25,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-26 00:31:25,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1550, Unknown=0, NotChecked=0, Total=1806 [2022-11-26 00:31:25,895 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand has 23 states, 22 states have (on average 5.2272727272727275) internal successors, (115), 23 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-26 00:31:27,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:31:27,489 INFO L93 Difference]: Finished difference Result 258 states and 286 transitions. [2022-11-26 00:31:27,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-26 00:31:27,490 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.2272727272727275) internal successors, (115), 23 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) Word has length 39 [2022-11-26 00:31:27,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:31:27,491 INFO L225 Difference]: With dead ends: 258 [2022-11-26 00:31:27,491 INFO L226 Difference]: Without dead ends: 255 [2022-11-26 00:31:27,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=478, Invalid=3304, Unknown=0, NotChecked=0, Total=3782 [2022-11-26 00:31:27,493 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 454 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:31:27,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 111 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-26 00:31:27,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-11-26 00:31:27,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 120. [2022-11-26 00:31:27,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 113 states have (on average 1.2300884955752212) internal successors, (139), 119 states have internal predecessors, (139), 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-26 00:31:27,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 139 transitions. [2022-11-26 00:31:27,528 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 139 transitions. Word has length 39 [2022-11-26 00:31:27,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:31:27,528 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 139 transitions. [2022-11-26 00:31:27,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.2272727272727275) internal successors, (115), 23 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-26 00:31:27,529 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 139 transitions. [2022-11-26 00:31:27,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-26 00:31:27,529 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:31:27,529 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:31:27,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-26 00:31:27,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:31:27,740 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:31:27,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:31:27,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1938299496, now seen corresponding path program 1 times [2022-11-26 00:31:27,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:31:27,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678957702] [2022-11-26 00:31:27,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:31:27,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:31:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:31:28,387 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-26 00:31:28,388 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:31:28,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678957702] [2022-11-26 00:31:28,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678957702] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:31:28,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146756527] [2022-11-26 00:31:28,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:31:28,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:31:28,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:31:28,390 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:31:28,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-26 00:31:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:31:28,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-26 00:31:28,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:31:33,544 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:31:33,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:31:39,313 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:31:39,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146756527] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:31:39,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1198095887] [2022-11-26 00:31:39,316 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-26 00:31:39,316 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:31:39,317 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:31:39,317 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:31:39,317 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:31:54,082 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:32:03,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1198095887] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:32:03,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:32:03,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [3, 9, 9] total 39 [2022-11-26 00:32:03,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106125469] [2022-11-26 00:32:03,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:32:03,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-26 00:32:03,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:32:03,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-26 00:32:03,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=1380, Unknown=0, NotChecked=0, Total=1640 [2022-11-26 00:32:03,157 INFO L87 Difference]: Start difference. First operand 120 states and 139 transitions. Second operand has 21 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 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-26 00:32:23,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:32:23,250 INFO L93 Difference]: Finished difference Result 186 states and 225 transitions. [2022-11-26 00:32:23,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-26 00:32:23,251 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 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) Word has length 40 [2022-11-26 00:32:23,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:32:23,252 INFO L225 Difference]: With dead ends: 186 [2022-11-26 00:32:23,252 INFO L226 Difference]: Without dead ends: 125 [2022-11-26 00:32:23,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 929 ImplicationChecksByTransitivity, 29.8s TimeCoverageRelationStatistics Valid=657, Invalid=2649, Unknown=0, NotChecked=0, Total=3306 [2022-11-26 00:32:23,254 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 164 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:32:23,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 14 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-26 00:32:23,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-26 00:32:23,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 105. [2022-11-26 00:32:23,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 103 states have (on average 1.1262135922330097) internal successors, (116), 104 states have internal predecessors, (116), 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-26 00:32:23,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2022-11-26 00:32:23,286 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 40 [2022-11-26 00:32:23,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:32:23,287 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2022-11-26 00:32:23,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 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-26 00:32:23,287 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2022-11-26 00:32:23,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-26 00:32:23,288 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:32:23,288 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:32:23,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-26 00:32:23,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-26 00:32:23,491 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:32:23,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:32:23,492 INFO L85 PathProgramCache]: Analyzing trace with hash 42258005, now seen corresponding path program 1 times [2022-11-26 00:32:23,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:32:23,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231163831] [2022-11-26 00:32:23,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:23,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:32:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:24,074 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:32:24,074 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:32:24,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231163831] [2022-11-26 00:32:24,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231163831] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:32:24,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470720632] [2022-11-26 00:32:24,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:32:24,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:32:24,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:32:24,076 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:32:24,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-26 00:32:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:32:24,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-26 00:32:24,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:32:29,244 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:32:29,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:32:36,124 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:32:36,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470720632] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:32:36,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1707354602] [2022-11-26 00:32:36,126 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-26 00:32:36,127 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:32:36,127 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:32:36,127 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:32:36,127 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:32:51,302 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:33:00,605 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5599#(and (<= 0 |ULTIMATE.start_main_~c1~0#1|) (<= 0 ~id3~0) (<= 0 (+ ~p3_new~0 1)) (<= 0 ~mode1~0) (<= 1 |ULTIMATE.start_init_~tmp~0#1|) (<= 0 ~id1~0) (= ~p2~0 0) (<= (+ ~p1_new~0 1) 0) (<= |ULTIMATE.start_init_~tmp~0#1| 1) (<= 0 ~mode3~0) (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (<= |ULTIMATE.start_init_#res#1| 1) (<= ~mode2~0 1) (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (= |ULTIMATE.start_main_~i2~0#1| 0) (<= 0 ~st2~0) (<= ~mode3~0 1) (<= |ULTIMATE.start_main_~c1~0#1| 1) (<= 0 ~send2~0) (<= ~id1~0 127) (<= ~st1~0 1) (not (<= (+ ~st3~0 ~st2~0 ~st1~0) 2147483647)) (<= 0 (+ ~p2_new~0 1)) (<= (+ ~nomsg~0 1) 0) (<= ~mode1~0 1) (<= (+ ~p2_new~0 1) 0) (<= 1 |ULTIMATE.start_init_#res#1|) (<= ~id3~0 127) (<= 0 ~id2~0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= 0 ~mode2~0) (<= ~id2~0 127) (<= 0 ~st3~0) (<= (+ ~p3_new~0 1) 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= ~p3~0 0) (<= 0 (+ ~p1_new~0 1)) (<= 0 ~send3~0) (= ~p1~0 0) (<= 0 |#StackHeapBarrier|) (<= 0 ~send1~0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-26 00:33:00,606 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:33:00,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:33:00,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 23 [2022-11-26 00:33:00,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121358010] [2022-11-26 00:33:00,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:33:00,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-26 00:33:00,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:00,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-26 00:33:00,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=1597, Unknown=0, NotChecked=0, Total=1980 [2022-11-26 00:33:00,609 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 25 states, 24 states have (on average 5.125) internal successors, (123), 24 states have internal predecessors, (123), 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-26 00:33:04,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:04,959 INFO L93 Difference]: Finished difference Result 315 states and 351 transitions. [2022-11-26 00:33:04,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-26 00:33:04,960 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.125) internal successors, (123), 24 states have internal predecessors, (123), 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) Word has length 41 [2022-11-26 00:33:04,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:04,961 INFO L225 Difference]: With dead ends: 315 [2022-11-26 00:33:04,961 INFO L226 Difference]: Without dead ends: 259 [2022-11-26 00:33:04,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1533 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=698, Invalid=3592, Unknown=0, NotChecked=0, Total=4290 [2022-11-26 00:33:04,963 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 563 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:04,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 109 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-26 00:33:04,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-11-26 00:33:05,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 169. [2022-11-26 00:33:05,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 167 states have (on average 1.0718562874251496) internal successors, (179), 168 states have internal predecessors, (179), 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-26 00:33:05,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 179 transitions. [2022-11-26 00:33:05,037 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 179 transitions. Word has length 41 [2022-11-26 00:33:05,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:05,038 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 179 transitions. [2022-11-26 00:33:05,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.125) internal successors, (123), 24 states have internal predecessors, (123), 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-26 00:33:05,038 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 179 transitions. [2022-11-26 00:33:05,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-26 00:33:05,038 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:05,039 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:05,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-26 00:33:05,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-26 00:33:05,240 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:33:05,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:05,240 INFO L85 PathProgramCache]: Analyzing trace with hash -596050014, now seen corresponding path program 2 times [2022-11-26 00:33:05,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:05,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330349437] [2022-11-26 00:33:05,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:05,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:06,796 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:06,796 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:06,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330349437] [2022-11-26 00:33:06,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330349437] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:06,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529351972] [2022-11-26 00:33:06,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:33:06,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:06,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:06,799 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:33:06,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-26 00:33:06,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-26 00:33:06,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:33:06,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-26 00:33:07,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:33:13,070 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:13,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:33:21,764 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:21,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529351972] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:33:21,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [989210565] [2022-11-26 00:33:21,766 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-26 00:33:21,766 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:33:21,767 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:33:21,767 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:33:21,767 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:33:35,818 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:33:44,734 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6623#(and (<= 0 |ULTIMATE.start_main_~c1~0#1|) (<= 0 ~id3~0) (<= 0 (+ ~p3_new~0 1)) (<= 0 ~mode1~0) (<= 1 |ULTIMATE.start_init_~tmp~0#1|) (<= 0 ~id1~0) (= ~p2~0 0) (<= (+ ~p1_new~0 1) 0) (<= |ULTIMATE.start_init_~tmp~0#1| 1) (<= 0 ~mode3~0) (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (<= |ULTIMATE.start_init_#res#1| 1) (<= ~mode2~0 1) (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (= |ULTIMATE.start_main_~i2~0#1| 0) (<= ~mode3~0 1) (<= |ULTIMATE.start_main_~c1~0#1| 1) (<= 0 ~send2~0) (<= ~id1~0 127) (<= ~st1~0 1) (<= 0 (+ ~p2_new~0 1)) (<= (+ ~nomsg~0 1) 0) (<= ~mode1~0 1) (<= (+ ~p2_new~0 1) 0) (<= 1 |ULTIMATE.start_init_#res#1|) (not (<= (+ ~st2~0 ~st1~0) 2147483647)) (<= ~id3~0 127) (<= 0 ~id2~0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= 0 ~mode2~0) (<= ~id2~0 127) (<= 0 ~st3~0) (<= (+ ~p3_new~0 1) 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= ~p3~0 0) (<= 0 (+ ~p1_new~0 1)) (<= 0 ~send3~0) (= ~p1~0 0) (<= 0 |#StackHeapBarrier|) (<= 0 ~send1~0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-26 00:33:44,735 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:33:44,735 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:33:44,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 12] total 30 [2022-11-26 00:33:44,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014403622] [2022-11-26 00:33:44,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:33:44,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-26 00:33:44,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:33:44,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-26 00:33:44,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=2170, Unknown=0, NotChecked=0, Total=2652 [2022-11-26 00:33:44,738 INFO L87 Difference]: Start difference. First operand 169 states and 179 transitions. Second operand has 32 states, 31 states have (on average 5.419354838709677) internal successors, (168), 31 states have internal predecessors, (168), 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-26 00:33:46,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:33:46,004 INFO L93 Difference]: Finished difference Result 224 states and 236 transitions. [2022-11-26 00:33:46,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-26 00:33:46,005 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 5.419354838709677) internal successors, (168), 31 states have internal predecessors, (168), 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) Word has length 56 [2022-11-26 00:33:46,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:33:46,006 INFO L225 Difference]: With dead ends: 224 [2022-11-26 00:33:46,006 INFO L226 Difference]: Without dead ends: 223 [2022-11-26 00:33:46,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1522 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=618, Invalid=2688, Unknown=0, NotChecked=0, Total=3306 [2022-11-26 00:33:46,008 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 168 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:33:46,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 150 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-26 00:33:46,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-11-26 00:33:46,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 168. [2022-11-26 00:33:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.0598802395209581) internal successors, (177), 167 states have internal predecessors, (177), 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-26 00:33:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 177 transitions. [2022-11-26 00:33:46,086 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 177 transitions. Word has length 56 [2022-11-26 00:33:46,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:33:46,086 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 177 transitions. [2022-11-26 00:33:46,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 5.419354838709677) internal successors, (168), 31 states have internal predecessors, (168), 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-26 00:33:46,087 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 177 transitions. [2022-11-26 00:33:46,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-11-26 00:33:46,088 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:33:46,088 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:33:46,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-26 00:33:46,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:46,295 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:33:46,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:33:46,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1558908173, now seen corresponding path program 2 times [2022-11-26 00:33:46,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:33:46,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774869781] [2022-11-26 00:33:46,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:33:46,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:33:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:33:50,499 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:33:50,499 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:33:50,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774869781] [2022-11-26 00:33:50,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774869781] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:33:50,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815642701] [2022-11-26 00:33:50,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:33:50,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:33:50,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:33:50,501 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:33:50,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-26 00:33:50,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-26 00:33:50,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:33:50,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-26 00:33:50,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:34:39,359 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:34:39,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:35:56,624 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 4 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:35:56,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815642701] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:35:56,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [430570883] [2022-11-26 00:35:56,626 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-26 00:35:56,626 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:35:56,627 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:35:56,627 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:35:56,627 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:36:11,121 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:36:22,554 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7734#(and (<= 0 |ULTIMATE.start_main_~c1~0#1|) (<= 0 ~id3~0) (<= 0 (+ ~p3_new~0 1)) (<= 0 ~mode1~0) (<= 1 |ULTIMATE.start_init_~tmp~0#1|) (<= 0 ~id1~0) (= ~p2~0 0) (<= (+ ~p1_new~0 1) 0) (<= |ULTIMATE.start_init_~tmp~0#1| 1) (<= 0 ~mode3~0) (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (<= |ULTIMATE.start_init_#res#1| 1) (<= ~mode2~0 1) (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (= |ULTIMATE.start_main_~i2~0#1| 0) (<= 0 ~st2~0) (<= ~mode3~0 1) (<= |ULTIMATE.start_main_~c1~0#1| 1) (<= 0 ~send2~0) (<= ~id1~0 127) (<= ~st1~0 1) (not (<= (+ ~st3~0 ~st2~0 ~st1~0) 2147483647)) (<= 0 (+ ~p2_new~0 1)) (<= (+ ~nomsg~0 1) 0) (<= ~mode1~0 1) (<= (+ ~p2_new~0 1) 0) (<= 1 |ULTIMATE.start_init_#res#1|) (<= ~id3~0 127) (<= 0 ~id2~0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= 0 ~mode2~0) (<= ~id2~0 127) (<= 0 ~st3~0) (<= (+ ~p3_new~0 1) 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= ~p3~0 0) (<= 0 (+ ~p1_new~0 1)) (<= 0 ~send3~0) (= ~p1~0 0) (<= 0 |#StackHeapBarrier|) (<= 0 ~send1~0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-26 00:36:22,554 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:36:22,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:36:22,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19, 22] total 51 [2022-11-26 00:36:22,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016233882] [2022-11-26 00:36:22,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:36:22,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-26 00:36:22,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:36:22,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-26 00:36:22,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=894, Invalid=4362, Unknown=0, NotChecked=0, Total=5256 [2022-11-26 00:36:22,558 INFO L87 Difference]: Start difference. First operand 168 states and 177 transitions. Second operand has 53 states, 52 states have (on average 5.1923076923076925) internal successors, (270), 52 states have internal predecessors, (270), 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-26 00:36:35,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:36:35,734 INFO L93 Difference]: Finished difference Result 371 states and 391 transitions. [2022-11-26 00:36:35,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-26 00:36:35,734 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 5.1923076923076925) internal successors, (270), 52 states have internal predecessors, (270), 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) Word has length 90 [2022-11-26 00:36:35,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:36:35,735 INFO L225 Difference]: With dead ends: 371 [2022-11-26 00:36:35,735 INFO L226 Difference]: Without dead ends: 0 [2022-11-26 00:36:35,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 199 SyntacticMatches, 8 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3809 ImplicationChecksByTransitivity, 38.0s TimeCoverageRelationStatistics Valid=2000, Invalid=8920, Unknown=0, NotChecked=0, Total=10920 [2022-11-26 00:36:35,740 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 605 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:36:35,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 302 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1429 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-26 00:36:35,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-26 00:36:35,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-26 00:36:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-26 00:36:35,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-26 00:36:35,741 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 90 [2022-11-26 00:36:35,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:36:35,741 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-26 00:36:35,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 5.1923076923076925) internal successors, (270), 52 states have internal predecessors, (270), 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-26 00:36:35,742 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-26 00:36:35,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-26 00:36:35,745 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-11-26 00:36:35,746 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-11-26 00:36:35,746 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-11-26 00:36:35,746 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-11-26 00:36:35,746 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-11-26 00:36:35,747 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-11-26 00:36:35,747 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-11-26 00:36:35,747 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-11-26 00:36:35,747 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-11-26 00:36:35,747 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-11-26 00:36:35,748 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-11-26 00:36:35,748 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-11-26 00:36:35,748 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-11-26 00:36:35,748 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-11-26 00:36:35,756 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-26 00:36:35,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-26 00:36:35,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-26 00:36:41,648 WARN L233 SmtUtils]: Spent 5.69s on a formula simplification. DAG size of input: 581 DAG size of output: 575 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-26 00:36:48,951 WARN L233 SmtUtils]: Spent 7.30s on a formula simplification. DAG size of input: 575 DAG size of output: 525 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-26 00:36:59,770 WARN L233 SmtUtils]: Spent 10.81s on a formula simplification. DAG size of input: 554 DAG size of output: 550 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-26 00:37:10,747 WARN L233 SmtUtils]: Spent 8.23s on a formula simplification. DAG size of input: 575 DAG size of output: 234 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-26 00:37:16,921 WARN L233 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 525 DAG size of output: 171 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-26 00:37:23,850 WARN L233 SmtUtils]: Spent 6.92s on a formula simplification. DAG size of input: 550 DAG size of output: 165 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-26 00:37:28,297 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 207) no Hoare annotation was computed. [2022-11-26 00:37:28,297 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-11-26 00:37:28,297 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 211) no Hoare annotation was computed. [2022-11-26 00:37:28,297 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 211) no Hoare annotation was computed. [2022-11-26 00:37:28,298 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 216) no Hoare annotation was computed. [2022-11-26 00:37:28,298 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-26 00:37:28,298 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 216) no Hoare annotation was computed. [2022-11-26 00:37:28,298 INFO L899 garLoopResultBuilder]: For program point L207(line 207) no Hoare annotation was computed. [2022-11-26 00:37:28,298 INFO L899 garLoopResultBuilder]: For program point L207-1(line 207) no Hoare annotation was computed. [2022-11-26 00:37:28,298 INFO L899 garLoopResultBuilder]: For program point L207-2(line 207) no Hoare annotation was computed. [2022-11-26 00:37:28,298 INFO L899 garLoopResultBuilder]: For program point L207-3(line 207) no Hoare annotation was computed. [2022-11-26 00:37:28,298 INFO L899 garLoopResultBuilder]: For program point L207-4(lines 207 226) no Hoare annotation was computed. [2022-11-26 00:37:28,299 INFO L895 garLoopResultBuilder]: At program point L207-5(lines 207 226) the Hoare annotation is: (let ((.cse39 (= ~mode3~0 1)) (.cse20 (= ~mode3~0 0)) (.cse1 (= ~mode2~0 0)) (.cse40 (= ~mode2~0 1))) (let ((.cse19 (= ~mode1~0 0)) (.cse0 (<= 0 |ULTIMATE.start_main_~c1~0#1|)) (.cse2 (<= 0 ~id3~0)) (.cse3 (= ~nomsg~0 ~p1_new~0)) (.cse4 (<= 1 |ULTIMATE.start_init_~tmp~0#1|)) (.cse5 (<= |ULTIMATE.start_check_~tmp~1#1| 1)) (.cse6 (= ~p2~0 0)) (.cse7 (<= |ULTIMATE.start_init_~tmp~0#1| 1)) (.cse8 (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse9 (= ~p3_new~0 ~nomsg~0)) (.cse10 (<= |ULTIMATE.start_init_#res#1| 1)) (.cse11 (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse12 (<= (+ ~st3~0 ~st2~0 ~st1~0) 1)) (.cse13 (= |ULTIMATE.start_main_~i2~0#1| 0)) (.cse14 (<= |ULTIMATE.start_main_~c1~0#1| 1)) (.cse15 (or (= ~st1~0 1) (= ~st1~0 0))) (.cse16 (<= ~id1~0 127)) (.cse18 (<= 1 |ULTIMATE.start_init_#res#1|)) (.cse21 (<= 0 |ULTIMATE.start_check_~tmp~1#1|)) (.cse22 (let ((.cse46 (<= 0 ~st2~0)) (.cse48 (<= 0 ~send2~0))) (or (let ((.cse45 (+ ~p2_old~0 1))) (and .cse1 (<= 0 .cse45) (let ((.cse47 (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|))) (or (and .cse46 (= ~send2~0 |ULTIMATE.start_node2_~m2~0#1|) .cse47) (and .cse48 (or (= ~st2~0 1) (and (not (= |ULTIMATE.start_node2_~m2~0#1| ~id2~0)) .cse46)) (not .cse47)))) (<= .cse45 0))) (and (exists ((v_~p2_new~0_82 Int)) (let ((.cse49 (+ v_~p2_new~0_82 1))) (and (<= .cse49 0) (= (let ((.cse50 (mod (ite (and (= v_~p2_new~0_82 ~nomsg~0) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_82) 256))) (ite (<= .cse50 127) .cse50 (+ (- 256) .cse50))) ~p2_old~0) (<= 0 .cse49)))) .cse40 .cse46 .cse48 (= ~nomsg~0 |ULTIMATE.start_node2_~m2~0#1|))))) (.cse23 (<= ~id3~0 127)) (.cse24 (or (and .cse39 (exists ((v_~p3_new~0_74 Int)) (let ((.cse41 (+ v_~p3_new~0_74 1))) (and (<= 0 .cse41) (<= .cse41 0) (= (let ((.cse42 (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_74 ~nomsg~0)) ~send3~0 v_~p3_new~0_74) 256))) (ite (<= .cse42 127) .cse42 (+ (- 256) .cse42))) ~p3_old~0)))) (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|)) (let ((.cse43 (+ ~p3_old~0 1))) (and (<= 0 .cse43) (<= .cse43 0) (let ((.cse44 (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (or (and .cse44 (= ~send3~0 |ULTIMATE.start_node3_~m3~0#1|)) (and (or (= ~st3~0 1) (not (= ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (not .cse44)))) .cse20)))) (.cse25 (<= 0 ~id2~0)) (.cse26 (= |#NULL.offset| 0)) (.cse27 (<= ~id2~0 127)) (.cse28 (<= 0 ~st3~0)) (.cse29 (<= (+ ~p3_new~0 1) 0)) (.cse30 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse31 (= ~p3~0 0)) (.cse32 (<= 0 (+ ~p1_new~0 1))) (.cse33 (<= 0 ~send3~0)) (.cse34 (= ~p1~0 0)) (.cse35 (<= 0 |#StackHeapBarrier|)) (.cse36 (<= 0 ~send1~0)) (.cse37 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse38 (= |#NULL.base| 0))) (or (let ((.cse17 (+ ~p2_new~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 ~id1~0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= ~nomsg~0 ~p1_old~0) (<= 0 .cse17) (<= .cse17 0) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38)) (and (= |ULTIMATE.start_check_~tmp~1#1| 0) .cse19) (and .cse0 .cse39 .cse2 .cse3 .cse40 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= (+ ~nomsg~0 1) ~id1~0) (= ~mode1~0 1) .cse15 .cse16 (= ~nomsg~0 ~p2_new~0) .cse18 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38)))) [2022-11-26 00:37:28,300 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 207) no Hoare annotation was computed. [2022-11-26 00:37:28,300 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 75) no Hoare annotation was computed. [2022-11-26 00:37:28,301 INFO L895 garLoopResultBuilder]: At program point L59-2(lines 53 78) the Hoare annotation is: (let ((.cse50 (+ ~nomsg~0 1)) (.cse51 (+ ~p2_new~0 1)) (.cse44 (= ~st1~0 0)) (.cse49 (+ ~p3_new~0 1)) (.cse47 (= ~st2~0 0))) (let ((.cse4 (<= 0 |ULTIMATE.start_main_~c1~0#1|)) (.cse0 (or (= ~st2~0 1) .cse47)) (.cse5 (<= 0 ~id3~0)) (.cse6 (<= 0 .cse49)) (.cse9 (<= 1 |ULTIMATE.start_init_~tmp~0#1|)) (.cse10 (<= 0 ~id1~0)) (.cse40 (= ~p2~0 0)) (.cse13 (<= |ULTIMATE.start_init_~tmp~0#1| 1)) (.cse14 (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse15 (<= |ULTIMATE.start_init_#res#1| 1)) (.cse17 (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse42 (= |ULTIMATE.start_main_~i2~0#1| 0)) (.cse1 (<= |ULTIMATE.start_main_~c1~0#1| 1)) (.cse2 (<= 0 ~send2~0)) (.cse43 (= ~mode1~0 1)) (.cse3 (or (= ~st1~0 1) .cse44)) (.cse22 (<= ~id1~0 127)) (.cse45 (= ~nomsg~0 ~p1_old~0)) (.cse23 (<= 0 .cse51)) (.cse46 (<= .cse50 0)) (.cse24 (<= .cse51 0)) (.cse25 (<= 1 |ULTIMATE.start_init_#res#1|)) (.cse26 (<= ~id3~0 127)) (.cse27 (<= 0 ~id2~0)) (.cse28 (= |#NULL.offset| 0)) (.cse48 (<= 0 .cse50)) (.cse29 (<= ~id2~0 127)) (.cse30 (<= 0 ~st3~0)) (.cse31 (<= .cse49 0)) (.cse32 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse33 (= ~p3~0 0)) (.cse34 (<= 0 ~send3~0)) (.cse35 (= ~p1~0 0)) (.cse36 (<= 0 |#StackHeapBarrier|)) (.cse37 (<= 0 ~send1~0)) (.cse38 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse39 (= |#NULL.base| 0))) (or (let ((.cse21 (+ ~p1_new~0 1))) (and (= ~mode3~0 1) .cse0 (= ~nomsg~0 ~p1_new~0) (= ~mode2~0 1) (<= |ULTIMATE.start_check_~tmp~1#1| 1) .cse1 .cse2 .cse3 (let ((.cse7 (<= |ULTIMATE.start_main_~i2~0#1| 0)) (.cse11 (<= 0 |ULTIMATE.start_main_~i2~0#1|)) (.cse12 (<= .cse21 0)) (.cse18 (<= 0 ~p2~0)) (.cse20 (<= ~p2~0 0))) (or (let ((.cse16 (+ ~p3_old~0 1)) (.cse19 (+ ~p2_old~0 1)) (.cse8 (+ ~p1_old~0 1))) (and .cse4 (<= ~send3~0 127) .cse5 .cse6 (<= ~st3~0 0) .cse7 (<= 0 .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 (<= ~send1~0 127) .cse14 (<= ~st1~0 0) .cse15 (<= 0 .cse16) .cse17 .cse18 (<= 0 .cse19) (<= .cse16 0) (<= ~send2~0 127) (<= ~st2~0 0) .cse20 (<= |ULTIMATE.start_main_~c1~0#1| 0) (<= .cse19 0) (<= .cse8 0))) (and .cse4 .cse5 .cse6 .cse7 (<= |ULTIMATE.start_assert_#in~arg#1| 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 0 |ULTIMATE.start_assert_~arg#1|) .cse17 .cse18 (<= |ULTIMATE.start_assert_~arg#1| 1) (<= 0 |ULTIMATE.start_check_#res#1|) .cse20 (<= |ULTIMATE.start_check_#res#1| 1) (<= 0 |ULTIMATE.start_assert_#in~arg#1|)))) .cse22 .cse23 .cse24 .cse25 (= ~mode1~0 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|) .cse26 (<= ~st3~0 1) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 (<= 0 .cse21) .cse34 .cse35 .cse36 .cse37 .cse38 .cse39)) (let ((.cse41 (+ ~st3~0 ~st1~0))) (and .cse4 .cse6 .cse9 (= (mod ~mode2~0 256) 0) .cse40 .cse13 .cse14 (= ~send3~0 ~id3~0) .cse15 (not (= ~id3~0 ~id2~0)) (<= 0 .cse41) .cse17 (not (= ~id1~0 ~id3~0)) .cse42 (= (* 256 (div ~mode3~0 256)) ~mode3~0) .cse1 .cse43 .cse22 .cse44 (not (= ~id1~0 ~id2~0)) .cse45 .cse23 .cse46 .cse24 .cse25 (= ~send1~0 ~id1~0) (<= .cse41 0) (<= ~r1~0 (* (div ~r1~0 256) 256)) .cse26 .cse27 .cse28 .cse47 .cse48 .cse29 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 (= ~send2~0 ~id2~0) .cse39)) (and .cse4 (= ~mode2~0 0) .cse0 .cse5 .cse6 .cse9 .cse10 .cse40 .cse13 .cse14 .cse15 (= ~nomsg~0 ~p2_old~0) .cse17 (<= (+ ~st3~0 ~st2~0 ~st1~0) 1) .cse42 .cse1 .cse2 .cse43 .cse3 .cse22 .cse45 .cse23 .cse46 .cse24 .cse25 (= ~mode3~0 0) .cse26 .cse27 .cse28 .cse48 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39)))) [2022-11-26 00:37:28,301 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 223) no Hoare annotation was computed. [2022-11-26 00:37:28,302 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 211) no Hoare annotation was computed. [2022-11-26 00:37:28,302 INFO L899 garLoopResultBuilder]: For program point L60(line 60) no Hoare annotation was computed. [2022-11-26 00:37:28,302 INFO L899 garLoopResultBuilder]: For program point L60-1(line 60) no Hoare annotation was computed. [2022-11-26 00:37:28,302 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 211) no Hoare annotation was computed. [2022-11-26 00:37:28,304 INFO L895 garLoopResultBuilder]: At program point L259-2(lines 259 273) the Hoare annotation is: (let ((.cse83 (+ ~p2_old~0 1)) (.cse84 (+ ~p3_old~0 1)) (.cse68 (+ ~p1_new~0 1)) (.cse69 (+ ~p3_new~0 1)) (.cse73 (+ ~p1_old~0 1))) (let ((.cse71 (+ ~p2_new~0 1)) (.cse70 (+ ~nomsg~0 1)) (.cse37 (<= ~st3~0 0)) (.cse45 (<= ~st1~0 0)) (.cse50 (<= 0 ~st1~0)) (.cse65 (<= |ULTIMATE.start_main_~c1~0#1| 0)) (.cse67 (<= .cse73 0)) (.cse61 (<= 0 |ULTIMATE.start_main_~c1~0#1|)) (.cse35 (<= 0 .cse69)) (.cse38 (<= |ULTIMATE.start_main_~i2~0#1| 0)) (.cse39 (<= |ULTIMATE.start_assert_#in~arg#1| 1)) (.cse40 (<= 1 |ULTIMATE.start_init_~tmp~0#1|)) (.cse41 (<= 0 |ULTIMATE.start_main_~i2~0#1|)) (.cse42 (<= .cse68 0)) (.cse43 (<= |ULTIMATE.start_init_~tmp~0#1| 1)) (.cse44 (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse46 (<= |ULTIMATE.start_init_#res#1| 1)) (.cse48 (<= 0 |ULTIMATE.start_assert_~arg#1|)) (.cse49 (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse52 (<= 0 ~p2~0)) (.cse54 (<= |ULTIMATE.start_assert_~arg#1| 1)) (.cse56 (<= ~p2~0 0)) (.cse58 (<= |ULTIMATE.start_check_#res#1| 1)) (.cse60 (<= 0 |ULTIMATE.start_assert_#in~arg#1|)) (.cse30 (= ~mode3~0 1)) (.cse62 (<= 0 .cse84)) (.cse64 (<= .cse84 0)) (.cse10 (= ~mode3~0 0)) (.cse0 (= ~mode2~0 0)) (.cse63 (<= 0 .cse83)) (.cse66 (<= .cse83 0)) (.cse31 (= ~mode2~0 1))) (let ((.cse2 (<= (+ ~st3~0 ~st2~0 ~st1~0) 1)) (.cse4 (or (= ~st1~0 1) (= ~st1~0 0))) (.cse11 (<= 0 |ULTIMATE.start_check_~tmp~1#1|)) (.cse12 (let ((.cse78 (<= 0 ~st2~0)) (.cse80 (<= 0 ~send2~0))) (or (and .cse0 .cse63 (let ((.cse79 (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|))) (or (and .cse78 (= ~send2~0 |ULTIMATE.start_node2_~m2~0#1|) .cse79) (and .cse80 (or (= ~st2~0 1) (and (not (= |ULTIMATE.start_node2_~m2~0#1| ~id2~0)) .cse78)) (not .cse79)))) .cse66) (and (exists ((v_~p2_new~0_82 Int)) (let ((.cse81 (+ v_~p2_new~0_82 1))) (and (<= .cse81 0) (= (let ((.cse82 (mod (ite (and (= v_~p2_new~0_82 ~nomsg~0) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_82) 256))) (ite (<= .cse82 127) .cse82 (+ (- 256) .cse82))) ~p2_old~0) (<= 0 .cse81)))) .cse31 .cse78 .cse80 (= ~nomsg~0 |ULTIMATE.start_node2_~m2~0#1|))))) (.cse14 (or (and .cse30 (exists ((v_~p3_new~0_74 Int)) (let ((.cse75 (+ v_~p3_new~0_74 1))) (and (<= 0 .cse75) (<= .cse75 0) (= (let ((.cse76 (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_74 ~nomsg~0)) ~send3~0 v_~p3_new~0_74) 256))) (ite (<= .cse76 127) .cse76 (+ (- 256) .cse76))) ~p3_old~0)))) (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|)) (and .cse62 .cse64 (let ((.cse77 (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (or (and .cse77 (= ~send3~0 |ULTIMATE.start_node3_~m3~0#1|)) (and (or (= ~st3~0 1) (not (= ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (not .cse77)))) .cse10))) (.cse16 (= |#NULL.offset| 0)) (.cse21 (= ~p3~0 0)) (.cse24 (let ((.cse72 (<= 0 ~id3~0)) (.cse74 (<= 0 ~id1~0))) (or (and .cse61 (<= ~send3~0 127) .cse72 .cse35 .cse37 .cse38 (<= 0 .cse73) .cse40 .cse74 .cse41 .cse42 .cse43 (<= ~send1~0 127) .cse44 .cse45 .cse46 .cse49 .cse50 .cse52 .cse64 (<= ~send2~0 127) (<= ~st2~0 0) .cse56 .cse65 .cse66 .cse67) (and .cse61 .cse72 .cse35 .cse38 .cse39 .cse40 .cse74 .cse41 .cse42 .cse43 .cse44 .cse46 .cse48 .cse49 .cse52 .cse54 (<= 0 |ULTIMATE.start_check_#res#1|) .cse56 .cse58 .cse60)))) (.cse25 (= ~p1~0 0)) (.cse29 (= |#NULL.base| 0)) (.cse1 (<= |ULTIMATE.start_check_~tmp~1#1| 1)) (.cse3 (<= |ULTIMATE.start_main_~c1~0#1| 1)) (.cse32 (<= .cse70 0)) (.cse5 (<= ~id1~0 127)) (.cse7 (<= 0 .cse71)) (.cse8 (<= .cse71 0)) (.cse9 (<= 1 |ULTIMATE.start_init_#res#1|)) (.cse13 (<= ~id3~0 127)) (.cse33 (<= 0 .cse70)) (.cse17 (<= ~id2~0 127)) (.cse18 (<= 0 ~st3~0)) (.cse19 (<= .cse69 0)) (.cse20 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse22 (<= 0 .cse68)) (.cse23 (<= 0 ~send3~0)) (.cse26 (<= 0 |#StackHeapBarrier|)) (.cse27 (<= 0 ~send1~0)) (.cse28 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse6 (= ~nomsg~0 ~p1_old~0)) (.cse15 (<= 0 ~id2~0))) (or (and .cse0 .cse1 (= ~p3_new~0 ~nomsg~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~mode1~0 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (and .cse30 .cse31 .cse1 .cse2 .cse3 (= ~mode1~0 1) .cse4 .cse5 .cse7 .cse32 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse33 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (and (= (mod ~mode2~0 256) 0) (= ~send3~0 ~id3~0) (not (= ~id3~0 ~id2~0)) (= (mod ~mode1~0 256) 0) (not (= ~id1~0 ~id3~0)) (let ((.cse34 (<= ~p3~0 0)) (.cse36 (<= 0 |#NULL.base|)) (.cse47 (<= |#NULL.offset| 0)) (.cse51 (<= ~p1~0 0)) (.cse53 (<= 0 ~p3~0)) (.cse55 (<= |#NULL.base| 0)) (.cse57 (<= 0 |#NULL.offset|)) (.cse59 (<= 0 ~p1~0))) (or (and .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse1 (<= 1 |ULTIMATE.start_check_#res#1|) .cse41 .cse42 .cse43 (<= 0 ~mode3~0) .cse44 .cse45 .cse46 .cse47 .cse48 (<= ~mode2~0 1) .cse49 .cse50 .cse51 (<= ~mode3~0 1) .cse52 .cse53 .cse3 (<= 1 |ULTIMATE.start_check_~tmp~1#1|) (<= 1 |ULTIMATE.start_main_~c1~0#1|) .cse5 .cse7 .cse54 .cse32 (<= ~mode1~0 1) .cse8 .cse9 .cse55 .cse13 .cse33 .cse56 (<= 0 ~mode2~0) .cse17 .cse18 .cse19 .cse57 .cse20 .cse22 .cse23 .cse58 .cse59 .cse26 .cse27 .cse28 .cse60) (and .cse61 .cse34 .cse35 .cse36 .cse37 .cse38 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse62 .cse47 .cse49 .cse50 .cse51 .cse52 .cse53 .cse63 .cse5 .cse64 .cse7 .cse8 .cse9 .cse55 .cse13 .cse33 .cse56 .cse17 .cse18 .cse19 .cse57 .cse20 .cse65 .cse66 .cse22 .cse67 .cse23 .cse59 .cse26 .cse27 .cse28))) (= (* 256 (div ~mode3~0 256)) ~mode3~0) (not (= ~id1~0 ~id2~0)) .cse6 (= ~send1~0 ~id1~0) (<= ~r1~0 (* (div ~r1~0 256) 256)) .cse15 (= ~st2~0 0) (= ~send2~0 ~id2~0)))))) [2022-11-26 00:37:28,304 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 60) no Hoare annotation was computed. [2022-11-26 00:37:28,304 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 60) no Hoare annotation was computed. [2022-11-26 00:37:28,304 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-11-26 00:37:28,304 INFO L899 garLoopResultBuilder]: For program point L211-1(line 211) no Hoare annotation was computed. [2022-11-26 00:37:28,305 INFO L899 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2022-11-26 00:37:28,305 INFO L899 garLoopResultBuilder]: For program point L211-3(line 211) no Hoare annotation was computed. [2022-11-26 00:37:28,305 INFO L899 garLoopResultBuilder]: For program point L211-4(lines 211 223) no Hoare annotation was computed. [2022-11-26 00:37:28,306 INFO L895 garLoopResultBuilder]: At program point L212(lines 208 223) the Hoare annotation is: (let ((.cse39 (+ ~p1_new~0 1)) (.cse37 (= ~mode3~0 1)) (.cse19 (= ~mode3~0 0)) (.cse1 (= ~mode2~0 0)) (.cse38 (= ~mode2~0 1)) (.cse50 (+ ~p2_new~0 1))) (let ((.cse0 (<= 0 |ULTIMATE.start_main_~c1~0#1|)) (.cse2 (<= 0 ~id3~0)) (.cse3 (<= 1 |ULTIMATE.start_init_~tmp~0#1|)) (.cse4 (<= 0 ~id1~0)) (.cse5 (= ~p2~0 0)) (.cse6 (<= |ULTIMATE.start_init_~tmp~0#1| 1)) (.cse7 (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse8 (= ~p3_new~0 ~nomsg~0)) (.cse9 (<= |ULTIMATE.start_init_#res#1| 1)) (.cse10 (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse11 (<= (+ ~st3~0 ~st2~0 ~st1~0) 1)) (.cse12 (= |ULTIMATE.start_main_~i2~0#1| 0)) (.cse13 (<= |ULTIMATE.start_main_~c1~0#1| 1)) (.cse14 (or (= ~st1~0 1) (= ~st1~0 0))) (.cse15 (<= ~id1~0 127)) (.cse16 (<= 0 .cse50)) (.cse17 (<= .cse50 0)) (.cse18 (<= 1 |ULTIMATE.start_init_#res#1|)) (.cse20 (let ((.cse45 (<= 0 ~st2~0)) (.cse47 (<= 0 ~send2~0))) (or (let ((.cse44 (+ ~p2_old~0 1))) (and .cse1 (<= 0 .cse44) (let ((.cse46 (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|))) (or (and .cse45 (= ~send2~0 |ULTIMATE.start_node2_~m2~0#1|) .cse46) (and .cse47 (or (= ~st2~0 1) (and (not (= |ULTIMATE.start_node2_~m2~0#1| ~id2~0)) .cse45)) (not .cse46)))) (<= .cse44 0))) (and (exists ((v_~p2_new~0_82 Int)) (let ((.cse48 (+ v_~p2_new~0_82 1))) (and (<= .cse48 0) (= (let ((.cse49 (mod (ite (and (= v_~p2_new~0_82 ~nomsg~0) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_82) 256))) (ite (<= .cse49 127) .cse49 (+ (- 256) .cse49))) ~p2_old~0) (<= 0 .cse48)))) .cse38 .cse45 .cse47 (= ~nomsg~0 |ULTIMATE.start_node2_~m2~0#1|))))) (.cse21 (<= ~id3~0 127)) (.cse22 (or (and .cse37 (exists ((v_~p3_new~0_74 Int)) (let ((.cse40 (+ v_~p3_new~0_74 1))) (and (<= 0 .cse40) (<= .cse40 0) (= (let ((.cse41 (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_74 ~nomsg~0)) ~send3~0 v_~p3_new~0_74) 256))) (ite (<= .cse41 127) .cse41 (+ (- 256) .cse41))) ~p3_old~0)))) (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|)) (let ((.cse42 (+ ~p3_old~0 1))) (and (<= 0 .cse42) (<= .cse42 0) (let ((.cse43 (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (or (and .cse43 (= ~send3~0 |ULTIMATE.start_node3_~m3~0#1|)) (and (or (= ~st3~0 1) (not (= ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (not .cse43)))) .cse19)))) (.cse23 (<= 0 ~id2~0)) (.cse24 (= |#NULL.offset| 0)) (.cse25 (<= ~id2~0 127)) (.cse26 (<= 0 ~st3~0)) (.cse27 (<= (+ ~p3_new~0 1) 0)) (.cse28 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse29 (= ~p3~0 0)) (.cse30 (<= 0 .cse39)) (.cse31 (<= 0 ~send3~0)) (.cse32 (= ~p1~0 0)) (.cse33 (<= 0 |#StackHeapBarrier|)) (.cse34 (<= 0 ~send1~0)) (.cse35 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse36 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 (= ~nomsg~0 ~p1_new~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~nomsg~0 ~p1_old~0) .cse16 .cse17 .cse18 (= ~mode1~0 0) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36) (and .cse0 .cse37 .cse2 .cse38 .cse3 .cse4 .cse5 (<= .cse39 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~mode1~0 1) .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 (<= 0 (+ ~nomsg~0 1)) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36)))) [2022-11-26 00:37:28,306 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 216) no Hoare annotation was computed. [2022-11-26 00:37:28,306 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 216) no Hoare annotation was computed. [2022-11-26 00:37:28,307 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 207) no Hoare annotation was computed. [2022-11-26 00:37:28,307 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 207) no Hoare annotation was computed. [2022-11-26 00:37:28,307 INFO L899 garLoopResultBuilder]: For program point L216(line 216) no Hoare annotation was computed. [2022-11-26 00:37:28,307 INFO L899 garLoopResultBuilder]: For program point L216-1(line 216) no Hoare annotation was computed. [2022-11-26 00:37:28,307 INFO L899 garLoopResultBuilder]: For program point L216-2(line 216) no Hoare annotation was computed. [2022-11-26 00:37:28,307 INFO L899 garLoopResultBuilder]: For program point L216-3(line 216) no Hoare annotation was computed. [2022-11-26 00:37:28,311 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:37:28,313 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 00:37:28,325 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,326 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,326 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,327 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,327 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,327 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,328 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,328 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,328 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,329 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,329 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,329 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,330 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,330 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,330 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,331 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,331 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,332 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,332 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,332 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,333 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,333 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,333 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,334 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,334 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,334 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,335 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,335 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,335 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,335 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,336 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,336 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,350 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,351 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,351 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,352 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,352 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,352 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,353 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,353 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,353 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,353 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,354 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,354 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,354 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,355 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,355 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,355 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,356 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,356 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,357 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,357 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,357 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,358 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,358 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,358 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,359 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,359 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,359 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,359 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,360 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,360 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,360 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,361 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,369 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,369 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,370 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,370 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,370 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,370 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,371 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,371 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,371 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,372 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,372 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,372 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,373 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,373 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,373 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,374 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,374 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,374 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,375 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,375 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,375 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,376 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,376 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,376 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,377 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,377 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,377 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,377 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,378 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,378 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,378 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,379 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,382 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,382 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,383 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,383 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,383 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,383 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,384 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,384 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,384 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,385 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,385 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,385 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,386 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,386 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,386 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,386 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,387 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,387 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,388 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,388 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,388 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,389 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,389 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,389 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,389 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,390 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,390 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,390 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,391 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,391 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,391 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,391 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,399 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,400 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,400 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,400 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,401 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,401 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,401 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,402 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,402 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,402 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,403 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,403 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,403 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,403 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,404 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,404 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,404 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,405 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,405 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,405 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,406 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,406 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,406 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,406 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,407 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,407 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,407 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,408 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,408 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,408 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,408 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,409 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,411 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,412 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,412 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,412 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,413 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,413 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,413 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,413 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,414 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,414 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,414 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,415 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,415 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,415 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,415 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,416 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,416 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,416 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,417 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,417 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,417 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,418 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,418 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,418 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,418 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,419 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,419 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,419 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,420 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,420 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,420 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,420 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:37:28 BoogieIcfgContainer [2022-11-26 00:37:28,423 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 00:37:28,424 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 00:37:28,424 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 00:37:28,424 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 00:37:28,425 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:29:53" (3/4) ... [2022-11-26 00:37:28,428 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-26 00:37:28,439 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2022-11-26 00:37:28,440 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-11-26 00:37:28,440 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-26 00:37:28,441 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-26 00:37:28,467 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((mode2 == 0 && tmp <= 1) && p3_new == nomsg) && st3 + st2 + st1 <= 1) && c1 <= 1) && (st1 == 1 || st1 == 0)) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && mode3 == 0) && 0 <= tmp) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || (((((\exists v_~p2_new~0_82 : int :: (v_~p2_new~0_82 + 1 <= 0 && (if (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 <= 127 then (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 else -256 + (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256) == p2_\old) && 0 <= v_~p2_new~0_82 + 1) && mode2 == 1) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && id3 <= 127) && (((mode3 == 1 && (\exists v_~p3_new~0_74 : int :: (0 <= v_~p3_new~0_74 + 1 && v_~p3_new~0_74 + 1 <= 0) && (if (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256) == p3_\old)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && 0 <= id2) && #NULL == 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && ((((((((((((((((((((((((((0 <= c1 && send3 <= 127) && 0 <= id3) && 0 <= p3_new + 1) && st3 <= 0) && i2 <= 0) && 0 <= p1_\old + 1) && 1 <= tmp) && 0 <= id1) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && send1 <= 127) && 1 <= cond) && st1 <= 0) && \result <= 1) && 1 <= \old(cond)) && 0 <= st1) && 0 <= p2) && p3_\old + 1 <= 0) && send2 <= 127) && st2 <= 0) && p2 <= 0) && c1 <= 0) && p2_\old + 1 <= 0) && p1_\old + 1 <= 0) || (((((((((((((((((((0 <= c1 && 0 <= id3) && 0 <= p3_new + 1) && i2 <= 0) && \old(arg) <= 1) && 1 <= tmp) && 0 <= id1) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && \result <= 1) && 0 <= arg) && 1 <= \old(cond)) && 0 <= p2) && arg <= 1) && 0 <= \result) && p2 <= 0) && \result <= 1) && 0 <= \old(arg)))) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) || (((((((((((((((((((((((((((((((mode3 == 1 && mode2 == 1) && tmp <= 1) && st3 + st2 + st1 <= 1) && c1 <= 1) && mode1 == 1) && (st1 == 1 || st1 == 0)) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && 0 <= tmp) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || (((((\exists v_~p2_new~0_82 : int :: (v_~p2_new~0_82 + 1 <= 0 && (if (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 <= 127 then (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 else -256 + (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256) == p2_\old) && 0 <= v_~p2_new~0_82 + 1) && mode2 == 1) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && id3 <= 127) && (((mode3 == 1 && (\exists v_~p3_new~0_74 : int :: (0 <= v_~p3_new~0_74 + 1 && v_~p3_new~0_74 + 1 <= 0) && (if (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256) == p3_\old)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && ((((((((((((((((((((((((((0 <= c1 && send3 <= 127) && 0 <= id3) && 0 <= p3_new + 1) && st3 <= 0) && i2 <= 0) && 0 <= p1_\old + 1) && 1 <= tmp) && 0 <= id1) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && send1 <= 127) && 1 <= cond) && st1 <= 0) && \result <= 1) && 1 <= \old(cond)) && 0 <= st1) && 0 <= p2) && p3_\old + 1 <= 0) && send2 <= 127) && st2 <= 0) && p2 <= 0) && c1 <= 0) && p2_\old + 1 <= 0) && p1_\old + 1 <= 0) || (((((((((((((((((((0 <= c1 && 0 <= id3) && 0 <= p3_new + 1) && i2 <= 0) && \old(arg) <= 1) && 1 <= tmp) && 0 <= id1) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && \result <= 1) && 0 <= arg) && 1 <= \old(cond)) && 0 <= p2) && arg <= 1) && 0 <= \result) && p2 <= 0) && \result <= 1) && 0 <= \old(arg)))) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0)) || (((((((((((((mode2 % 256 == 0 && send3 == id3) && !(id3 == id2)) && mode1 % 256 == 0) && !(id1 == id3)) && (((((((((((((((((((((((((((((((((((((((((((((((((((((p3 <= 0 && 0 <= p3_new + 1) && 0 <= #NULL) && st3 <= 0) && i2 <= 0) && \old(arg) <= 1) && 1 <= tmp) && tmp <= 1) && 1 <= \result) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && st1 <= 0) && \result <= 1) && #NULL <= 0) && 0 <= arg) && mode2 <= 1) && 1 <= \old(cond)) && 0 <= st1) && p1 <= 0) && mode3 <= 1) && 0 <= p2) && 0 <= p3) && c1 <= 1) && 1 <= tmp) && 1 <= c1) && id1 <= 127) && 0 <= p2_new + 1) && arg <= 1) && nomsg + 1 <= 0) && mode1 <= 1) && p2_new + 1 <= 0) && 1 <= \result) && #NULL <= 0) && id3 <= 127) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && 0 <= #NULL) && \old(cond) <= 1) && 0 <= p1_new + 1) && 0 <= send3) && \result <= 1) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && 0 <= \old(arg)) || (((((((((((((((((((((((((((((((((((((((((((0 <= c1 && p3 <= 0) && 0 <= p3_new + 1) && 0 <= #NULL) && st3 <= 0) && i2 <= 0) && 1 <= tmp) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && st1 <= 0) && \result <= 1) && 0 <= p3_\old + 1) && #NULL <= 0) && 1 <= \old(cond)) && 0 <= st1) && p1 <= 0) && 0 <= p2) && 0 <= p3) && 0 <= p2_\old + 1) && id1 <= 127) && p3_\old + 1 <= 0) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && #NULL <= 0) && id3 <= 127) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && 0 <= #NULL) && \old(cond) <= 1) && c1 <= 0) && p2_\old + 1 <= 0) && 0 <= p1_new + 1) && p1_\old + 1 <= 0) && 0 <= send3) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1))) && 256 * (mode3 / 256) == mode3) && !(id1 == id2)) && nomsg == p1_\old) && send1 == id1) && r1 <= r1 / 256 * 256) && 0 <= id2) && st2 == 0) && send2 == id2) [2022-11-26 00:37:28,468 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((mode3 == 1 && (st2 == 1 || st2 == 0)) && nomsg == p1_new) && mode2 == 1) && tmp <= 1) && c1 <= 1) && 0 <= send2) && (st1 == 1 || st1 == 0)) && (((((((((((((((((((((((((((0 <= c1 && send3 <= 127) && 0 <= id3) && 0 <= p3_new + 1) && st3 <= 0) && i2 <= 0) && 0 <= p1_\old + 1) && 1 <= tmp) && 0 <= id1) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && send1 <= 127) && 1 <= cond) && st1 <= 0) && \result <= 1) && 0 <= p3_\old + 1) && 1 <= \old(cond)) && 0 <= p2) && 0 <= p2_\old + 1) && p3_\old + 1 <= 0) && send2 <= 127) && st2 <= 0) && p2 <= 0) && c1 <= 0) && p2_\old + 1 <= 0) && p1_\old + 1 <= 0) || (((((((((((((((((((0 <= c1 && 0 <= id3) && 0 <= p3_new + 1) && i2 <= 0) && \old(arg) <= 1) && 1 <= tmp) && 0 <= id1) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && \result <= 1) && 0 <= arg) && 1 <= \old(cond)) && 0 <= p2) && arg <= 1) && 0 <= \result) && p2 <= 0) && \result <= 1) && 0 <= \old(arg)))) && id1 <= 127) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && 0 <= tmp) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= p3_new + 1) && 1 <= tmp) && mode2 % 256 == 0) && p2 == 0) && tmp <= 1) && 1 <= cond) && send3 == id3) && \result <= 1) && !(id3 == id2)) && 0 <= st3 + st1) && 1 <= \old(cond)) && !(id1 == id3)) && i2 == 0) && 256 * (mode3 / 256) == mode3) && c1 <= 1) && mode1 == 1) && id1 <= 127) && st1 == 0) && !(id1 == id2)) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && send1 == id1) && st3 + st1 <= 0) && r1 <= r1 / 256 * 256) && id3 <= 127) && 0 <= id2) && #NULL == 0) && st2 == 0) && 0 <= nomsg + 1) && id2 <= 127) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && send2 == id2) && #NULL == 0)) || ((((((((((((((((((((((((((((((((((((((((0 <= c1 && mode2 == 0) && (st2 == 1 || st2 == 0)) && 0 <= id3) && 0 <= p3_new + 1) && 1 <= tmp) && 0 <= id1) && p2 == 0) && tmp <= 1) && 1 <= cond) && \result <= 1) && nomsg == p2_\old) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && i2 == 0) && c1 <= 1) && 0 <= send2) && mode1 == 1) && (st1 == 1 || st1 == 0)) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && mode3 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) [2022-11-26 00:37:28,469 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((0 <= c1 && mode2 == 0) && 0 <= id3) && nomsg == p1_new) && 1 <= tmp) && 0 <= id1) && p2 == 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && i2 == 0) && c1 <= 1) && (st1 == 1 || st1 == 0)) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && mode3 == 0) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || (((((\exists v_~p2_new~0_82 : int :: (v_~p2_new~0_82 + 1 <= 0 && (if (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 <= 127 then (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 else -256 + (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256) == p2_\old) && 0 <= v_~p2_new~0_82 + 1) && mode2 == 1) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && id3 <= 127) && (((mode3 == 1 && (\exists v_~p3_new~0_74 : int :: (0 <= v_~p3_new~0_74 + 1 && v_~p3_new~0_74 + 1 <= 0) && (if (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256) == p3_\old)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && 0 <= id2) && #NULL == 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((((0 <= c1 && mode3 == 1) && 0 <= id3) && mode2 == 1) && 1 <= tmp) && 0 <= id1) && p2 == 0) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && i2 == 0) && c1 <= 1) && mode1 == 1) && (st1 == 1 || st1 == 0)) && id1 <= 127) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || (((((\exists v_~p2_new~0_82 : int :: (v_~p2_new~0_82 + 1 <= 0 && (if (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 <= 127 then (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 else -256 + (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256) == p2_\old) && 0 <= v_~p2_new~0_82 + 1) && mode2 == 1) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && id3 <= 127) && (((mode3 == 1 && (\exists v_~p3_new~0_74 : int :: (0 <= v_~p3_new~0_74 + 1 && v_~p3_new~0_74 + 1 <= 0) && (if (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256) == p3_\old)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) [2022-11-26 00:37:28,469 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((0 <= c1 && mode2 == 0) && 0 <= id3) && nomsg == p1_new) && 1 <= tmp) && tmp <= 1) && 0 <= id1) && p2 == 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && i2 == 0) && c1 <= 1) && (st1 == 1 || st1 == 0)) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && mode3 == 0) && 0 <= tmp) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || (((((\exists v_~p2_new~0_82 : int :: (v_~p2_new~0_82 + 1 <= 0 && (if (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 <= 127 then (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 else -256 + (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256) == p2_\old) && 0 <= v_~p2_new~0_82 + 1) && mode2 == 1) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && id3 <= 127) && (((mode3 == 1 && (\exists v_~p3_new~0_74 : int :: (0 <= v_~p3_new~0_74 + 1 && v_~p3_new~0_74 + 1 <= 0) && (if (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256) == p3_\old)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && 0 <= id2) && #NULL == 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) || (tmp == 0 && mode1 == 0)) || (((((((((((((((((((((((((((((((((((((((0 <= c1 && mode3 == 1) && 0 <= id3) && nomsg == p1_new) && mode2 == 1) && 1 <= tmp) && tmp <= 1) && p2 == 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && i2 == 0) && c1 <= 1) && nomsg + 1 <= id1) && mode1 == 1) && (st1 == 1 || st1 == 0)) && id1 <= 127) && nomsg == p2_new) && 1 <= \result) && 0 <= tmp) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || (((((\exists v_~p2_new~0_82 : int :: (v_~p2_new~0_82 + 1 <= 0 && (if (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 <= 127 then (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 else -256 + (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256) == p2_\old) && 0 <= v_~p2_new~0_82 + 1) && mode2 == 1) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && id3 <= 127) && (((mode3 == 1 && (\exists v_~p3_new~0_74 : int :: (0 <= v_~p3_new~0_74 + 1 && v_~p3_new~0_74 + 1 <= 0) && (if (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256) == p3_\old)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && 0 <= id2) && #NULL == 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) [2022-11-26 00:37:28,508 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 00:37:28,508 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 00:37:28,509 INFO L158 Benchmark]: Toolchain (without parser) took 456239.44ms. Allocated memory was 148.9MB in the beginning and 654.3MB in the end (delta: 505.4MB). Free memory was 112.1MB in the beginning and 397.9MB in the end (delta: -285.8MB). Peak memory consumption was 219.0MB. Max. memory is 16.1GB. [2022-11-26 00:37:28,509 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 117.4MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:37:28,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.99ms. Allocated memory is still 148.9MB. Free memory was 112.1MB in the beginning and 116.7MB in the end (delta: -4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-26 00:37:28,510 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.97ms. Allocated memory is still 148.9MB. Free memory was 116.7MB in the beginning and 114.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:37:28,514 INFO L158 Benchmark]: Boogie Preprocessor took 55.76ms. Allocated memory is still 148.9MB. Free memory was 114.7MB in the beginning and 112.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:37:28,515 INFO L158 Benchmark]: RCFGBuilder took 972.68ms. Allocated memory is still 148.9MB. Free memory was 112.3MB in the beginning and 58.1MB in the end (delta: 54.2MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2022-11-26 00:37:28,518 INFO L158 Benchmark]: TraceAbstraction took 454742.75ms. Allocated memory was 148.9MB in the beginning and 654.3MB in the end (delta: 505.4MB). Free memory was 57.6MB in the beginning and 403.3MB in the end (delta: -345.7MB). Peak memory consumption was 361.1MB. Max. memory is 16.1GB. [2022-11-26 00:37:28,518 INFO L158 Benchmark]: Witness Printer took 84.95ms. Allocated memory is still 654.3MB. Free memory was 403.3MB in the beginning and 397.9MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-26 00:37:28,523 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 117.4MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.99ms. Allocated memory is still 148.9MB. Free memory was 112.1MB in the beginning and 116.7MB in the end (delta: -4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.97ms. Allocated memory is still 148.9MB. Free memory was 116.7MB in the beginning and 114.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.76ms. Allocated memory is still 148.9MB. Free memory was 114.7MB in the beginning and 112.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 972.68ms. Allocated memory is still 148.9MB. Free memory was 112.3MB in the beginning and 58.1MB in the end (delta: 54.2MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * TraceAbstraction took 454742.75ms. Allocated memory was 148.9MB in the beginning and 654.3MB in the end (delta: 505.4MB). Free memory was 57.6MB in the beginning and 403.3MB in the end (delta: -345.7MB). Peak memory consumption was 361.1MB. Max. memory is 16.1GB. * Witness Printer took 84.95ms. Allocated memory is still 654.3MB. Free memory was 403.3MB in the beginning and 397.9MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 207]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 207]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 207]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 207]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 211]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 211]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 211]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 211]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 216]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 216]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 216]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 216]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 454.6s, OverallIterations: 17, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 50.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 52.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2422 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2422 mSDsluCounter, 1417 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 998 mSDsCounter, 206 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4677 IncrementalHoareTripleChecker+Invalid, 4883 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 206 mSolverCounterUnsat, 419 mSDtfsCounter, 4677 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1209 GetRequests, 738 SyntacticMatches, 20 SemanticMatches, 451 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10779 ImplicationChecksByTransitivity, 128.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=15, InterpolantAutomatonStates: 182, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 462 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 85 NumberOfFragments, 3341 HoareAnnotationTreeSize, 5 FomulaSimplifications, 334565 FormulaSimplificationTreeSizeReduction, 26.6s HoareSimplificationTime, 5 FomulaSimplificationsInter, 463375 FormulaSimplificationTreeSizeReductionInter, 25.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 184.7s InterpolantComputationTime, 862 NumberOfCodeBlocks, 862 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1156 ConstructedInterpolants, 0 QuantifiedInterpolants, 98166 SizeOfPredicates, 295 NumberOfNonLiveVariables, 1774 ConjunctsInSsa, 228 ConjunctsInUnsatCore, 33 InterpolantComputations, 10 PerfectInterpolantSequences, 88/1032 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 23.5s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 72, DAG_INTERPRETER_EARLY_EXITS: 2, TOOLS_POST_APPLICATIONS: 283, TOOLS_POST_TIME: 21.4s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 279, TOOLS_QUANTIFIERELIM_TIME: 21.3s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.8s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 354, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 41, DOMAIN_JOIN_TIME: 1.5s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 4, DOMAIN_WIDEN_TIME: 0.2s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 10, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 72, DOMAIN_ISBOTTOM_TIME: 0.2s, LOOP_SUMMARIZER_APPLICATIONS: 6, LOOP_SUMMARIZER_CACHE_MISSES: 6, LOOP_SUMMARIZER_OVERALL_TIME: 14.9s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 14.9s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 10, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.1s, DAG_COMPRESSION_PROCESSED_NODES: 3831, DAG_COMPRESSION_RETAINED_NODES: 213, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 259]: Loop Invariant [2022-11-26 00:37:28,565 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,565 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,566 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,566 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,566 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,566 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,567 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,567 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,567 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,568 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,568 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,569 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,569 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,570 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,570 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,570 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,571 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,571 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,571 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,572 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,572 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,572 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,572 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,573 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,573 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,573 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,574 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,574 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,574 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,576 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,576 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,576 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,580 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,580 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,581 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,581 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,581 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,582 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,582 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,582 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,583 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,583 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,584 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,584 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,584 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,584 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,585 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,586 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,587 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,587 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,587 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,588 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,588 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,588 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,589 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,589 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,589 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,590 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,591 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((mode2 == 0 && tmp <= 1) && p3_new == nomsg) && st3 + st2 + st1 <= 1) && c1 <= 1) && (st1 == 1 || st1 == 0)) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && mode3 == 0) && 0 <= tmp) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || (((((\exists v_~p2_new~0_82 : int :: (v_~p2_new~0_82 + 1 <= 0 && (if (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 <= 127 then (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 else -256 + (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256) == p2_\old) && 0 <= v_~p2_new~0_82 + 1) && mode2 == 1) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && id3 <= 127) && (((mode3 == 1 && (\exists v_~p3_new~0_74 : int :: (0 <= v_~p3_new~0_74 + 1 && v_~p3_new~0_74 + 1 <= 0) && (if (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256) == p3_\old)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && 0 <= id2) && #NULL == 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && ((((((((((((((((((((((((((0 <= c1 && send3 <= 127) && 0 <= id3) && 0 <= p3_new + 1) && st3 <= 0) && i2 <= 0) && 0 <= p1_\old + 1) && 1 <= tmp) && 0 <= id1) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && send1 <= 127) && 1 <= cond) && st1 <= 0) && \result <= 1) && 1 <= \old(cond)) && 0 <= st1) && 0 <= p2) && p3_\old + 1 <= 0) && send2 <= 127) && st2 <= 0) && p2 <= 0) && c1 <= 0) && p2_\old + 1 <= 0) && p1_\old + 1 <= 0) || (((((((((((((((((((0 <= c1 && 0 <= id3) && 0 <= p3_new + 1) && i2 <= 0) && \old(arg) <= 1) && 1 <= tmp) && 0 <= id1) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && \result <= 1) && 0 <= arg) && 1 <= \old(cond)) && 0 <= p2) && arg <= 1) && 0 <= \result) && p2 <= 0) && \result <= 1) && 0 <= \old(arg)))) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) || (((((((((((((((((((((((((((((((mode3 == 1 && mode2 == 1) && tmp <= 1) && st3 + st2 + st1 <= 1) && c1 <= 1) && mode1 == 1) && (st1 == 1 || st1 == 0)) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && 0 <= tmp) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || (((((\exists v_~p2_new~0_82 : int :: (v_~p2_new~0_82 + 1 <= 0 && (if (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 <= 127 then (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 else -256 + (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256) == p2_\old) && 0 <= v_~p2_new~0_82 + 1) && mode2 == 1) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && id3 <= 127) && (((mode3 == 1 && (\exists v_~p3_new~0_74 : int :: (0 <= v_~p3_new~0_74 + 1 && v_~p3_new~0_74 + 1 <= 0) && (if (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256) == p3_\old)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && ((((((((((((((((((((((((((0 <= c1 && send3 <= 127) && 0 <= id3) && 0 <= p3_new + 1) && st3 <= 0) && i2 <= 0) && 0 <= p1_\old + 1) && 1 <= tmp) && 0 <= id1) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && send1 <= 127) && 1 <= cond) && st1 <= 0) && \result <= 1) && 1 <= \old(cond)) && 0 <= st1) && 0 <= p2) && p3_\old + 1 <= 0) && send2 <= 127) && st2 <= 0) && p2 <= 0) && c1 <= 0) && p2_\old + 1 <= 0) && p1_\old + 1 <= 0) || (((((((((((((((((((0 <= c1 && 0 <= id3) && 0 <= p3_new + 1) && i2 <= 0) && \old(arg) <= 1) && 1 <= tmp) && 0 <= id1) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && \result <= 1) && 0 <= arg) && 1 <= \old(cond)) && 0 <= p2) && arg <= 1) && 0 <= \result) && p2 <= 0) && \result <= 1) && 0 <= \old(arg)))) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0)) || (((((((((((((mode2 % 256 == 0 && send3 == id3) && !(id3 == id2)) && mode1 % 256 == 0) && !(id1 == id3)) && (((((((((((((((((((((((((((((((((((((((((((((((((((((p3 <= 0 && 0 <= p3_new + 1) && 0 <= #NULL) && st3 <= 0) && i2 <= 0) && \old(arg) <= 1) && 1 <= tmp) && tmp <= 1) && 1 <= \result) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && st1 <= 0) && \result <= 1) && #NULL <= 0) && 0 <= arg) && mode2 <= 1) && 1 <= \old(cond)) && 0 <= st1) && p1 <= 0) && mode3 <= 1) && 0 <= p2) && 0 <= p3) && c1 <= 1) && 1 <= tmp) && 1 <= c1) && id1 <= 127) && 0 <= p2_new + 1) && arg <= 1) && nomsg + 1 <= 0) && mode1 <= 1) && p2_new + 1 <= 0) && 1 <= \result) && #NULL <= 0) && id3 <= 127) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && 0 <= #NULL) && \old(cond) <= 1) && 0 <= p1_new + 1) && 0 <= send3) && \result <= 1) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && 0 <= \old(arg)) || (((((((((((((((((((((((((((((((((((((((((((0 <= c1 && p3 <= 0) && 0 <= p3_new + 1) && 0 <= #NULL) && st3 <= 0) && i2 <= 0) && 1 <= tmp) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && st1 <= 0) && \result <= 1) && 0 <= p3_\old + 1) && #NULL <= 0) && 1 <= \old(cond)) && 0 <= st1) && p1 <= 0) && 0 <= p2) && 0 <= p3) && 0 <= p2_\old + 1) && id1 <= 127) && p3_\old + 1 <= 0) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && #NULL <= 0) && id3 <= 127) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && 0 <= #NULL) && \old(cond) <= 1) && c1 <= 0) && p2_\old + 1 <= 0) && 0 <= p1_new + 1) && p1_\old + 1 <= 0) && 0 <= send3) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1))) && 256 * (mode3 / 256) == mode3) && !(id1 == id2)) && nomsg == p1_\old) && send1 == id1) && r1 <= r1 / 256 * 256) && 0 <= id2) && st2 == 0) && send2 == id2) - InvariantResult [Line: 207]: Loop Invariant [2022-11-26 00:37:28,595 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,595 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,596 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,596 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,596 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,596 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,597 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,597 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,597 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,598 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,598 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,598 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,598 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,599 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,599 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,599 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,599 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,600 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,600 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,600 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,600 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,601 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,602 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,603 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,603 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,603 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,605 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,605 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,606 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,606 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,606 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,606 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,607 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,607 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,607 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,607 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,608 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,608 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,608 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,608 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,609 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,609 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,609 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,610 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,610 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,610 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,610 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,611 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,611 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,611 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,611 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,612 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,612 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,612 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,612 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,613 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,613 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,613 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((0 <= c1 && mode2 == 0) && 0 <= id3) && nomsg == p1_new) && 1 <= tmp) && tmp <= 1) && 0 <= id1) && p2 == 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && i2 == 0) && c1 <= 1) && (st1 == 1 || st1 == 0)) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && mode3 == 0) && 0 <= tmp) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || (((((\exists v_~p2_new~0_82 : int :: (v_~p2_new~0_82 + 1 <= 0 && (if (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 <= 127 then (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 else -256 + (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256) == p2_\old) && 0 <= v_~p2_new~0_82 + 1) && mode2 == 1) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && id3 <= 127) && (((mode3 == 1 && (\exists v_~p3_new~0_74 : int :: (0 <= v_~p3_new~0_74 + 1 && v_~p3_new~0_74 + 1 <= 0) && (if (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256) == p3_\old)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && 0 <= id2) && #NULL == 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) || (tmp == 0 && mode1 == 0)) || (((((((((((((((((((((((((((((((((((((((0 <= c1 && mode3 == 1) && 0 <= id3) && nomsg == p1_new) && mode2 == 1) && 1 <= tmp) && tmp <= 1) && p2 == 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && i2 == 0) && c1 <= 1) && nomsg + 1 <= id1) && mode1 == 1) && (st1 == 1 || st1 == 0)) && id1 <= 127) && nomsg == p2_new) && 1 <= \result) && 0 <= tmp) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || (((((\exists v_~p2_new~0_82 : int :: (v_~p2_new~0_82 + 1 <= 0 && (if (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 <= 127 then (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 else -256 + (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256) == p2_\old) && 0 <= v_~p2_new~0_82 + 1) && mode2 == 1) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && id3 <= 127) && (((mode3 == 1 && (\exists v_~p3_new~0_74 : int :: (0 <= v_~p3_new~0_74 + 1 && v_~p3_new~0_74 + 1 <= 0) && (if (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256) == p3_\old)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && 0 <= id2) && #NULL == 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((mode3 == 1 && (st2 == 1 || st2 == 0)) && nomsg == p1_new) && mode2 == 1) && tmp <= 1) && c1 <= 1) && 0 <= send2) && (st1 == 1 || st1 == 0)) && (((((((((((((((((((((((((((0 <= c1 && send3 <= 127) && 0 <= id3) && 0 <= p3_new + 1) && st3 <= 0) && i2 <= 0) && 0 <= p1_\old + 1) && 1 <= tmp) && 0 <= id1) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && send1 <= 127) && 1 <= cond) && st1 <= 0) && \result <= 1) && 0 <= p3_\old + 1) && 1 <= \old(cond)) && 0 <= p2) && 0 <= p2_\old + 1) && p3_\old + 1 <= 0) && send2 <= 127) && st2 <= 0) && p2 <= 0) && c1 <= 0) && p2_\old + 1 <= 0) && p1_\old + 1 <= 0) || (((((((((((((((((((0 <= c1 && 0 <= id3) && 0 <= p3_new + 1) && i2 <= 0) && \old(arg) <= 1) && 1 <= tmp) && 0 <= id1) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && \result <= 1) && 0 <= arg) && 1 <= \old(cond)) && 0 <= p2) && arg <= 1) && 0 <= \result) && p2 <= 0) && \result <= 1) && 0 <= \old(arg)))) && id1 <= 127) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && 0 <= tmp) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= p3_new + 1) && 1 <= tmp) && mode2 % 256 == 0) && p2 == 0) && tmp <= 1) && 1 <= cond) && send3 == id3) && \result <= 1) && !(id3 == id2)) && 0 <= st3 + st1) && 1 <= \old(cond)) && !(id1 == id3)) && i2 == 0) && 256 * (mode3 / 256) == mode3) && c1 <= 1) && mode1 == 1) && id1 <= 127) && st1 == 0) && !(id1 == id2)) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && send1 == id1) && st3 + st1 <= 0) && r1 <= r1 / 256 * 256) && id3 <= 127) && 0 <= id2) && #NULL == 0) && st2 == 0) && 0 <= nomsg + 1) && id2 <= 127) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && send2 == id2) && #NULL == 0)) || ((((((((((((((((((((((((((((((((((((((((0 <= c1 && mode2 == 0) && (st2 == 1 || st2 == 0)) && 0 <= id3) && 0 <= p3_new + 1) && 1 <= tmp) && 0 <= id1) && p2 == 0) && tmp <= 1) && 1 <= cond) && \result <= 1) && nomsg == p2_\old) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && i2 == 0) && c1 <= 1) && 0 <= send2) && mode1 == 1) && (st1 == 1 || st1 == 0)) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && mode3 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) - InvariantResult [Line: 208]: Loop Invariant [2022-11-26 00:37:28,620 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,620 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,621 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,621 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,621 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,621 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,622 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,622 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,622 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,622 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,623 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,624 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,625 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,625 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,625 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,625 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,626 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,626 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,626 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,627 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,627 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,627 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,627 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,628 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,629 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,629 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,629 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,629 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,630 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,630 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,630 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,630 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,633 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,634 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,634 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,634 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,634 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,635 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,635 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,635 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,635 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,636 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,636 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,636 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,636 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,637 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,637 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,637 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,638 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,638 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,638 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,638 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,639 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,639 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,639 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,639 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_82,QUANTIFIED] [2022-11-26 00:37:28,640 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,640 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,640 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,640 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,641 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,641 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,641 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] [2022-11-26 00:37:28,641 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_74,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((((((((((0 <= c1 && mode2 == 0) && 0 <= id3) && nomsg == p1_new) && 1 <= tmp) && 0 <= id1) && p2 == 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && i2 == 0) && c1 <= 1) && (st1 == 1 || st1 == 0)) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && mode3 == 0) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || (((((\exists v_~p2_new~0_82 : int :: (v_~p2_new~0_82 + 1 <= 0 && (if (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 <= 127 then (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 else -256 + (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256) == p2_\old) && 0 <= v_~p2_new~0_82 + 1) && mode2 == 1) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && id3 <= 127) && (((mode3 == 1 && (\exists v_~p3_new~0_74 : int :: (0 <= v_~p3_new~0_74 + 1 && v_~p3_new~0_74 + 1 <= 0) && (if (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256) == p3_\old)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && 0 <= id2) && #NULL == 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((((0 <= c1 && mode3 == 1) && 0 <= id3) && mode2 == 1) && 1 <= tmp) && 0 <= id1) && p2 == 0) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && i2 == 0) && c1 <= 1) && mode1 == 1) && (st1 == 1 || st1 == 0)) && id1 <= 127) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || (((((\exists v_~p2_new~0_82 : int :: (v_~p2_new~0_82 + 1 <= 0 && (if (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 <= 127 then (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256 else -256 + (if v_~p2_new~0_82 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_82) % 256) == p2_\old) && 0 <= v_~p2_new~0_82 + 1) && mode2 == 1) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && id3 <= 127) && (((mode3 == 1 && (\exists v_~p3_new~0_74 : int :: (0 <= v_~p3_new~0_74 + 1 && v_~p3_new~0_74 + 1 <= 0) && (if (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_74 == nomsg then send3 else v_~p3_new~0_74) % 256) == p3_\old)) && nomsg == m3) || (((0 <= p3_\old + 1 && p3_\old + 1 <= 0) && ((id3 < m3 && send3 == m3) || ((st3 == 1 || !(id3 == m3)) && !(id3 < m3)))) && mode3 == 0))) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) RESULT: Ultimate proved your program to be correct! [2022-11-26 00:37:28,690 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b577836c-2199-4050-9c9d-0d3a59b12766/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE