./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/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_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/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_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/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 17c1b3adab900925d0968acf284c9fae9bc7d0ec39197e53dc7bd6b93c5a8558 --- 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:57:23,544 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:57:23,547 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:57:23,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:57:23,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:57:23,585 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:57:23,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:57:23,593 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:57:23,595 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:57:23,596 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:57:23,597 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:57:23,598 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:57:23,599 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:57:23,600 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:57:23,601 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:57:23,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:57:23,603 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:57:23,604 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:57:23,605 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:57:23,607 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:57:23,609 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:57:23,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:57:23,611 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:57:23,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:57:23,616 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:57:23,616 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:57:23,616 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:57:23,617 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:57:23,618 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:57:23,619 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:57:23,619 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:57:23,620 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:57:23,621 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:57:23,622 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:57:23,623 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:57:23,623 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:57:23,624 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:57:23,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:57:23,625 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:57:23,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:57:23,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:57:23,631 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-26 00:57:23,665 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:57:23,666 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:57:23,670 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:57:23,670 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:57:23,671 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:57:23,671 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:57:23,672 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:57:23,672 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:57:23,672 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:57:23,672 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:57:23,672 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:57:23,673 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:57:23,673 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:57:23,673 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:57:23,673 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:57:23,673 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:57:23,674 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:57:23,674 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:57:23,675 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:57:23,675 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:57:23,675 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 00:57:23,675 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:57:23,675 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:57:23,676 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:57:23,676 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:57:23,676 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:57:23,676 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:57:23,676 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-26 00:57:23,677 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:57:23,677 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:57:23,677 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:57:23,677 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:57:23,677 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:57:23,678 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:57:23,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:57:23,679 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:57:23,680 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:57:23,680 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:57:23,680 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:57:23,680 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:57:23,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:57:23,681 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:57:23,681 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:57:23,681 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_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/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_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/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 -> 17c1b3adab900925d0968acf284c9fae9bc7d0ec39197e53dc7bd6b93c5a8558 [2022-11-26 00:57:24,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:57:24,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:57:24,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:57:24,039 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:57:24,039 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:57:24,041 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-11-26 00:57:27,053 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:57:27,316 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:57:27,317 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-11-26 00:57:27,324 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/bin/utaipan-ByfvJB40ur/data/92f6c4955/31f5dbe403c747aabbc94aa9677065c2/FLAG1b86b6c2d [2022-11-26 00:57:27,340 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/bin/utaipan-ByfvJB40ur/data/92f6c4955/31f5dbe403c747aabbc94aa9677065c2 [2022-11-26 00:57:27,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:57:27,344 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:57:27,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:57:27,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:57:27,352 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:57:27,353 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:57:27" (1/1) ... [2022-11-26 00:57:27,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52c254d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:57:27, skipping insertion in model container [2022-11-26 00:57:27,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:57:27" (1/1) ... [2022-11-26 00:57:27,362 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:57:27,418 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:57:27,610 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_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4105,4118] [2022-11-26 00:57:27,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:57:27,667 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:57:27,708 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_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4105,4118] [2022-11-26 00:57:27,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:57:27,741 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:57:27,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:57:27 WrapperNode [2022-11-26 00:57:27,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:57:27,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:57:27,743 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:57:27,743 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:57:27,752 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:57:27" (1/1) ... [2022-11-26 00:57:27,760 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:57:27" (1/1) ... [2022-11-26 00:57:27,790 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 280 [2022-11-26 00:57:27,791 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:57:27,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:57:27,792 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:57:27,792 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:57:27,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:57:27" (1/1) ... [2022-11-26 00:57:27,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:57:27" (1/1) ... [2022-11-26 00:57:27,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:57:27" (1/1) ... [2022-11-26 00:57:27,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:57:27" (1/1) ... [2022-11-26 00:57:27,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:57:27" (1/1) ... [2022-11-26 00:57:27,811 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:57:27" (1/1) ... [2022-11-26 00:57:27,813 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:57:27" (1/1) ... [2022-11-26 00:57:27,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:57:27" (1/1) ... [2022-11-26 00:57:27,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:57:27,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:57:27,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:57:27,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:57:27,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:57:27" (1/1) ... [2022-11-26 00:57:27,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:57:27,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:57:27,856 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:57:27,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:57:27,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:57:27,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:57:27,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:57:27,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:57:28,016 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:57:28,018 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:57:28,385 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:57:28,519 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:57:28,519 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-26 00:57:28,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:57:28 BoogieIcfgContainer [2022-11-26 00:57:28,522 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:57:28,525 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:57:28,525 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:57:28,529 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:57:28,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:57:27" (1/3) ... [2022-11-26 00:57:28,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f67260a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:57:28, skipping insertion in model container [2022-11-26 00:57:28,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:57:27" (2/3) ... [2022-11-26 00:57:28,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f67260a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:57:28, skipping insertion in model container [2022-11-26 00:57:28,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:57:28" (3/3) ... [2022-11-26 00:57:28,532 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-11-26 00:57:28,553 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:57:28,553 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-11-26 00:57:28,618 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:57:28,626 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;@43fe664b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:57:28,626 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-26 00:57:28,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 72 states have internal predecessors, (103), 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:57:28,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-26 00:57:28,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:57:28,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:57:28,640 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:57:28,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:57:28,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1190146159, now seen corresponding path program 1 times [2022-11-26 00:57:28,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:57:28,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419576994] [2022-11-26 00:57:28,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:57:28,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:57:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:57:28,942 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:57:28,943 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:57:28,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419576994] [2022-11-26 00:57:28,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419576994] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:57:28,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:57:28,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 00:57:28,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560690712] [2022-11-26 00:57:28,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:57:28,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-26 00:57:28,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:57:29,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-26 00:57:29,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-26 00:57:29,018 INFO L87 Difference]: Start difference. First operand has 73 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 72 states have internal predecessors, (103), 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 2 states, 1 states have (on average 21.0) internal successors, (21), 2 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:57:29,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:57:29,100 INFO L93 Difference]: Finished difference Result 75 states and 104 transitions. [2022-11-26 00:57:29,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-26 00:57:29,103 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 21.0) internal successors, (21), 2 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 21 [2022-11-26 00:57:29,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:57:29,112 INFO L225 Difference]: With dead ends: 75 [2022-11-26 00:57:29,113 INFO L226 Difference]: Without dead ends: 69 [2022-11-26 00:57:29,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-26 00:57:29,119 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:57:29,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:57:29,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-26 00:57:29,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-11-26 00:57:29,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 68 states have internal predecessors, (82), 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:57:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2022-11-26 00:57:29,177 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 21 [2022-11-26 00:57:29,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:57:29,178 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2022-11-26 00:57:29,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 21.0) internal successors, (21), 2 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:57:29,179 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2022-11-26 00:57:29,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-26 00:57:29,180 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:57:29,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:57:29,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:57:29,181 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:57:29,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:57:29,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1628803833, now seen corresponding path program 1 times [2022-11-26 00:57:29,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:57:29,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971839861] [2022-11-26 00:57:29,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:57:29,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:57:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:57:29,420 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:57:29,420 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:57:29,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971839861] [2022-11-26 00:57:29,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971839861] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:57:29,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:57:29,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:57:29,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465732051] [2022-11-26 00:57:29,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:57:29,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:57:29,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:57:29,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:57:29,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:57:29,424 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:57:29,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:57:29,502 INFO L93 Difference]: Finished difference Result 165 states and 202 transitions. [2022-11-26 00:57:29,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:57:29,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-26 00:57:29,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:57:29,505 INFO L225 Difference]: With dead ends: 165 [2022-11-26 00:57:29,505 INFO L226 Difference]: Without dead ends: 114 [2022-11-26 00:57:29,506 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:57:29,507 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 59 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:57:29,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 181 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:57:29,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-26 00:57:29,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2022-11-26 00:57:29,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 90 states have (on average 1.5222222222222221) internal successors, (137), 101 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:57:29,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 137 transitions. [2022-11-26 00:57:29,530 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 137 transitions. Word has length 28 [2022-11-26 00:57:29,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:57:29,531 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 137 transitions. [2022-11-26 00:57:29,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:57:29,533 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 137 transitions. [2022-11-26 00:57:29,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-26 00:57:29,535 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:57:29,536 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:57:29,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 00:57:29,537 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:57:29,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:57:29,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1333674629, now seen corresponding path program 1 times [2022-11-26 00:57:29,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:57:29,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968355277] [2022-11-26 00:57:29,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:57:29,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:57:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:57:29,697 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:57:29,697 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:57:29,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968355277] [2022-11-26 00:57:29,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968355277] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:57:29,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:57:29,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:57:29,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354994761] [2022-11-26 00:57:29,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:57:29,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:57:29,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:57:29,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:57:29,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:57:29,700 INFO L87 Difference]: Start difference. First operand 102 states and 137 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:57:29,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:57:29,769 INFO L93 Difference]: Finished difference Result 262 states and 363 transitions. [2022-11-26 00:57:29,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:57:29,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2022-11-26 00:57:29,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:57:29,771 INFO L225 Difference]: With dead ends: 262 [2022-11-26 00:57:29,771 INFO L226 Difference]: Without dead ends: 178 [2022-11-26 00:57:29,772 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:57:29,773 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 56 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 178 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:57:29,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 178 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:57:29,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-11-26 00:57:29,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2022-11-26 00:57:29,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 154 states have (on average 1.5714285714285714) internal successors, (242), 165 states have internal predecessors, (242), 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:57:29,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 242 transitions. [2022-11-26 00:57:29,808 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 242 transitions. Word has length 29 [2022-11-26 00:57:29,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:57:29,808 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 242 transitions. [2022-11-26 00:57:29,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:57:29,809 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 242 transitions. [2022-11-26 00:57:29,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-26 00:57:29,810 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:57:29,810 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:57:29,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 00:57:29,810 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:57:29,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:57:29,811 INFO L85 PathProgramCache]: Analyzing trace with hash -2007586470, now seen corresponding path program 1 times [2022-11-26 00:57:29,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:57:29,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468280195] [2022-11-26 00:57:29,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:57:29,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:57:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:57:29,877 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:57:29,877 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:57:29,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468280195] [2022-11-26 00:57:29,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468280195] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:57:29,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:57:29,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:57:29,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335684812] [2022-11-26 00:57:29,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:57:29,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:57:29,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:57:29,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:57:29,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:57:29,880 INFO L87 Difference]: Start difference. First operand 166 states and 242 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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:57:29,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:57:29,974 INFO L93 Difference]: Finished difference Result 446 states and 666 transitions. [2022-11-26 00:57:29,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:57:29,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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:57:29,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:57:29,982 INFO L225 Difference]: With dead ends: 446 [2022-11-26 00:57:29,983 INFO L226 Difference]: Without dead ends: 298 [2022-11-26 00:57:29,986 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:57:29,993 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 51 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 174 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:57:29,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 174 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:57:29,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-11-26 00:57:30,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 286. [2022-11-26 00:57:30,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 274 states have (on average 1.5985401459854014) internal successors, (438), 285 states have internal predecessors, (438), 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:57:30,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 438 transitions. [2022-11-26 00:57:30,086 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 438 transitions. Word has length 32 [2022-11-26 00:57:30,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:57:30,087 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 438 transitions. [2022-11-26 00:57:30,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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:57:30,088 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 438 transitions. [2022-11-26 00:57:30,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-26 00:57:30,091 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:57:30,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:57:30,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-26 00:57:30,093 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:57:30,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:57:30,093 INFO L85 PathProgramCache]: Analyzing trace with hash 62503230, now seen corresponding path program 1 times [2022-11-26 00:57:30,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:57:30,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796329854] [2022-11-26 00:57:30,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:57:30,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:57:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:57:30,261 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:57:30,261 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:57:30,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796329854] [2022-11-26 00:57:30,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796329854] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:57:30,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:57:30,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:57:30,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453394293] [2022-11-26 00:57:30,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:57:30,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:57:30,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:57:30,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:57:30,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:57:30,266 INFO L87 Difference]: Start difference. First operand 286 states and 438 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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:57:30,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:57:30,445 INFO L93 Difference]: Finished difference Result 437 states and 668 transitions. [2022-11-26 00:57:30,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:57:30,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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 35 [2022-11-26 00:57:30,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:57:30,449 INFO L225 Difference]: With dead ends: 437 [2022-11-26 00:57:30,450 INFO L226 Difference]: Without dead ends: 434 [2022-11-26 00:57:30,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:57:30,460 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 175 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:57:30,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 88 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:57:30,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-11-26 00:57:30,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 420. [2022-11-26 00:57:30,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 408 states have (on average 1.588235294117647) internal successors, (648), 419 states have internal predecessors, (648), 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:57:30,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 648 transitions. [2022-11-26 00:57:30,528 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 648 transitions. Word has length 35 [2022-11-26 00:57:30,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:57:30,530 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 648 transitions. [2022-11-26 00:57:30,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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:57:30,535 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 648 transitions. [2022-11-26 00:57:30,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-26 00:57:30,537 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:57:30,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:57:30,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-26 00:57:30,538 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:57:30,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:57:30,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1937600266, now seen corresponding path program 1 times [2022-11-26 00:57:30,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:57:30,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197178839] [2022-11-26 00:57:30,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:57:30,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:57:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:57:30,647 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:57:30,647 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:57:30,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197178839] [2022-11-26 00:57:30,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197178839] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:57:30,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:57:30,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:57:30,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218422593] [2022-11-26 00:57:30,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:57:30,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:57:30,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:57:30,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:57:30,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:57:30,650 INFO L87 Difference]: Start difference. First operand 420 states and 648 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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:57:30,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:57:30,844 INFO L93 Difference]: Finished difference Result 526 states and 779 transitions. [2022-11-26 00:57:30,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:57:30,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-11-26 00:57:30,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:57:30,847 INFO L225 Difference]: With dead ends: 526 [2022-11-26 00:57:30,847 INFO L226 Difference]: Without dead ends: 523 [2022-11-26 00:57:30,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:57:30,850 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 166 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:57:30,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 157 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:57:30,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-11-26 00:57:30,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 496. [2022-11-26 00:57:30,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 484 states have (on average 1.572314049586777) internal successors, (761), 495 states have internal predecessors, (761), 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:57:30,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 761 transitions. [2022-11-26 00:57:30,910 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 761 transitions. Word has length 36 [2022-11-26 00:57:30,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:57:30,910 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 761 transitions. [2022-11-26 00:57:30,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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:57:30,911 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 761 transitions. [2022-11-26 00:57:30,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-26 00:57:30,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:57:30,916 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:57:30,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-26 00:57:30,916 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:57:30,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:57:30,917 INFO L85 PathProgramCache]: Analyzing trace with hash -63933760, now seen corresponding path program 1 times [2022-11-26 00:57:30,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:57:30,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608126245] [2022-11-26 00:57:30,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:57:30,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:57:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:57:31,026 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:57:31,026 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:57:31,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608126245] [2022-11-26 00:57:31,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608126245] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:57:31,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:57:31,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:57:31,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908053855] [2022-11-26 00:57:31,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:57:31,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:57:31,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:57:31,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:57:31,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:57:31,028 INFO L87 Difference]: Start difference. First operand 496 states and 761 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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:57:31,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:57:31,330 INFO L93 Difference]: Finished difference Result 759 states and 1136 transitions. [2022-11-26 00:57:31,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:57:31,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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 37 [2022-11-26 00:57:31,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:57:31,336 INFO L225 Difference]: With dead ends: 759 [2022-11-26 00:57:31,337 INFO L226 Difference]: Without dead ends: 756 [2022-11-26 00:57:31,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:57:31,340 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 324 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:57:31,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 180 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:57:31,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2022-11-26 00:57:31,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 720. [2022-11-26 00:57:31,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 708 states have (on average 1.536723163841808) internal successors, (1088), 719 states have internal predecessors, (1088), 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:57:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1088 transitions. [2022-11-26 00:57:31,433 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1088 transitions. Word has length 37 [2022-11-26 00:57:31,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:57:31,433 INFO L495 AbstractCegarLoop]: Abstraction has 720 states and 1088 transitions. [2022-11-26 00:57:31,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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:57:31,433 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1088 transitions. [2022-11-26 00:57:31,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-26 00:57:31,434 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:57:31,434 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:57:31,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-26 00:57:31,434 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:57:31,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:57:31,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1981946420, now seen corresponding path program 1 times [2022-11-26 00:57:31,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:57:31,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950103299] [2022-11-26 00:57:31,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:57:31,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:57:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:57:31,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:57:31,509 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:57:31,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950103299] [2022-11-26 00:57:31,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950103299] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:57:31,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:57:31,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:57:31,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521945350] [2022-11-26 00:57:31,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:57:31,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:57:31,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:57:31,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:57:31,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:57:31,511 INFO L87 Difference]: Start difference. First operand 720 states and 1088 transitions. Second operand has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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:57:31,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:57:31,953 INFO L93 Difference]: Finished difference Result 1692 states and 2497 transitions. [2022-11-26 00:57:31,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-26 00:57:31,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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:57:31,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:57:31,963 INFO L225 Difference]: With dead ends: 1692 [2022-11-26 00:57:31,963 INFO L226 Difference]: Without dead ends: 998 [2022-11-26 00:57:31,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-26 00:57:31,967 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 295 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:57:31,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 362 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 00:57:31,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2022-11-26 00:57:32,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 945. [2022-11-26 00:57:32,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 933 states have (on average 1.4812433011789925) internal successors, (1382), 944 states have internal predecessors, (1382), 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:57:32,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1382 transitions. [2022-11-26 00:57:32,076 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1382 transitions. Word has length 38 [2022-11-26 00:57:32,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:57:32,076 INFO L495 AbstractCegarLoop]: Abstraction has 945 states and 1382 transitions. [2022-11-26 00:57:32,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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:57:32,077 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1382 transitions. [2022-11-26 00:57:32,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-26 00:57:32,080 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:57:32,081 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:57:32,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-26 00:57:32,081 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:57:32,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:57:32,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1551716282, now seen corresponding path program 1 times [2022-11-26 00:57:32,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:57:32,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215643077] [2022-11-26 00:57:32,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:57:32,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:57:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:57:32,182 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:57:32,183 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:57:32,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215643077] [2022-11-26 00:57:32,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215643077] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:57:32,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:57:32,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:57:32,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355371662] [2022-11-26 00:57:32,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:57:32,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:57:32,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:57:32,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:57:32,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:57:32,186 INFO L87 Difference]: Start difference. First operand 945 states and 1382 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:57:32,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:57:32,365 INFO L93 Difference]: Finished difference Result 1814 states and 2650 transitions. [2022-11-26 00:57:32,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:57:32,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 53 [2022-11-26 00:57:32,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:57:32,370 INFO L225 Difference]: With dead ends: 1814 [2022-11-26 00:57:32,370 INFO L226 Difference]: Without dead ends: 895 [2022-11-26 00:57:32,371 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:57:32,375 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 29 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:57:32,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 136 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:57:32,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2022-11-26 00:57:32,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 881. [2022-11-26 00:57:32,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 869 states have (on average 1.4637514384349828) internal successors, (1272), 880 states have internal predecessors, (1272), 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:57:32,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1272 transitions. [2022-11-26 00:57:32,479 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1272 transitions. Word has length 53 [2022-11-26 00:57:32,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:57:32,480 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1272 transitions. [2022-11-26 00:57:32,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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:57:32,481 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1272 transitions. [2022-11-26 00:57:32,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-26 00:57:32,481 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:57:32,481 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:57:32,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-26 00:57:32,482 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:57:32,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:57:32,487 INFO L85 PathProgramCache]: Analyzing trace with hash -2090750529, now seen corresponding path program 1 times [2022-11-26 00:57:32,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:57:32,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614660543] [2022-11-26 00:57:32,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:57:32,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:57:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:57:32,791 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:57:32,791 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:57:32,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614660543] [2022-11-26 00:57:32,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614660543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:57:32,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:57:32,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-26 00:57:32,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739388615] [2022-11-26 00:57:32,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:57:32,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:57:32,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:57:32,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:57:32,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:57:32,793 INFO L87 Difference]: Start difference. First operand 881 states and 1272 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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:57:33,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:57:33,043 INFO L93 Difference]: Finished difference Result 1750 states and 2524 transitions. [2022-11-26 00:57:33,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:57:33,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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 57 [2022-11-26 00:57:33,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:57:33,047 INFO L225 Difference]: With dead ends: 1750 [2022-11-26 00:57:33,047 INFO L226 Difference]: Without dead ends: 895 [2022-11-26 00:57:33,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:57:33,050 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 31 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:57:33,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 177 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:57:33,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2022-11-26 00:57:33,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 881. [2022-11-26 00:57:33,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 869 states have (on average 1.4602991944764097) internal successors, (1269), 880 states have internal predecessors, (1269), 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:57:33,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1269 transitions. [2022-11-26 00:57:33,167 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1269 transitions. Word has length 57 [2022-11-26 00:57:33,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:57:33,167 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1269 transitions. [2022-11-26 00:57:33,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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:57:33,168 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1269 transitions. [2022-11-26 00:57:33,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-26 00:57:33,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:57:33,168 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:57:33,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-26 00:57:33,169 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:57:33,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:57:33,169 INFO L85 PathProgramCache]: Analyzing trace with hash 847640831, now seen corresponding path program 1 times [2022-11-26 00:57:33,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:57:33,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740608786] [2022-11-26 00:57:33,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:57:33,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:57:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:57:33,269 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 00:57:33,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:57:33,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740608786] [2022-11-26 00:57:33,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740608786] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:57:33,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:57:33,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:57:33,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238108182] [2022-11-26 00:57:33,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:57:33,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:57:33,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:57:33,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:57:33,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:57:33,272 INFO L87 Difference]: Start difference. First operand 881 states and 1269 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 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:57:33,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:57:33,440 INFO L93 Difference]: Finished difference Result 1736 states and 2510 transitions. [2022-11-26 00:57:33,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:57:33,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 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 58 [2022-11-26 00:57:33,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:57:33,444 INFO L225 Difference]: With dead ends: 1736 [2022-11-26 00:57:33,444 INFO L226 Difference]: Without dead ends: 881 [2022-11-26 00:57:33,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:57:33,446 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 190 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:57:33,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 76 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:57:33,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2022-11-26 00:57:33,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2022-11-26 00:57:33,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 869 states have (on average 1.4464902186421174) internal successors, (1257), 880 states have internal predecessors, (1257), 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:57:33,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1257 transitions. [2022-11-26 00:57:33,609 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1257 transitions. Word has length 58 [2022-11-26 00:57:33,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:57:33,609 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1257 transitions. [2022-11-26 00:57:33,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 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:57:33,610 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1257 transitions. [2022-11-26 00:57:33,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-26 00:57:33,610 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:57:33,610 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:57:33,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-26 00:57:33,611 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:57:33,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:57:33,611 INFO L85 PathProgramCache]: Analyzing trace with hash -2119941276, now seen corresponding path program 1 times [2022-11-26 00:57:33,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:57:33,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898783443] [2022-11-26 00:57:33,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:57:33,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:57:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:57:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:57:33,698 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:57:33,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898783443] [2022-11-26 00:57:33,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898783443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:57:33,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:57:33,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:57:33,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705050209] [2022-11-26 00:57:33,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:57:33,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:57:33,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:57:33,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:57:33,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:57:33,701 INFO L87 Difference]: Start difference. First operand 881 states and 1257 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 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:57:33,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:57:33,888 INFO L93 Difference]: Finished difference Result 1736 states and 2486 transitions. [2022-11-26 00:57:33,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:57:33,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 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 58 [2022-11-26 00:57:33,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:57:33,892 INFO L225 Difference]: With dead ends: 1736 [2022-11-26 00:57:33,892 INFO L226 Difference]: Without dead ends: 881 [2022-11-26 00:57:33,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:57:33,894 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 200 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:57:33,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 68 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:57:33,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2022-11-26 00:57:34,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2022-11-26 00:57:34,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 869 states have (on average 1.425776754890679) internal successors, (1239), 880 states have internal predecessors, (1239), 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:57:34,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1239 transitions. [2022-11-26 00:57:34,026 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1239 transitions. Word has length 58 [2022-11-26 00:57:34,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:57:34,027 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1239 transitions. [2022-11-26 00:57:34,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 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:57:34,027 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1239 transitions. [2022-11-26 00:57:34,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-26 00:57:34,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:57:34,028 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:57:34,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-26 00:57:34,028 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:57:34,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:57:34,029 INFO L85 PathProgramCache]: Analyzing trace with hash -398610401, now seen corresponding path program 1 times [2022-11-26 00:57:34,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:57:34,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124478868] [2022-11-26 00:57:34,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:57:34,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:57:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:57:34,350 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 00:57:34,350 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:57:34,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124478868] [2022-11-26 00:57:34,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124478868] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:57:34,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629102856] [2022-11-26 00:57:34,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:57:34,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:57:34,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:57:34,358 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:57:34,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 00:57:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:57:34,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-26 00:57:34,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:57:34,978 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:57:34,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:57:35,490 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 00:57:35,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629102856] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:57:35,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1504070006] [2022-11-26 00:57:35,514 INFO L159 IcfgInterpreter]: Started Sifa with 51 locations of interest [2022-11-26 00:57:35,514 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:57:35,519 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:57:35,524 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:57:35,525 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:57:35,902 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:57:35,903 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:57:35,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-11-26 00:57:35,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:57:35,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:57:35,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:57:35,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-11-26 00:57:49,768 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:58:10,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1504070006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:58:10,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:58:10,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [5, 4, 5] total 52 [2022-11-26 00:58:10,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625568053] [2022-11-26 00:58:10,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:58:10,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-26 00:58:10,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:58:10,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-26 00:58:10,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=677, Invalid=2079, Unknown=0, NotChecked=0, Total=2756 [2022-11-26 00:58:10,044 INFO L87 Difference]: Start difference. First operand 881 states and 1239 transitions. Second operand has 43 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 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:58:24,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:58:24,290 INFO L93 Difference]: Finished difference Result 2187 states and 3117 transitions. [2022-11-26 00:58:24,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-26 00:58:24,291 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 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 58 [2022-11-26 00:58:24,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:58:24,295 INFO L225 Difference]: With dead ends: 2187 [2022-11-26 00:58:24,296 INFO L226 Difference]: Without dead ends: 1328 [2022-11-26 00:58:24,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 117 SyntacticMatches, 9 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2390 ImplicationChecksByTransitivity, 31.4s TimeCoverageRelationStatistics Valid=1140, Invalid=4262, Unknown=0, NotChecked=0, Total=5402 [2022-11-26 00:58:24,299 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 129 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:58:24,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 116 Invalid, 1501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-26 00:58:24,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2022-11-26 00:58:24,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1295. [2022-11-26 00:58:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1295 states, 1283 states have (on average 1.3359314107560405) internal successors, (1714), 1294 states have internal predecessors, (1714), 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:58:24,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1714 transitions. [2022-11-26 00:58:24,582 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1714 transitions. Word has length 58 [2022-11-26 00:58:24,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:58:24,583 INFO L495 AbstractCegarLoop]: Abstraction has 1295 states and 1714 transitions. [2022-11-26 00:58:24,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 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:58:24,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1714 transitions. [2022-11-26 00:58:24,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-26 00:58:24,584 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:58:24,585 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:58:24,596 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-26 00:58:24,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-26 00:58:24,790 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:58:24,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:58:24,791 INFO L85 PathProgramCache]: Analyzing trace with hash -545673620, now seen corresponding path program 1 times [2022-11-26 00:58:24,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:58:24,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395099179] [2022-11-26 00:58:24,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:58:24,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:58:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:58:24,950 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:58:24,951 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:58:24,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395099179] [2022-11-26 00:58:24,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395099179] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:58:24,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:58:24,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:58:24,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13247136] [2022-11-26 00:58:24,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:58:24,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:58:24,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:58:24,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:58:24,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:58:24,954 INFO L87 Difference]: Start difference. First operand 1295 states and 1714 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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:58:25,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:58:25,247 INFO L93 Difference]: Finished difference Result 2440 states and 3229 transitions. [2022-11-26 00:58:25,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:58:25,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 81 [2022-11-26 00:58:25,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:58:25,252 INFO L225 Difference]: With dead ends: 2440 [2022-11-26 00:58:25,252 INFO L226 Difference]: Without dead ends: 1170 [2022-11-26 00:58:25,254 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:58:25,255 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 30 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:58:25,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 161 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:58:25,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2022-11-26 00:58:25,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1014. [2022-11-26 00:58:25,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 1002 states have (on average 1.340319361277445) internal successors, (1343), 1013 states have internal predecessors, (1343), 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:58:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1343 transitions. [2022-11-26 00:58:25,467 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1343 transitions. Word has length 81 [2022-11-26 00:58:25,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:58:25,468 INFO L495 AbstractCegarLoop]: Abstraction has 1014 states and 1343 transitions. [2022-11-26 00:58:25,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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:58:25,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1343 transitions. [2022-11-26 00:58:25,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-26 00:58:25,469 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:58:25,469 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:58:25,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-26 00:58:25,470 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:58:25,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:58:25,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1816895466, now seen corresponding path program 2 times [2022-11-26 00:58:25,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:58:25,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52833953] [2022-11-26 00:58:25,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:58:25,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:58:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:58:25,534 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-26 00:58:25,535 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:58:25,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52833953] [2022-11-26 00:58:25,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52833953] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:58:25,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:58:25,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:58:25,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359080047] [2022-11-26 00:58:25,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:58:25,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:58:25,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:58:25,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:58:25,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:58:25,537 INFO L87 Difference]: Start difference. First operand 1014 states and 1343 transitions. Second operand has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 states have internal predecessors, (73), 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:58:25,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:58:25,823 INFO L93 Difference]: Finished difference Result 1015 states and 1343 transitions. [2022-11-26 00:58:25,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:58:25,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 states have internal predecessors, (73), 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 81 [2022-11-26 00:58:25,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:58:25,828 INFO L225 Difference]: With dead ends: 1015 [2022-11-26 00:58:25,829 INFO L226 Difference]: Without dead ends: 1012 [2022-11-26 00:58:25,831 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:58:25,832 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 54 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:58:25,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 61 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:58:25,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2022-11-26 00:58:26,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1012. [2022-11-26 00:58:26,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1002 states have (on average 1.30938123752495) internal successors, (1312), 1011 states have internal predecessors, (1312), 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:58:26,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1312 transitions. [2022-11-26 00:58:26,032 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1312 transitions. Word has length 81 [2022-11-26 00:58:26,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:58:26,032 INFO L495 AbstractCegarLoop]: Abstraction has 1012 states and 1312 transitions. [2022-11-26 00:58:26,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 states have internal predecessors, (73), 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:58:26,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1312 transitions. [2022-11-26 00:58:26,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-26 00:58:26,034 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:58:26,034 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:58:26,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-26 00:58:26,034 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:58:26,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:58:26,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1325175212, now seen corresponding path program 3 times [2022-11-26 00:58:26,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:58:26,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415667265] [2022-11-26 00:58:26,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:58:26,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:58:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:58:26,138 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 00:58:26,138 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:58:26,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415667265] [2022-11-26 00:58:26,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415667265] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:58:26,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:58:26,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:58:26,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905226360] [2022-11-26 00:58:26,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:58:26,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:58:26,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:58:26,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:58:26,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:58:26,140 INFO L87 Difference]: Start difference. First operand 1012 states and 1312 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:58:26,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:58:26,286 INFO L93 Difference]: Finished difference Result 1429 states and 1829 transitions. [2022-11-26 00:58:26,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:58:26,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 81 [2022-11-26 00:58:26,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:58:26,288 INFO L225 Difference]: With dead ends: 1429 [2022-11-26 00:58:26,289 INFO L226 Difference]: Without dead ends: 437 [2022-11-26 00:58:26,290 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:58:26,290 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 24 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:58:26,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 142 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:58:26,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-11-26 00:58:26,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 418. [2022-11-26 00:58:26,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 408 states have (on average 1.2794117647058822) internal successors, (522), 417 states have internal predecessors, (522), 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:58:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 522 transitions. [2022-11-26 00:58:26,354 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 522 transitions. Word has length 81 [2022-11-26 00:58:26,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:58:26,354 INFO L495 AbstractCegarLoop]: Abstraction has 418 states and 522 transitions. [2022-11-26 00:58:26,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:58:26,354 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 522 transitions. [2022-11-26 00:58:26,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-11-26 00:58:26,355 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:58:26,355 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:58:26,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-26 00:58:26,356 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:58:26,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:58:26,356 INFO L85 PathProgramCache]: Analyzing trace with hash -489184462, now seen corresponding path program 1 times [2022-11-26 00:58:26,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:58:26,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514249225] [2022-11-26 00:58:26,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:58:26,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:58:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:58:26,418 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-26 00:58:26,418 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:58:26,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514249225] [2022-11-26 00:58:26,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514249225] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:58:26,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:58:26,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:58:26,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100721714] [2022-11-26 00:58:26,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:58:26,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:58:26,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:58:26,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:58:26,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:58:26,421 INFO L87 Difference]: Start difference. First operand 418 states and 522 transitions. Second operand has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 states have internal predecessors, (73), 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:58:26,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:58:26,562 INFO L93 Difference]: Finished difference Result 419 states and 522 transitions. [2022-11-26 00:58:26,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:58:26,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 states have internal predecessors, (73), 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 82 [2022-11-26 00:58:26,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:58:26,564 INFO L225 Difference]: With dead ends: 419 [2022-11-26 00:58:26,564 INFO L226 Difference]: Without dead ends: 416 [2022-11-26 00:58:26,565 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:58:26,565 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 51 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:58:26,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 56 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:58:26,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-11-26 00:58:26,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 410. [2022-11-26 00:58:26,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 402 states have (on average 1.2313432835820894) internal successors, (495), 409 states have internal predecessors, (495), 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:58:26,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 495 transitions. [2022-11-26 00:58:26,637 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 495 transitions. Word has length 82 [2022-11-26 00:58:26,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:58:26,637 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 495 transitions. [2022-11-26 00:58:26,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 states have internal predecessors, (73), 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:58:26,637 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 495 transitions. [2022-11-26 00:58:26,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-26 00:58:26,638 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:58:26,638 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:58:26,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-26 00:58:26,639 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:58:26,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:58:26,639 INFO L85 PathProgramCache]: Analyzing trace with hash 2015151000, now seen corresponding path program 1 times [2022-11-26 00:58:26,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:58:26,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065840285] [2022-11-26 00:58:26,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:58:26,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:58:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:58:26,736 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:58:26,736 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:58:26,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065840285] [2022-11-26 00:58:26,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065840285] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:58:26,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:58:26,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:58:26,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586708922] [2022-11-26 00:58:26,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:58:26,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:58:26,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:58:26,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:58:26,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:58:26,738 INFO L87 Difference]: Start difference. First operand 410 states and 495 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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:58:26,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:58:26,813 INFO L93 Difference]: Finished difference Result 622 states and 741 transitions. [2022-11-26 00:58:26,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:58:26,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 83 [2022-11-26 00:58:26,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:58:26,815 INFO L225 Difference]: With dead ends: 622 [2022-11-26 00:58:26,815 INFO L226 Difference]: Without dead ends: 252 [2022-11-26 00:58:26,816 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:58:26,817 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 14 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 146 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:58:26,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 146 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:58:26,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-11-26 00:58:26,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 246. [2022-11-26 00:58:26,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 238 states have (on average 1.1932773109243697) internal successors, (284), 245 states have internal predecessors, (284), 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:58:26,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 284 transitions. [2022-11-26 00:58:26,887 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 284 transitions. Word has length 83 [2022-11-26 00:58:26,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:58:26,888 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 284 transitions. [2022-11-26 00:58:26,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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:58:26,888 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 284 transitions. [2022-11-26 00:58:26,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-26 00:58:26,890 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:58:26,890 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:58:26,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-26 00:58:26,891 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:58:26,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:58:26,891 INFO L85 PathProgramCache]: Analyzing trace with hash -412724424, now seen corresponding path program 1 times [2022-11-26 00:58:26,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:58:26,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114200461] [2022-11-26 00:58:26,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:58:26,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:58:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:58:26,949 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-26 00:58:26,950 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:58:26,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114200461] [2022-11-26 00:58:26,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114200461] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:58:26,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:58:26,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:58:26,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182027731] [2022-11-26 00:58:26,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:58:26,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:58:26,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:58:26,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:58:26,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:58:26,953 INFO L87 Difference]: Start difference. First operand 246 states and 284 transitions. Second operand has 3 states, 2 states have (on average 38.5) internal successors, (77), 3 states have internal predecessors, (77), 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:58:27,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:58:27,049 INFO L93 Difference]: Finished difference Result 247 states and 284 transitions. [2022-11-26 00:58:27,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:58:27,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 38.5) internal successors, (77), 3 states have internal predecessors, (77), 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 84 [2022-11-26 00:58:27,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:58:27,050 INFO L225 Difference]: With dead ends: 247 [2022-11-26 00:58:27,051 INFO L226 Difference]: Without dead ends: 244 [2022-11-26 00:58:27,051 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:58:27,052 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 44 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:58:27,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 50 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:58:27,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-11-26 00:58:27,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 238. [2022-11-26 00:58:27,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 232 states have (on average 1.168103448275862) internal successors, (271), 237 states have internal predecessors, (271), 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:58:27,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 271 transitions. [2022-11-26 00:58:27,110 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 271 transitions. Word has length 84 [2022-11-26 00:58:27,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:58:27,111 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 271 transitions. [2022-11-26 00:58:27,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 38.5) internal successors, (77), 3 states have internal predecessors, (77), 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:58:27,111 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 271 transitions. [2022-11-26 00:58:27,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-11-26 00:58:27,114 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:58:27,114 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:58:27,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-26 00:58:27,115 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:58:27,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:58:27,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1016833922, now seen corresponding path program 1 times [2022-11-26 00:58:27,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:58:27,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233935579] [2022-11-26 00:58:27,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:58:27,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:58:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:58:27,177 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-26 00:58:27,178 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:58:27,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233935579] [2022-11-26 00:58:27,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233935579] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:58:27,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:58:27,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:58:27,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597372294] [2022-11-26 00:58:27,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:58:27,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:58:27,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:58:27,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:58:27,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:58:27,181 INFO L87 Difference]: Start difference. First operand 238 states and 271 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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:58:27,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:58:27,284 INFO L93 Difference]: Finished difference Result 439 states and 512 transitions. [2022-11-26 00:58:27,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:58:27,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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) Word has length 85 [2022-11-26 00:58:27,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:58:27,286 INFO L225 Difference]: With dead ends: 439 [2022-11-26 00:58:27,287 INFO L226 Difference]: Without dead ends: 298 [2022-11-26 00:58:27,287 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:58:27,288 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 38 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:58:27,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 158 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:58:27,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-11-26 00:58:27,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 293. [2022-11-26 00:58:27,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 287 states have (on average 1.1602787456445993) internal successors, (333), 292 states have internal predecessors, (333), 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:58:27,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 333 transitions. [2022-11-26 00:58:27,364 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 333 transitions. Word has length 85 [2022-11-26 00:58:27,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:58:27,364 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 333 transitions. [2022-11-26 00:58:27,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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:58:27,365 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 333 transitions. [2022-11-26 00:58:27,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-26 00:58:27,366 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:58:27,366 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:58:27,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-26 00:58:27,366 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:58:27,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:58:27,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1316264089, now seen corresponding path program 1 times [2022-11-26 00:58:27,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:58:27,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079303877] [2022-11-26 00:58:27,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:58:27,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:58:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:58:27,431 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-26 00:58:27,431 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:58:27,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079303877] [2022-11-26 00:58:27,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079303877] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:58:27,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:58:27,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:58:27,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737909982] [2022-11-26 00:58:27,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:58:27,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:58:27,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:58:27,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:58:27,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:58:27,433 INFO L87 Difference]: Start difference. First operand 293 states and 333 transitions. Second operand has 3 states, 2 states have (on average 41.5) internal successors, (83), 3 states have internal predecessors, (83), 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:58:27,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:58:27,540 INFO L93 Difference]: Finished difference Result 294 states and 333 transitions. [2022-11-26 00:58:27,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:58:27,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 41.5) internal successors, (83), 3 states have internal predecessors, (83), 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 89 [2022-11-26 00:58:27,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:58:27,542 INFO L225 Difference]: With dead ends: 294 [2022-11-26 00:58:27,542 INFO L226 Difference]: Without dead ends: 291 [2022-11-26 00:58:27,543 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:58:27,543 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 36 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:58:27,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 50 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:58:27,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-11-26 00:58:27,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 252. [2022-11-26 00:58:27,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 248 states have (on average 1.1370967741935485) internal successors, (282), 251 states have internal predecessors, (282), 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:58:27,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 282 transitions. [2022-11-26 00:58:27,619 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 282 transitions. Word has length 89 [2022-11-26 00:58:27,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:58:27,619 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 282 transitions. [2022-11-26 00:58:27,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 41.5) internal successors, (83), 3 states have internal predecessors, (83), 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:58:27,620 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 282 transitions. [2022-11-26 00:58:27,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-11-26 00:58:27,621 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:58:27,621 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:58:27,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-26 00:58:27,621 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:58:27,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:58:27,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1284876936, now seen corresponding path program 4 times [2022-11-26 00:58:27,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:58:27,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761768122] [2022-11-26 00:58:27,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:58:27,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:58:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:58:28,266 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-26 00:58:28,266 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:58:28,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761768122] [2022-11-26 00:58:28,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761768122] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:58:28,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765403795] [2022-11-26 00:58:28,267 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 00:58:28,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:58:28,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:58:28,271 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:58:28,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 00:58:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:58:28,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-26 00:58:28,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:58:28,466 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-26 00:58:28,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:58:28,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765403795] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:58:28,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 00:58:28,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2022-11-26 00:58:28,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649509182] [2022-11-26 00:58:28,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:58:28,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:58:28,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:58:28,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:58:28,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-26 00:58:28,469 INFO L87 Difference]: Start difference. First operand 252 states and 282 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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:58:28,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:58:28,612 INFO L93 Difference]: Finished difference Result 381 states and 430 transitions. [2022-11-26 00:58:28,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:58:28,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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 97 [2022-11-26 00:58:28,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:58:28,614 INFO L225 Difference]: With dead ends: 381 [2022-11-26 00:58:28,614 INFO L226 Difference]: Without dead ends: 220 [2022-11-26 00:58:28,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-26 00:58:28,615 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 28 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:58:28,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 295 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:58:28,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-26 00:58:28,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2022-11-26 00:58:28,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 216 states have (on average 1.1064814814814814) internal successors, (239), 219 states have internal predecessors, (239), 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:58:28,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 239 transitions. [2022-11-26 00:58:28,680 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 239 transitions. Word has length 97 [2022-11-26 00:58:28,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:58:28,681 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 239 transitions. [2022-11-26 00:58:28,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 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:58:28,681 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 239 transitions. [2022-11-26 00:58:28,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-26 00:58:28,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:58:28,682 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:58:28,693 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-26 00:58:28,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:58:28,888 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:58:28,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:58:28,889 INFO L85 PathProgramCache]: Analyzing trace with hash -2121831527, now seen corresponding path program 1 times [2022-11-26 00:58:28,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:58:28,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264205803] [2022-11-26 00:58:28,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:58:28,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:58:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:58:28,970 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-26 00:58:28,970 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:58:28,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264205803] [2022-11-26 00:58:28,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264205803] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:58:28,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:58:28,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:58:28,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428750816] [2022-11-26 00:58:28,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:58:28,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:58:28,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:58:28,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:58:28,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:58:28,972 INFO L87 Difference]: Start difference. First operand 220 states and 239 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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:58:29,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:58:29,079 INFO L93 Difference]: Finished difference Result 347 states and 383 transitions. [2022-11-26 00:58:29,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:58:29,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 103 [2022-11-26 00:58:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:58:29,081 INFO L225 Difference]: With dead ends: 347 [2022-11-26 00:58:29,081 INFO L226 Difference]: Without dead ends: 220 [2022-11-26 00:58:29,082 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:58:29,082 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 16 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:58:29,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 102 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:58:29,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-26 00:58:29,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 190. [2022-11-26 00:58:29,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 186 states have (on average 1.096774193548387) internal successors, (204), 189 states have internal predecessors, (204), 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:58:29,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 204 transitions. [2022-11-26 00:58:29,142 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 204 transitions. Word has length 103 [2022-11-26 00:58:29,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:58:29,143 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 204 transitions. [2022-11-26 00:58:29,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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:58:29,143 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 204 transitions. [2022-11-26 00:58:29,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-26 00:58:29,144 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:58:29,145 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:58:29,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-26 00:58:29,145 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-26 00:58:29,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:58:29,146 INFO L85 PathProgramCache]: Analyzing trace with hash 283875224, now seen corresponding path program 1 times [2022-11-26 00:58:29,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:58:29,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14202652] [2022-11-26 00:58:29,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:58:29,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:58:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:58:29,809 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-26 00:58:29,810 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:58:29,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14202652] [2022-11-26 00:58:29,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14202652] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:58:29,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231577922] [2022-11-26 00:58:29,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:58:29,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:58:29,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:58:29,813 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:58:29,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 00:58:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:58:29,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-26 00:58:29,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:58:30,737 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 4 proven. 63 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-26 00:58:30,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:58:31,597 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-26 00:58:31,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231577922] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:58:31,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1065987578] [2022-11-26 00:58:31,603 INFO L159 IcfgInterpreter]: Started Sifa with 55 locations of interest [2022-11-26 00:58:31,603 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:58:31,604 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:58:31,605 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:58:31,605 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:58:32,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:58:32,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:58:32,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:58:32,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-11-26 00:58:32,236 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:58:32,237 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:58:32,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-11-26 00:58:43,808 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:59:04,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1065987578] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:59:04,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:59:04,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [6, 5, 6] total 56 [2022-11-26 00:59:04,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179841212] [2022-11-26 00:59:04,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:59:04,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-26 00:59:04,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:59:04,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-26 00:59:04,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=2519, Unknown=0, NotChecked=0, Total=3192 [2022-11-26 00:59:04,395 INFO L87 Difference]: Start difference. First operand 190 states and 204 transitions. Second operand has 44 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 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:59:19,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:59:19,434 INFO L93 Difference]: Finished difference Result 283 states and 313 transitions. [2022-11-26 00:59:19,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-26 00:59:19,434 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 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 109 [2022-11-26 00:59:19,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:59:19,435 INFO L225 Difference]: With dead ends: 283 [2022-11-26 00:59:19,435 INFO L226 Difference]: Without dead ends: 0 [2022-11-26 00:59:19,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 256 SyntacticMatches, 20 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2910 ImplicationChecksByTransitivity, 33.6s TimeCoverageRelationStatistics Valid=1256, Invalid=4750, Unknown=0, NotChecked=0, Total=6006 [2022-11-26 00:59:19,437 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 129 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:59:19,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 76 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-26 00:59:19,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-26 00:59:19,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-26 00:59:19,439 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:59:19,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-26 00:59:19,439 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 109 [2022-11-26 00:59:19,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:59:19,439 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-26 00:59:19,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 43 states have internal predecessors, (60), 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:59:19,440 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-26 00:59:19,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-26 00:59:19,442 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-11-26 00:59:19,443 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-11-26 00:59:19,443 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-11-26 00:59:19,444 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-11-26 00:59:19,444 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-11-26 00:59:19,444 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-11-26 00:59:19,444 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-11-26 00:59:19,444 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-11-26 00:59:19,444 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-11-26 00:59:19,445 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-11-26 00:59:19,445 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-11-26 00:59:19,445 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-11-26 00:59:19,445 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-11-26 00:59:19,445 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-11-26 00:59:19,458 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 00:59:19,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:59:19,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-26 00:59:46,014 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-11-26 00:59:46,014 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 280) no Hoare annotation was computed. [2022-11-26 00:59:46,014 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 407) no Hoare annotation was computed. [2022-11-26 00:59:46,014 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-26 00:59:46,015 INFO L895 garLoopResultBuilder]: At program point L284(lines 265 285) the Hoare annotation is: false [2022-11-26 00:59:46,015 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 447) no Hoare annotation was computed. [2022-11-26 00:59:46,015 INFO L902 garLoopResultBuilder]: At program point L466(lines 58 469) the Hoare annotation is: true [2022-11-26 00:59:46,015 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-11-26 00:59:46,016 INFO L895 garLoopResultBuilder]: At program point L318(lines 146 331) the Hoare annotation is: (let ((.cse27 (+ ~nomsg~0 1)) (.cse43 (+ ~p3_new~0 1))) (let ((.cse0 (<= 0 ~id3~0)) (.cse1 (<= 0 .cse43)) (.cse28 (= ~mode2~0 1)) (.cse2 (<= 0 ~id1~0)) (.cse31 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse29 (<= 0 |ULTIMATE.start_main_~main__i2~0#1|)) (.cse30 (<= |#NULL.offset| 0)) (.cse4 (<= 0 ~st1~0)) (.cse5 (<= ~__return_1389~0 1)) (.cse6 (<= 1 ~__return_1389~0)) (.cse32 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse7 (<= 0 ~st2~0)) (.cse33 (<= ~p1~0 0)) (.cse34 (<= ~__return_main~0 0)) (.cse35 (<= 0 ~p2~0)) (.cse8 (<= 0 ~send2~0)) (.cse36 (= ~mode1~0 1)) (.cse9 (<= ~id1~0 127)) (.cse37 (<= |ULTIMATE.start_main_~main__i2~0#1| 0)) (.cse11 (<= .cse27 0)) (.cse38 (<= 0 ~__return_main~0)) (.cse12 (<= ~id3~0 127)) (.cse13 (<= 0 ~id2~0)) (.cse14 (<= 0 .cse27)) (.cse39 (<= ~p2~0 0)) (.cse15 (<= ~id2~0 127)) (.cse16 (<= 0 ~st3~0)) (.cse17 (<= .cse43 0)) (.cse18 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse40 (<= 0 |#NULL.offset|)) (.cse19 (= ~p3~0 0)) (.cse41 (<= 0 ~__return_1465~0)) (.cse20 (<= 0 ~send3~0)) (.cse21 (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)) (.cse42 (<= 0 ~p1~0)) (.cse22 (<= 0 |#StackHeapBarrier|)) (.cse23 (<= 0 ~send1~0)) (.cse24 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse25 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse26 (= |#NULL.base| 0))) (or (let ((.cse10 (+ ~p2_new~0 1)) (.cse3 (+ ~p1_new~0 1))) (and (<= |ULTIMATE.start_main_~check__tmp~0#1| 1) (= ~mode3~0 1) .cse0 .cse1 (<= ~st2~0 1) .cse2 (= (* 256 (div ~mode2~0 256)) ~mode2~0) (= |ULTIMATE.start_main_~check__tmp~0#1| ~__return_1465~0) (= ~p2~0 0) (<= .cse3 0) (<= ~mode2~0 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~st1~0 1) (<= 0 .cse10) (not (= (mod |ULTIMATE.start_main_~assert__arg~0#1| 256) 0)) .cse11 (= |ULTIMATE.start_main_~assert__arg~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|) (<= .cse10 0) (= ~mode1~0 0) .cse12 (<= ~st3~0 1) .cse13 (= |#NULL.offset| 0) .cse14 (<= 0 ~mode2~0) .cse15 .cse16 .cse17 .cse18 .cse19 (<= 0 .cse3) (= (ite (= |ULTIMATE.start_main_~main__c1~0#1| 0) 0 1) |ULTIMATE.start_main_~__tmp_1~0#1|) (= |ULTIMATE.start_main_~main__c1~0#1| ~__return_1465~0) .cse20 .cse21 (= ~p1~0 0) .cse22 .cse23 .cse24 (= ~__return_main~0 0) .cse25 .cse26 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (and (<= .cse27 ~id3~0) .cse1 .cse28 .cse2 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0) .cse29 .cse30 (<= .cse31 1) .cse4 .cse5 .cse6 .cse32 .cse7 .cse33 .cse34 .cse35 .cse8 .cse36 .cse9 .cse37 .cse11 .cse38 .cse12 .cse13 .cse14 .cse39 .cse15 .cse16 .cse17 .cse18 .cse40 .cse19 .cse41 .cse20 .cse21 .cse42 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse28 .cse2 (<= .cse31 0) .cse29 .cse30 .cse4 .cse5 .cse6 .cse32 .cse7 .cse33 .cse34 .cse35 .cse8 .cse36 .cse9 .cse37 .cse11 .cse38 .cse12 .cse13 .cse14 .cse39 .cse15 .cse16 .cse17 .cse18 .cse40 .cse19 .cse41 .cse20 .cse21 .cse42 .cse22 .cse23 .cse24 .cse25 .cse26)))) [2022-11-26 00:59:46,016 INFO L895 garLoopResultBuilder]: At program point L368(lines 126 381) the Hoare annotation is: (let ((.cse39 (+ ~nomsg~0 1)) (.cse40 (+ ~p2_new~0 1)) (.cse38 (+ ~p3_new~0 1))) (let ((.cse0 (<= 0 ~id3~0)) (.cse1 (<= 0 .cse38)) (.cse2 (<= 0 ~id1~0)) (.cse33 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse3 (= ~p2~0 0)) (.cse34 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse5 (<= 0 ~st1~0)) (.cse6 (<= ~__return_1389~0 1)) (.cse7 (<= 1 ~__return_1389~0)) (.cse35 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse8 (<= 0 ~st2~0)) (.cse9 (<= 0 ~send2~0)) (.cse36 (= ~mode1~0 1)) (.cse10 (<= ~id1~0 127)) (.cse11 (<= 0 .cse40)) (.cse12 (<= .cse39 0)) (.cse13 (<= .cse40 0)) (.cse14 (<= ~id3~0 127)) (.cse15 (<= 0 ~id2~0)) (.cse16 (= |#NULL.offset| 0)) (.cse17 (<= 0 .cse39)) (.cse18 (<= ~id2~0 127)) (.cse19 (<= 0 ~st3~0)) (.cse20 (<= .cse38 0)) (.cse21 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse22 (= ~p3~0 0)) (.cse37 (<= 0 ~__return_1465~0)) (.cse23 (<= 0 ~send3~0)) (.cse24 (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)) (.cse25 (= ~p1~0 0)) (.cse26 (<= 0 |#StackHeapBarrier|)) (.cse27 (<= 0 ~send1~0)) (.cse28 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse29 (= ~__return_main~0 0)) (.cse30 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse31 (= |#NULL.base| 0)) (.cse32 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (let ((.cse4 (+ ~p1_new~0 1))) (and (<= |ULTIMATE.start_main_~check__tmp~0#1| 1) (= ~mode3~0 1) .cse0 .cse1 (= ~mode2~0 1) (<= ~st2~0 1) .cse2 (= |ULTIMATE.start_main_~check__tmp~0#1| ~__return_1465~0) .cse3 (<= .cse4 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~st1~0 1) .cse11 (not (= (mod |ULTIMATE.start_main_~assert__arg~0#1| 256) 0)) .cse12 (= |ULTIMATE.start_main_~assert__arg~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|) .cse13 (= ~mode1~0 0) .cse14 (<= ~st3~0 1) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (<= 0 .cse4) (= (ite (= |ULTIMATE.start_main_~main__c1~0#1| 0) 0 1) |ULTIMATE.start_main_~__tmp_1~0#1|) (= |ULTIMATE.start_main_~main__c1~0#1| ~__return_1465~0) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32)) (and .cse0 .cse1 .cse2 .cse33 .cse3 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0) (<= .cse34 1) .cse5 .cse6 .cse7 .cse35 .cse8 .cse9 .cse36 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse37 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) (and .cse0 .cse1 .cse2 .cse33 .cse3 (<= .cse34 0) .cse5 .cse6 .cse7 .cse35 .cse8 .cse9 .cse36 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse37 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32)))) [2022-11-26 00:59:46,017 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-11-26 00:59:46,017 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 402) no Hoare annotation was computed. [2022-11-26 00:59:46,017 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 442) no Hoare annotation was computed. [2022-11-26 00:59:46,017 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 397) no Hoare annotation was computed. [2022-11-26 00:59:46,018 INFO L895 garLoopResultBuilder]: At program point L354(lines 128 355) the Hoare annotation is: (let ((.cse1 (+ ~p2_new~0 1)) (.cse0 (+ ~p1_new~0 1))) (and (= ~mode3~0 1) (<= 0 ~id3~0) (= ~mode2~0 1) (not (= 255 (mod ~r1~0 256))) (<= 0 ~id1~0) (= |ULTIMATE.start_main_~check__tmp~0#1| ~__return_1465~0) (<= .cse0 0) (= ~p3_new~0 ~nomsg~0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 1) (<= 0 ~st1~0) (<= ~__return_1389~0 1) (<= 1 ~__return_1389~0) (<= 0 ~st2~0) (<= 0 ~p2~0) (<= 0 ~send2~0) (= ~mode1~0 1) (<= ~id1~0 127) (<= 0 .cse1) (not (= (mod |ULTIMATE.start_main_~assert__arg~0#1| 256) 0)) (= |ULTIMATE.start_main_~assert__arg~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|) (<= .cse1 0) (<= ~id3~0 127) (<= 0 ~id2~0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= ~p2~0 0) (<= ~id2~0 127) (<= 0 ~st3~0) (<= (+ ~p3_new~0 1) 0) (<= |ULTIMATE.start_main_~init__tmp~0#1| 1) (= ~p3~0 0) (<= 0 .cse0) (= (ite (= |ULTIMATE.start_main_~main__c1~0#1| 0) 0 1) |ULTIMATE.start_main_~__tmp_1~0#1|) (= |ULTIMATE.start_main_~main__c1~0#1| ~__return_1465~0) (<= ~__return_1465~0 1) (<= 0 ~send3~0) (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) (= ~p1~0 0) (<= 0 |#StackHeapBarrier|) (<= 0 ~send1~0) (<= 0 |ULTIMATE.start_main_~main__c1~0#1|) (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~0#1|) (= ~__return_main~0 0) (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|) (= |#NULL.base| 0) (= |ULTIMATE.start_main_~main__i2~0#1| 0))) [2022-11-26 00:59:46,018 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 437) no Hoare annotation was computed. [2022-11-26 00:59:46,018 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-11-26 00:59:46,019 INFO L895 garLoopResultBuilder]: At program point L206(lines 114 383) the Hoare annotation is: (let ((.cse88 (select |#memory_int| 1)) (.cse85 (+ ~p1_new~0 1)) (.cse86 (+ ~p3_new~0 1))) (let ((.cse4 (+ ~nomsg~0 1)) (.cse87 (+ ~p2_new~0 1)) (.cse49 (<= |ULTIMATE.start_main_~check__tmp~0#1| 1)) (.cse7 (<= 0 ~id3~0)) (.cse50 (<= 0 .cse86)) (.cse10 (<= 0 ~id1~0)) (.cse52 (<= .cse85 0)) (.cse61 (not (= (mod |ULTIMATE.start_main_~assert__arg~0#1| 256) 0))) (.cse6 (= 48 (select |#length| 2))) (.cse8 (= (select |#length| 3) 12)) (.cse9 (= ~nomsg~0 ~p1_new~0)) (.cse12 (= (select ~nodes~0.base 0) |#funAddr~node1.base|)) (.cse13 (= 2 (select |#length| 1))) (.cse14 (= ~send3~0 ~id3~0)) (.cse15 (= ~p3_new~0 ~nomsg~0)) (.cse16 (= |#funAddr~node3.base| (select ~nodes~0.base 2))) (.cse17 (= (select |#valid| 3) 1)) (.cse18 (= ~st3~0 0)) (.cse19 (= ~nomsg~0 ~p2_old~0)) (.cse20 (not (= ~id3~0 ~id2~0))) (.cse21 (= |#funAddr~node2.base| (select ~nodes~0.base 1))) (.cse22 (not (= ~id1~0 ~id3~0))) (.cse23 (= |ULTIMATE.start_main_~main__c1~0#1| 0)) (.cse25 (not (= ~id1~0 ~id2~0))) (.cse26 (= ~nomsg~0 ~p1_old~0)) (.cse28 (= (select ~nodes~0.offset 0) |#funAddr~node1.offset|)) (.cse29 (= (select |#valid| 1) 1)) (.cse30 (= ~send1~0 ~id1~0)) (.cse31 (= (select |#valid| 0) 0)) (.cse33 (= (select |#valid| 2) 1)) (.cse35 (= ~st2~0 0)) (.cse36 (= ~p3_old~0 ~nomsg~0)) (.cse37 (= (select .cse88 0) 48)) (.cse38 (= (select ~nodes~0.offset 2) |#funAddr~node3.offset|)) (.cse41 (= (select .cse88 1) 0)) (.cse80 (mod ~r1~0 256)) (.cse43 (= |#funAddr~node2.offset| (select ~nodes~0.offset 1))) (.cse45 (< 0 |#StackHeapBarrier|)) (.cse46 (= ~send2~0 ~id2~0)) (.cse1 (+ ~st3~0 ~st2~0 ~st1~0))) (let ((.cse75 (<= .cse1 1)) (.cse84 (or (and .cse49 .cse7 .cse50 .cse10 .cse52 .cse61) (and .cse6 .cse8 .cse9 (= (mod ~mode3~0 256) 0) (= (mod ~mode2~0 256) 0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= (mod ~mode1~0 256) 0) .cse21 .cse22 .cse23 (= ~st1~0 0) .cse25 .cse26 .cse28 .cse29 .cse30 .cse31 .cse33 .cse35 .cse36 .cse37 .cse38 .cse41 (= .cse80 0) .cse43 .cse45 .cse46))) (.cse0 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse51 (= |ULTIMATE.start_main_~check__tmp~0#1| ~__return_1465~0)) (.cse53 (<= 0 ~mode3~0)) (.cse54 (<= ~mode2~0 1)) (.cse2 (<= 0 ~st1~0)) (.cse55 (<= ~__return_1389~0 1)) (.cse56 (<= 1 ~__return_1389~0)) (.cse3 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse57 (<= 0 ~st2~0)) (.cse58 (<= ~mode3~0 1)) (.cse76 (<= 0 ~p2~0)) (.cse59 (<= 0 ~send2~0)) (.cse24 (<= ~id1~0 127)) (.cse60 (<= 0 .cse87)) (.cse5 (<= .cse4 0)) (.cse62 (= |ULTIMATE.start_main_~assert__arg~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|)) (.cse63 (<= .cse87 0)) (.cse77 (= ~mode1~0 0)) (.cse32 (<= ~id3~0 127)) (.cse78 (<= 0 ~id2~0)) (.cse34 (= |#NULL.offset| 0)) (.cse64 (<= 0 .cse4)) (.cse79 (<= ~p2~0 0)) (.cse65 (<= 0 ~mode2~0)) (.cse39 (<= ~id2~0 127)) (.cse66 (<= 0 ~st3~0)) (.cse67 (<= .cse86 0)) (.cse81 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse40 (= ~p3~0 0)) (.cse68 (<= 0 .cse85)) (.cse69 (= (ite .cse23 0 1) |ULTIMATE.start_main_~__tmp_1~0#1|)) (.cse70 (= |ULTIMATE.start_main_~main__c1~0#1| ~__return_1465~0)) (.cse71 (<= 0 ~send3~0)) (.cse72 (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)) (.cse42 (= ~p1~0 0)) (.cse73 (<= 0 |#StackHeapBarrier|)) (.cse74 (<= 0 ~send1~0)) (.cse82 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse44 (= ~__return_main~0 0)) (.cse83 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse47 (= |#NULL.base| 0)) (.cse48 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (and .cse0 (= (* 256 (div ~mode1~0 256)) ~mode1~0) (<= .cse1 0) .cse2 .cse3 (<= .cse4 ~id2~0) .cse5 (<= ~r1~0 (* (div ~r1~0 256) 256)) (let ((.cse11 (= ~p2~0 0)) (.cse27 (= |ULTIMATE.start_main_~init__tmp~0#1| 1))) (or (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~__return_1465~0 0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= |ULTIMATE.start_main_~init__tmp~0#1| ~__return_1389~0) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (= ~nomsg~0 ~p2_new~0) .cse25 .cse26 .cse27 .cse28 .cse29 (= .cse4 0) .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48) (and .cse49 .cse7 .cse50 (<= 0 |ULTIMATE.start_main_~check__tmp~0#1|) .cse10 .cse51 .cse11 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse24 .cse27 .cse60 .cse61 (<= ~mode1~0 1) .cse62 .cse63 .cse32 .cse34 .cse64 .cse65 .cse39 .cse66 .cse67 .cse40 .cse68 .cse69 .cse70 .cse71 .cse72 .cse42 .cse73 .cse74 .cse44 .cse47 .cse48)))) (and .cse49 (<= .cse4 ~id3~0) .cse50 (<= .cse4 ~send2~0) .cse10 .cse0 .cse51 .cse52 .cse53 .cse54 .cse75 .cse2 .cse55 .cse56 .cse3 .cse57 .cse58 .cse76 .cse24 .cse60 .cse61 .cse5 .cse62 .cse63 .cse77 .cse32 .cse78 .cse34 .cse64 .cse79 .cse65 .cse39 .cse66 (not (< .cse80 3)) .cse67 .cse81 .cse40 .cse68 .cse69 .cse70 .cse71 .cse72 .cse42 .cse73 .cse74 .cse82 .cse44 .cse83 .cse47 .cse48) (and (= ~mode3~0 1) .cse84 (= ~mode2~0 1) .cse51 .cse75 .cse2 .cse55 .cse56 .cse57 .cse76 .cse59 (= ~mode1~0 1) .cse24 .cse60 .cse5 .cse62 .cse63 .cse32 .cse78 .cse34 .cse64 .cse79 .cse39 .cse66 .cse67 .cse81 .cse40 .cse68 .cse69 .cse70 .cse71 .cse72 .cse42 .cse73 .cse74 .cse82 .cse44 .cse83 .cse47 .cse48) (and .cse84 .cse0 .cse51 .cse53 (= .cse1 0) .cse54 .cse2 .cse55 .cse56 .cse3 .cse57 .cse58 .cse76 .cse59 .cse24 .cse60 .cse5 .cse62 .cse63 .cse77 .cse32 .cse78 .cse34 .cse64 .cse79 .cse65 .cse39 .cse66 .cse67 .cse81 .cse40 .cse68 .cse69 .cse70 .cse71 .cse72 .cse42 .cse73 .cse74 .cse82 .cse44 .cse83 .cse47 .cse48))))) [2022-11-26 00:59:46,020 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-26 00:59:46,020 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-11-26 00:59:46,021 INFO L895 garLoopResultBuilder]: At program point L273(lines 161 286) the Hoare annotation is: (let ((.cse38 (+ ~nomsg~0 1))) (let ((.cse1 (<= 0 ~id3~0)) (.cse10 (<= 0 ~send2~0)) (.cse0 (= ~mode3~0 1)) (.cse2 (= ~mode2~0 1)) (.cse3 (<= 0 ~id1~0)) (.cse4 (= ~p2~0 0)) (.cse5 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse6 (<= 0 ~st1~0)) (.cse7 (<= ~__return_1389~0 1)) (.cse8 (<= 1 ~__return_1389~0)) (.cse9 (<= 0 ~st2~0)) (.cse11 (= ~mode1~0 1)) (.cse12 (<= ~id1~0 127)) (.cse13 (<= .cse38 0)) (.cse14 (<= ~id3~0 127)) (.cse15 (<= 0 ~id2~0)) (.cse16 (= |#NULL.offset| 0)) (.cse17 (<= 0 .cse38)) (.cse18 (<= ~id2~0 127)) (.cse19 (<= 0 ~st3~0)) (.cse20 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse21 (= ~p3~0 0)) (.cse22 (<= 0 ~__return_1465~0)) (.cse23 (<= 0 ~send3~0)) (.cse24 (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)) (.cse25 (= ~p1~0 0)) (.cse26 (<= 0 |#StackHeapBarrier|)) (.cse27 (<= 0 ~send1~0)) (.cse28 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse29 (= ~__return_main~0 0)) (.cse30 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse31 (= |#NULL.base| 0)) (.cse32 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) (let ((.cse37 (+ ~p2_new~0 1)) (.cse33 (+ ~p3_new~0 1)) (.cse34 (+ ~p1_new~0 1)) (.cse35 (= |ULTIMATE.start_main_~main__c1~0#1| 0))) (and (= (* 256 (div ~mode2~0 256)) ~mode2~0) (= |ULTIMATE.start_main_~check__tmp~0#1| ~__return_1465~0) (or (and (<= |ULTIMATE.start_main_~check__tmp~0#1| 1) .cse1 (<= 0 .cse33) (<= ~st2~0 1) .cse3 .cse4 (<= .cse34 0) (not (= (mod |ULTIMATE.start_main_~assert__arg~0#1| 256) 0))) (let ((.cse36 (select |#memory_int| 1))) (and (= 48 (select |#length| 2)) (= (select |#length| 3) 12) (= ~nomsg~0 ~p1_new~0) .cse4 (= (select ~nodes~0.base 0) |#funAddr~node1.base|) (= 2 (select |#length| 1)) (= ~send3~0 ~id3~0) (= ~p3_new~0 ~nomsg~0) (= |#funAddr~node3.base| (select ~nodes~0.base 2)) (= (select |#valid| 3) 1) (= ~st3~0 0) (= ~nomsg~0 ~p2_old~0) (not (= ~id3~0 ~id2~0)) (= |#funAddr~node2.base| (select ~nodes~0.base 1)) (not (= ~id1~0 ~id3~0)) .cse35 (= ~st1~0 0) (not (= ~id1~0 ~id2~0)) (= ~nomsg~0 ~p1_old~0) (= (select ~nodes~0.offset 0) |#funAddr~node1.offset|) (= (select |#valid| 1) 1) (= ~send1~0 ~id1~0) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= ~st2~0 0) (= ~p3_old~0 ~nomsg~0) (= (select .cse36 0) 48) (= (select ~nodes~0.offset 2) |#funAddr~node3.offset|) (= (select .cse36 1) 0) (= (mod ~r1~0 256) 0) (= |#funAddr~node2.offset| (select ~nodes~0.offset 1)) (< 0 |#StackHeapBarrier|) (= ~send2~0 ~id2~0)))) (<= 0 ~mode3~0) (<= ~mode2~0 1) .cse6 .cse7 .cse8 (= (* 256 (div ~mode3~0 256)) ~mode3~0) .cse9 (<= ~mode3~0 1) .cse10 .cse12 (<= ~st1~0 1) (= |ULTIMATE.start_main_~init__tmp~0#1| 1) (<= 0 .cse37) .cse13 (= |ULTIMATE.start_main_~assert__arg~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|) (<= .cse37 0) (= ~mode1~0 0) .cse14 (<= ~st3~0 1) .cse15 .cse16 .cse17 (<= 0 ~mode2~0) .cse18 .cse19 (<= .cse33 0) .cse21 (<= 0 .cse34) (= (ite .cse35 0 1) |ULTIMATE.start_main_~__tmp_1~0#1|) (= |ULTIMATE.start_main_~main__c1~0#1| ~__return_1465~0) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32)) (and (<= .cse38 ~id3~0) .cse0 .cse2 (<= .cse38 ~send2~0) .cse3 .cse4 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0) (<= .cse5 1) .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32)))) [2022-11-26 00:59:46,022 INFO L895 garLoopResultBuilder]: At program point L240(lines 181 241) the Hoare annotation is: (let ((.cse53 (+ ~p2_new~0 1)) (.cse51 (+ ~p1_new~0 1)) (.cse52 (+ ~nomsg~0 1)) (.cse50 (+ ~st3~0 ~st2~0 ~st1~0))) (let ((.cse0 (<= |ULTIMATE.start_main_~check__tmp~0#1| 1)) (.cse2 (<= 0 |ULTIMATE.start_main_~check__tmp~0#1|)) (.cse6 (<= .cse50 1)) (.cse1 (<= .cse52 ~id3~0)) (.cse38 (<= .cse52 ~send3~0)) (.cse39 (<= .cse52 ~send2~0)) (.cse42 (= (* 256 (div ~mode1~0 256)) ~mode1~0)) (.cse46 (<= .cse52 ~id2~0)) (.cse47 (<= .cse52 0)) (.cse3 (<= 0 ~id1~0)) (.cse40 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse4 (<= .cse51 0)) (.cse41 (<= 0 ~mode3~0)) (.cse5 (= ~p3_new~0 ~nomsg~0)) (.cse43 (<= ~mode2~0 1)) (.cse7 (<= 0 ~st1~0)) (.cse8 (<= ~__return_1389~0 1)) (.cse9 (<= 1 ~__return_1389~0)) (.cse44 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse10 (<= 0 ~st2~0)) (.cse45 (<= ~mode3~0 1)) (.cse11 (<= 0 ~p2~0)) (.cse12 (<= 0 ~send2~0)) (.cse13 (<= ~id1~0 127)) (.cse14 (<= 0 .cse53)) (.cse15 (<= .cse53 0)) (.cse48 (= ~mode1~0 0)) (.cse16 (<= ~id3~0 127)) (.cse17 (<= 0 ~id2~0)) (.cse18 (= |#NULL.offset| 0)) (.cse19 (<= 0 .cse52)) (.cse20 (<= ~p2~0 0)) (.cse49 (<= 0 ~mode2~0)) (.cse21 (<= ~id2~0 127)) (.cse22 (<= 0 ~st3~0)) (.cse23 (<= (+ ~p3_new~0 1) 0)) (.cse24 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse25 (= ~p3~0 0)) (.cse26 (<= 0 .cse51)) (.cse27 (<= 0 ~__return_1465~0)) (.cse28 (<= 0 ~send3~0)) (.cse29 (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)) (.cse30 (= ~p1~0 0)) (.cse31 (<= 0 |#StackHeapBarrier|)) (.cse32 (<= 0 ~send1~0)) (.cse33 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse34 (= ~__return_main~0 0)) (.cse35 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse36 (= |#NULL.base| 0)) (.cse37 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (and .cse0 .cse1 (= ~mode3~0 1) (= ~mode2~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~mode1~0 1) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) (and .cse0 .cse1 .cse38 .cse39 .cse2 .cse3 .cse40 .cse4 .cse41 .cse42 .cse5 .cse43 .cse6 .cse7 .cse8 .cse9 .cse44 .cse10 .cse45 .cse11 .cse46 .cse13 .cse14 .cse47 .cse15 .cse48 .cse16 .cse18 .cse19 .cse20 .cse49 .cse21 .cse22 (not (< (mod ~r1~0 256) 3)) .cse24 .cse25 .cse26 .cse27 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) (and .cse1 .cse38 .cse39 .cse40 .cse42 (= |ULTIMATE.start_main_~check__tmp~0#1| 0) (<= (+ ~st2~0 ~st1~0) 2147483647) .cse7 .cse44 .cse46 .cse47 .cse48 (not (<= (+ 2147483649 ~st3~0 ~st2~0 ~st1~0) 0)) (not (<= (+ 2147483649 ~st2~0 ~st1~0) 0)) (<= .cse50 2147483647)) (and (<= 0 ~id3~0) .cse3 .cse40 .cse4 .cse41 (= |ULTIMATE.start_main_~check__tmp~0#1| 1) .cse5 (= .cse50 0) .cse43 .cse7 .cse8 .cse9 .cse44 .cse10 .cse45 .cse11 .cse12 .cse13 .cse14 .cse15 .cse48 .cse16 .cse17 .cse18 .cse19 .cse20 .cse49 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37)))) [2022-11-26 00:59:46,022 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 392) no Hoare annotation was computed. [2022-11-26 00:59:46,023 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-11-26 00:59:46,023 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 432) no Hoare annotation was computed. [2022-11-26 00:59:46,023 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-11-26 00:59:46,024 INFO L895 garLoopResultBuilder]: At program point L324(lines 312 325) the Hoare annotation is: (let ((.cse41 (+ |ULTIMATE.start_main_~node2__m2~0#1| 1)) (.cse43 (+ ~nomsg~0 1)) (.cse44 (+ ~p2_new~0 1)) (.cse42 (+ ~p3_new~0 1))) (let ((.cse0 (<= 0 ~id3~0)) (.cse1 (<= 0 .cse42)) (.cse2 (<= 0 ~id1~0)) (.cse3 (= (mod ~mode2~0 256) 0)) (.cse5 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse4 (= ~send2~0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1|)) (.cse6 (<= 0 ~st1~0)) (.cse7 (<= ~__return_1389~0 1)) (.cse8 (<= 1 ~__return_1389~0)) (.cse9 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse10 (<= 0 ~st2~0)) (.cse11 (<= 0 ~p2~0)) (.cse12 (<= 0 ~send2~0)) (.cse13 (= ~mode1~0 1)) (.cse14 (<= ~id1~0 127)) (.cse15 (<= 0 .cse44)) (.cse16 (<= .cse43 0)) (.cse17 (<= .cse44 0)) (.cse18 (<= ~id3~0 127)) (.cse19 (<= 0 ~id2~0)) (.cse20 (= |#NULL.offset| 0)) (.cse21 (<= 0 .cse43)) (.cse22 (<= ~p2~0 0)) (.cse23 (<= ~id2~0 127)) (.cse24 (<= 0 ~st3~0)) (.cse25 (<= .cse42 0)) (.cse26 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse27 (<= 0 .cse41)) (.cse28 (= ~p3~0 0)) (.cse29 (<= 0 ~__return_1465~0)) (.cse30 (<= 0 ~send3~0)) (.cse31 (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)) (.cse32 (= ~p1~0 0)) (.cse33 (<= 0 |#StackHeapBarrier|)) (.cse34 (<= 0 ~send1~0)) (.cse35 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse36 (<= .cse41 0)) (.cse37 (= ~__return_main~0 0)) (.cse38 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse39 (= |#NULL.base| 0)) (.cse40 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0) .cse4 (<= .cse5 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40) (and .cse0 .cse1 .cse2 .cse3 (<= .cse5 0) .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40)))) [2022-11-26 00:59:46,024 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 381) no Hoare annotation was computed. [2022-11-26 00:59:46,025 INFO L895 garLoopResultBuilder]: At program point L374(lines 362 375) the Hoare annotation is: (let ((.cse86 (select |#memory_int| 1)) (.cse68 (= |ULTIMATE.start_main_~main__c1~0#1| 0)) (.cse83 (+ ~p1_new~0 1)) (.cse84 (+ ~p3_new~0 1))) (let ((.cse0 (+ ~nomsg~0 1)) (.cse85 (+ ~p2_new~0 1)) (.cse4 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse44 (<= 0 ~id3~0)) (.cse45 (<= 0 .cse84)) (.cse42 (<= 0 ~id1~0)) (.cse46 (= |ULTIMATE.start_main_~check__tmp~0#1| ~__return_1465~0)) (.cse43 (<= .cse83 0)) (.cse47 (<= 0 ~mode3~0)) (.cse48 (<= ~mode2~0 1)) (.cse49 (<= ~mode3~0 1)) (.cse50 (<= ~mode1~0 1)) (.cse51 (= |ULTIMATE.start_main_~assert__arg~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|)) (.cse52 (<= 0 ~mode2~0)) (.cse53 (= (ite .cse68 0 1) |ULTIMATE.start_main_~__tmp_1~0#1|)) (.cse54 (= |ULTIMATE.start_main_~main__c1~0#1| ~__return_1465~0)) (.cse55 (= 48 (select |#length| 2))) (.cse56 (= (select |#length| 3) 12)) (.cse57 (= ~__return_1465~0 0)) (.cse58 (= (select ~nodes~0.base 0) |#funAddr~node1.base|)) (.cse59 (= 2 (select |#length| 1))) (.cse60 (= ~send3~0 ~id3~0)) (.cse61 (= ~p3_new~0 ~nomsg~0)) (.cse62 (= |#funAddr~node3.base| (select ~nodes~0.base 2))) (.cse63 (= (select |#valid| 3) 1)) (.cse64 (= ~nomsg~0 ~p2_old~0)) (.cse65 (not (= ~id3~0 ~id2~0))) (.cse66 (= |#funAddr~node2.base| (select ~nodes~0.base 1))) (.cse67 (not (= ~id1~0 ~id3~0))) (.cse69 (not (= ~id1~0 ~id2~0))) (.cse70 (= ~nomsg~0 ~p1_old~0)) (.cse71 (= (select ~nodes~0.offset 0) |#funAddr~node1.offset|)) (.cse72 (= (select |#valid| 1) 1)) (.cse73 (= ~send1~0 ~id1~0)) (.cse74 (= (select |#valid| 0) 0)) (.cse75 (= (select |#valid| 2) 1)) (.cse76 (= ~p3_old~0 ~nomsg~0)) (.cse77 (= (select .cse86 0) 48)) (.cse78 (= (select ~nodes~0.offset 2) |#funAddr~node3.offset|)) (.cse79 (= (select .cse86 1) 0)) (.cse80 (= |#funAddr~node2.offset| (select ~nodes~0.offset 1))) (.cse81 (< 0 |#StackHeapBarrier|)) (.cse82 (= ~send2~0 ~id2~0))) (let ((.cse1 (or (and (<= |ULTIMATE.start_main_~check__tmp~0#1| 1) .cse44 .cse45 (<= ~st2~0 1) .cse42 .cse46 .cse43 .cse47 .cse48 .cse49 (<= ~st1~0 1) (not (= (mod |ULTIMATE.start_main_~assert__arg~0#1| 256) 0)) .cse50 .cse51 (<= ~st3~0 1) .cse52 .cse53 .cse54) (and .cse55 .cse56 (= ~nomsg~0 ~p1_new~0) (= (mod ~mode3~0 256) 0) (= (mod ~mode2~0 256) 0) .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 (= ~st3~0 0) .cse64 .cse65 .cse66 .cse67 .cse68 (= ~st1~0 0) .cse69 .cse70 .cse71 .cse72 .cse73 .cse74 .cse75 (= ~st2~0 0) .cse76 .cse77 .cse78 .cse79 (= (mod ~r1~0 256) 0) .cse80 .cse81 .cse82))) (.cse17 (= ~mode1~0 0)) (.cse35 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse2 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse40 (<= .cse4 0)) (.cse5 (<= 0 ~st1~0)) (.cse6 (<= ~__return_1389~0 1)) (.cse7 (<= 1 ~__return_1389~0)) (.cse8 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse9 (<= 0 ~st2~0)) (.cse10 (<= ~p1~0 0)) (.cse11 (<= ~__return_main~0 0)) (.cse12 (<= 0 ~p2~0)) (.cse41 (<= 0 ~send2~0)) (.cse13 (<= ~id1~0 127)) (.cse14 (<= 0 .cse85)) (.cse15 (<= .cse0 0)) (.cse16 (<= .cse85 0)) (.cse3 (* (div ~r1~0 256) 256)) (.cse18 (<= 0 ~__return_main~0)) (.cse19 (<= ~id3~0 127)) (.cse20 (<= 0 ~id2~0)) (.cse21 (= |#NULL.offset| 0)) (.cse22 (<= 0 .cse0)) (.cse23 (<= ~p2~0 0)) (.cse24 (<= ~id2~0 127)) (.cse25 (<= 0 ~st3~0)) (.cse26 (<= .cse84 0)) (.cse27 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse28 (= ~p3~0 0)) (.cse29 (<= 0 .cse83)) (.cse30 (<= 0 ~send3~0)) (.cse31 (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)) (.cse32 (<= 0 ~p1~0)) (.cse33 (<= 0 |#StackHeapBarrier|)) (.cse34 (<= 0 ~send1~0)) (.cse36 (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~0#1|)) (.cse37 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse38 (= |#NULL.base| 0)) (.cse39 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (and (<= .cse0 ~send2~0) .cse1 .cse2 (< (+ .cse3 2) ~r1~0) (<= .cse4 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39) (and .cse1 .cse2 .cse40 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse41 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39) (and .cse42 .cse2 .cse43 .cse40 (= (mod ~mode1~0 256) 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse41 .cse13 .cse14 .cse15 .cse16 (<= ~r1~0 .cse3) .cse18 (or (and .cse44 .cse45 .cse46 .cse47 (= |ULTIMATE.start_main_~check__tmp~0#1| 1) .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54) (and .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66 .cse67 .cse68 .cse69 .cse70 .cse71 .cse72 .cse73 .cse74 .cse75 .cse76 .cse77 .cse78 .cse79 .cse80 .cse81 .cse82)) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 .cse39))))) [2022-11-26 00:59:46,025 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-11-26 00:59:46,025 INFO L899 garLoopResultBuilder]: For program point L226(line 226) no Hoare annotation was computed. [2022-11-26 00:59:46,025 INFO L899 garLoopResultBuilder]: For program point L226-1(line 226) no Hoare annotation was computed. [2022-11-26 00:59:46,025 INFO L899 garLoopResultBuilder]: For program point L226-2(line 226) no Hoare annotation was computed. [2022-11-26 00:59:46,026 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 132) no Hoare annotation was computed. [2022-11-26 00:59:46,026 INFO L899 garLoopResultBuilder]: For program point L226-3(line 226) no Hoare annotation was computed. [2022-11-26 00:59:46,026 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 427) no Hoare annotation was computed. [2022-11-26 00:59:46,026 INFO L899 garLoopResultBuilder]: For program point L226-4(lines 226 234) no Hoare annotation was computed. [2022-11-26 00:59:46,026 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 467) no Hoare annotation was computed. [2022-11-26 00:59:46,027 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 132) no Hoare annotation was computed. [2022-11-26 00:59:46,027 INFO L895 garLoopResultBuilder]: At program point L161(lines 161 286) the Hoare annotation is: (let ((.cse0 (+ ~nomsg~0 1)) (.cse44 (+ ~p3_new~0 1))) (let ((.cse41 (<= 0 ~id3~0)) (.cse1 (<= 0 .cse44)) (.cse2 (= ~mode2~0 1)) (.cse3 (<= 0 ~id1~0)) (.cse6 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse4 (<= 0 |ULTIMATE.start_main_~main__i2~0#1|)) (.cse5 (<= |#NULL.offset| 0)) (.cse7 (<= 0 ~st1~0)) (.cse8 (<= ~__return_1389~0 1)) (.cse9 (<= 1 ~__return_1389~0)) (.cse10 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse11 (<= 0 ~st2~0)) (.cse12 (<= ~p1~0 0)) (.cse13 (<= ~__return_main~0 0)) (.cse14 (<= 0 ~p2~0)) (.cse15 (<= 0 ~send2~0)) (.cse16 (= ~mode1~0 1)) (.cse17 (<= ~id1~0 127)) (.cse18 (<= |ULTIMATE.start_main_~main__i2~0#1| 0)) (.cse19 (<= .cse0 0)) (.cse20 (<= 0 ~__return_main~0)) (.cse21 (<= ~id3~0 127)) (.cse22 (<= 0 ~id2~0)) (.cse23 (<= 0 .cse0)) (.cse24 (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~0#1|)) (.cse25 (<= ~p2~0 0)) (.cse26 (<= ~id2~0 127)) (.cse27 (<= 0 ~st3~0)) (.cse28 (<= .cse44 0)) (.cse29 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse30 (<= 0 |#NULL.offset|)) (.cse31 (= ~p3~0 0)) (.cse32 (<= 0 ~__return_1465~0)) (.cse33 (<= 0 ~send3~0)) (.cse34 (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)) (.cse35 (<= 0 ~p1~0)) (.cse36 (<= 0 |#StackHeapBarrier|)) (.cse37 (<= 0 ~send1~0)) (.cse38 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse39 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse40 (= |#NULL.base| 0))) (or (and (<= .cse0 ~id3~0) .cse1 .cse2 .cse3 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0) .cse4 .cse5 (<= .cse6 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40) (let ((.cse43 (+ ~p2_new~0 1)) (.cse42 (+ ~p1_new~0 1))) (and (<= |ULTIMATE.start_main_~check__tmp~0#1| 1) (= ~mode3~0 1) .cse41 .cse1 (<= ~st2~0 1) .cse3 (= (* 256 (div ~mode2~0 256)) ~mode2~0) (= |ULTIMATE.start_main_~check__tmp~0#1| ~__return_1465~0) (<= .cse42 0) (<= ~mode2~0 1) .cse7 .cse8 .cse9 .cse11 .cse14 .cse15 .cse17 (<= ~st1~0 1) (<= 0 .cse43) (not (= (mod |ULTIMATE.start_main_~assert__arg~0#1| 256) 0)) .cse19 (= |ULTIMATE.start_main_~assert__arg~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|) (<= .cse43 0) (= ~mode1~0 0) .cse21 (<= ~st3~0 1) .cse22 (= |#NULL.offset| 0) .cse23 .cse24 .cse25 (<= 0 ~mode2~0) .cse26 .cse27 .cse28 .cse29 .cse31 (<= 0 .cse42) (= (ite (= |ULTIMATE.start_main_~main__c1~0#1| 0) 0 1) |ULTIMATE.start_main_~__tmp_1~0#1|) (= |ULTIMATE.start_main_~main__c1~0#1| ~__return_1465~0) .cse33 .cse34 (= ~p1~0 0) .cse36 .cse37 .cse38 (= ~__return_main~0 0) .cse39 .cse40 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (and .cse41 .cse1 .cse2 .cse3 (<= .cse6 0) .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40)))) [2022-11-26 00:59:46,027 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 330) no Hoare annotation was computed. [2022-11-26 00:59:46,028 INFO L899 garLoopResultBuilder]: For program point L360(lines 360 380) no Hoare annotation was computed. [2022-11-26 00:59:46,028 INFO L895 garLoopResultBuilder]: At program point L228(lines 183 235) the Hoare annotation is: (let ((.cse46 (+ ~p2_new~0 1)) (.cse5 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse45 (+ ~p1_new~0 1)) (.cse44 (+ ~nomsg~0 1))) (let ((.cse42 (<= .cse44 ~id3~0)) (.cse0 (<= 0 ~id1~0)) (.cse1 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse2 (<= .cse45 0)) (.cse3 (<= 0 ~mode3~0)) (.cse4 (= ~p3_new~0 ~nomsg~0)) (.cse6 (<= ~mode2~0 1)) (.cse43 (<= .cse5 1)) (.cse7 (<= 0 ~st1~0)) (.cse8 (<= ~__return_1389~0 1)) (.cse9 (<= 1 ~__return_1389~0)) (.cse10 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse11 (<= 0 ~st2~0)) (.cse12 (<= ~mode3~0 1)) (.cse13 (<= 0 ~p2~0)) (.cse14 (<= 0 ~send2~0)) (.cse15 (<= ~id1~0 127)) (.cse16 (<= 0 .cse46)) (.cse17 (<= .cse46 0)) (.cse18 (= ~mode1~0 0)) (.cse19 (<= ~id3~0 127)) (.cse20 (<= 0 ~id2~0)) (.cse21 (= |#NULL.offset| 0)) (.cse22 (<= 0 .cse44)) (.cse23 (<= ~p2~0 0)) (.cse24 (<= 0 ~mode2~0)) (.cse25 (<= ~id2~0 127)) (.cse26 (<= 0 ~st3~0)) (.cse27 (<= (+ ~p3_new~0 1) 0)) (.cse28 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse29 (= ~p3~0 0)) (.cse30 (<= 0 .cse45)) (.cse31 (<= 0 ~__return_1465~0)) (.cse32 (<= 0 ~send3~0)) (.cse33 (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)) (.cse34 (= ~p1~0 0)) (.cse35 (<= 0 |#StackHeapBarrier|)) (.cse36 (<= 0 ~send1~0)) (.cse37 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse38 (= ~__return_main~0 0)) (.cse39 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse40 (= |#NULL.base| 0)) (.cse41 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (and (<= 0 ~id3~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= .cse5 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41) (and .cse42 (= ~mode3~0 1) (= ~mode2~0 1) .cse0 .cse2 .cse4 .cse43 .cse7 .cse8 .cse9 .cse11 .cse13 .cse14 (= ~mode1~0 1) .cse15 .cse16 (<= .cse44 0) .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse25 .cse26 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41) (and .cse42 (not (<= ~r1~0 (+ (* (div ~r1~0 256) 256) 2))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse43 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41)))) [2022-11-26 00:59:46,028 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 422) no Hoare annotation was computed. [2022-11-26 00:59:46,029 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-11-26 00:59:46,029 INFO L899 garLoopResultBuilder]: For program point L212-1(line 212) no Hoare annotation was computed. [2022-11-26 00:59:46,029 INFO L895 garLoopResultBuilder]: At program point L146(lines 146 331) the Hoare annotation is: (let ((.cse40 (+ ~nomsg~0 1)) (.cse41 (+ ~p2_new~0 1)) (.cse39 (+ ~p3_new~0 1))) (let ((.cse0 (<= 0 ~id3~0)) (.cse1 (<= 0 .cse39)) (.cse2 (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~0#1|)) (.cse3 (<= 0 ~id1~0)) (.cse4 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse5 (= ~p2~0 0)) (.cse6 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse7 (<= 0 ~st1~0)) (.cse8 (<= ~__return_1389~0 1)) (.cse9 (<= 1 ~__return_1389~0)) (.cse10 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse11 (<= 0 ~st2~0)) (.cse12 (<= 0 ~send2~0)) (.cse13 (= ~mode1~0 1)) (.cse14 (<= ~id1~0 127)) (.cse15 (<= 0 .cse41)) (.cse16 (<= .cse40 0)) (.cse17 (<= .cse41 0)) (.cse18 (<= ~id3~0 127)) (.cse19 (<= 0 ~id2~0)) (.cse20 (= |#NULL.offset| 0)) (.cse21 (<= 0 .cse40)) (.cse22 (<= ~id2~0 127)) (.cse23 (<= 0 ~st3~0)) (.cse24 (<= .cse39 0)) (.cse25 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse26 (= ~p3~0 0)) (.cse27 (<= 0 ~__return_1465~0)) (.cse28 (<= 0 ~send3~0)) (.cse29 (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)) (.cse30 (= ~p1~0 0)) (.cse31 (<= 0 |#StackHeapBarrier|)) (.cse32 (<= 0 ~send1~0)) (.cse33 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse34 (= ~__return_main~0 0)) (.cse35 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse36 (= |#NULL.base| 0)) (.cse37 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= .cse6 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) (let ((.cse38 (+ ~p1_new~0 1))) (and (<= |ULTIMATE.start_main_~check__tmp~0#1| 1) (= ~mode3~0 1) .cse0 .cse1 (= ~mode2~0 1) .cse2 (<= ~st2~0 1) .cse3 (= |ULTIMATE.start_main_~check__tmp~0#1| ~__return_1465~0) .cse5 (<= .cse38 0) .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 (<= ~st1~0 1) .cse15 (not (= (mod |ULTIMATE.start_main_~assert__arg~0#1| 256) 0)) .cse16 (= |ULTIMATE.start_main_~assert__arg~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|) .cse17 (= ~mode1~0 0) .cse18 (<= ~st3~0 1) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (<= 0 .cse38) (= (ite (= |ULTIMATE.start_main_~main__c1~0#1| 0) 0 1) |ULTIMATE.start_main_~__tmp_1~0#1|) (= |ULTIMATE.start_main_~main__c1~0#1| ~__return_1465~0) .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0) (<= .cse6 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37)))) [2022-11-26 00:59:46,030 INFO L899 garLoopResultBuilder]: For program point L212-2(line 212) no Hoare annotation was computed. [2022-11-26 00:59:46,030 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 387) no Hoare annotation was computed. [2022-11-26 00:59:46,030 INFO L899 garLoopResultBuilder]: For program point L212-3(line 212) no Hoare annotation was computed. [2022-11-26 00:59:46,030 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 462) no Hoare annotation was computed. [2022-11-26 00:59:46,030 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-11-26 00:59:46,030 INFO L899 garLoopResultBuilder]: For program point L312(lines 312 325) no Hoare annotation was computed. [2022-11-26 00:59:46,031 INFO L895 garLoopResultBuilder]: At program point L279(lines 267 280) the Hoare annotation is: (let ((.cse0 (+ ~nomsg~0 1))) (let ((.cse1 (= ~mode2~0 1)) (.cse2 (<= 0 ~id1~0)) (.cse3 (= ~p3_new~0 ~nomsg~0)) (.cse6 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse4 (<= 0 |ULTIMATE.start_main_~main__i2~0#1|)) (.cse5 (<= |#NULL.offset| 0)) (.cse7 (<= 0 ~st1~0)) (.cse8 (<= ~__return_1389~0 1)) (.cse9 (<= 1 ~__return_1389~0)) (.cse10 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse11 (<= 0 ~st2~0)) (.cse12 (<= ~p1~0 0)) (.cse13 (<= ~__return_main~0 0)) (.cse14 (<= 0 ~p2~0)) (.cse15 (<= 0 ~send2~0)) (.cse16 (= ~mode1~0 1)) (.cse17 (<= ~id1~0 127)) (.cse18 (<= |ULTIMATE.start_main_~main__i2~0#1| 0)) (.cse19 (<= 0 ~__return_main~0)) (.cse20 (<= ~id3~0 127)) (.cse21 (<= 0 ~id2~0)) (.cse22 (<= 0 .cse0)) (.cse23 (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~0#1|)) (.cse24 (<= ~p2~0 0)) (.cse25 (= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| ~send3~0)) (.cse26 (<= ~id2~0 127)) (.cse27 (<= 0 ~st3~0)) (.cse28 (<= (+ ~p3_new~0 1) 0)) (.cse29 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse30 (<= 0 |#NULL.offset|)) (.cse31 (= ~p3~0 0)) (.cse32 (<= 0 ~__return_1465~0)) (.cse33 (<= 0 ~send3~0)) (.cse34 (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|)) (.cse35 (<= 0 ~p1~0)) (.cse36 (<= 0 |#StackHeapBarrier|)) (.cse37 (<= 0 ~send1~0)) (.cse38 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse39 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse40 (= |#NULL.base| 0))) (or (and (<= .cse0 ~id3~0) .cse1 .cse2 (< (+ (* (div ~r1~0 256) 256) 2) ~r1~0) .cse3 .cse4 .cse5 (<= .cse6 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40) (and (<= 0 ~id3~0) .cse1 .cse2 .cse3 (<= .cse6 0) .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40)))) [2022-11-26 00:59:46,031 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-11-26 00:59:46,031 INFO L899 garLoopResultBuilder]: For program point L362(lines 362 375) no Hoare annotation was computed. [2022-11-26 00:59:46,032 INFO L895 garLoopResultBuilder]: At program point L329(lines 310 330) the Hoare annotation is: false [2022-11-26 00:59:46,032 INFO L899 garLoopResultBuilder]: For program point L98(lines 98 417) no Hoare annotation was computed. [2022-11-26 00:59:46,032 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-11-26 00:59:46,032 INFO L895 garLoopResultBuilder]: At program point L379(lines 360 380) the Hoare annotation is: false [2022-11-26 00:59:46,032 INFO L899 garLoopResultBuilder]: For program point L181(line 181) no Hoare annotation was computed. [2022-11-26 00:59:46,032 INFO L899 garLoopResultBuilder]: For program point L181-1(line 181) no Hoare annotation was computed. [2022-11-26 00:59:46,033 INFO L899 garLoopResultBuilder]: For program point L181-2(line 181) no Hoare annotation was computed. [2022-11-26 00:59:46,033 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 457) no Hoare annotation was computed. [2022-11-26 00:59:46,033 INFO L899 garLoopResultBuilder]: For program point L181-3(line 181) no Hoare annotation was computed. [2022-11-26 00:59:46,033 INFO L899 garLoopResultBuilder]: For program point L181-4(lines 181 241) no Hoare annotation was computed. [2022-11-26 00:59:46,034 INFO L895 garLoopResultBuilder]: At program point L132(line 132) the Hoare annotation is: (let ((.cse1 (+ ~p2_new~0 1)) (.cse0 (+ ~p1_new~0 1))) (and (= ~mode3~0 1) (<= 0 ~id3~0) (= ~mode2~0 1) (not (= 255 (mod ~r1~0 256))) (<= 0 ~id1~0) (= |ULTIMATE.start_main_~check__tmp~0#1| ~__return_1465~0) (<= .cse0 0) (= ~p3_new~0 ~nomsg~0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 1) (<= 0 ~st1~0) (<= ~__return_1389~0 1) (<= 1 ~__return_1389~0) (<= 0 ~st2~0) (<= 0 ~p2~0) (<= 0 ~send2~0) (= ~mode1~0 1) (<= ~id1~0 127) (<= 0 .cse1) (not (= (mod |ULTIMATE.start_main_~assert__arg~0#1| 256) 0)) (= |ULTIMATE.start_main_~assert__arg~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|) (<= .cse1 0) (<= ~id3~0 127) (<= 0 ~id2~0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= ~p2~0 0) (<= ~id2~0 127) (<= 0 ~st3~0) (<= (+ ~p3_new~0 1) 0) (<= |ULTIMATE.start_main_~init__tmp~0#1| 1) (= ~p3~0 0) (<= 0 .cse0) (= (ite (= |ULTIMATE.start_main_~main__c1~0#1| 0) 0 1) |ULTIMATE.start_main_~__tmp_1~0#1|) (= |ULTIMATE.start_main_~main__c1~0#1| ~__return_1465~0) (<= ~__return_1465~0 1) (<= 0 ~send3~0) (<= 0 |ULTIMATE.start_main_~node1____CPAchecker_TMP_0~0#1|) (= ~p1~0 0) (<= 0 |#StackHeapBarrier|) (<= 0 ~send1~0) (<= 0 |ULTIMATE.start_main_~main__c1~0#1|) (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~0#1|) (= ~__return_main~0 0) (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|) (= |#NULL.base| 0) (= |ULTIMATE.start_main_~main__i2~0#1| 0))) [2022-11-26 00:59:46,034 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-11-26 00:59:46,034 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 285) no Hoare annotation was computed. [2022-11-26 00:59:46,034 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2022-11-26 00:59:46,034 INFO L899 garLoopResultBuilder]: For program point L100(lines 100 412) no Hoare annotation was computed. [2022-11-26 00:59:46,035 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 235) no Hoare annotation was computed. [2022-11-26 00:59:46,035 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 452) no Hoare annotation was computed. [2022-11-26 00:59:46,039 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:59:46,042 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 00:59:46,106 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,107 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-26 00:59:46,108 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-26 00:59:46,108 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,109 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-26 00:59:46,109 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,110 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,110 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-26 00:59:46,111 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,111 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-26 00:59:46,112 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-26 00:59:46,112 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,115 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,116 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-26 00:59:46,116 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-26 00:59:46,117 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,117 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-26 00:59:46,118 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,118 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,119 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-26 00:59:46,119 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,120 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-26 00:59:46,120 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-26 00:59:46,120 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,131 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,131 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-26 00:59:46,132 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-26 00:59:46,132 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,133 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-26 00:59:46,133 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,133 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,134 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-26 00:59:46,134 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,134 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-26 00:59:46,135 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-26 00:59:46,135 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,135 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,145 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-26 00:59:46,146 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-26 00:59:46,146 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,147 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-26 00:59:46,147 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,148 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,148 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-26 00:59:46,149 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,149 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-26 00:59:46,150 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-26 00:59:46,150 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,151 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,151 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-26 00:59:46,152 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-26 00:59:46,152 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,153 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-26 00:59:46,153 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,154 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,154 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-26 00:59:46,154 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,155 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-26 00:59:46,155 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-26 00:59:46,156 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,159 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,160 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-26 00:59:46,160 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-26 00:59:46,160 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,161 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-26 00:59:46,161 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,161 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,162 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-26 00:59:46,162 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,162 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-26 00:59:46,163 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-26 00:59:46,163 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,163 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,164 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-26 00:59:46,164 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-26 00:59:46,165 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,165 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-26 00:59:46,166 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,166 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,167 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-26 00:59:46,167 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,167 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-26 00:59:46,168 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-26 00:59:46,168 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,169 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,169 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-26 00:59:46,170 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-26 00:59:46,170 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,170 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-26 00:59:46,171 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,171 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,172 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-26 00:59:46,172 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,173 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-26 00:59:46,173 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-26 00:59:46,173 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,177 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,177 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-26 00:59:46,178 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-26 00:59:46,178 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,179 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-26 00:59:46,179 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,180 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,180 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-26 00:59:46,180 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,181 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-26 00:59:46,181 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-26 00:59:46,181 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,182 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,182 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-26 00:59:46,183 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-26 00:59:46,183 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,184 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-26 00:59:46,184 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,185 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,185 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-26 00:59:46,185 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,186 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-26 00:59:46,186 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-26 00:59:46,187 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,187 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,187 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-26 00:59:46,188 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-26 00:59:46,188 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,189 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-26 00:59:46,189 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,189 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,190 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-26 00:59:46,190 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,190 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-26 00:59:46,191 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-26 00:59:46,191 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,194 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,194 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-26 00:59:46,195 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-26 00:59:46,195 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,196 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-26 00:59:46,196 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,197 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,197 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-26 00:59:46,197 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,198 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-26 00:59:46,198 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-26 00:59:46,199 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,199 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,200 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-26 00:59:46,200 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-26 00:59:46,201 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,201 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-26 00:59:46,202 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,202 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,202 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-26 00:59:46,203 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,203 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-26 00:59:46,204 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-26 00:59:46,204 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,205 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,205 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-26 00:59:46,205 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-26 00:59:46,206 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,206 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-26 00:59:46,207 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,207 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,207 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-26 00:59:46,208 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,208 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-26 00:59:46,208 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-26 00:59:46,208 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:59:46 BoogieIcfgContainer [2022-11-26 00:59:46,212 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 00:59:46,212 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 00:59:46,213 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 00:59:46,213 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 00:59:46,213 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:57:28" (3/4) ... [2022-11-26 00:59:46,217 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-26 00:59:46,231 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-11-26 00:59:46,232 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-26 00:59:46,233 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-26 00:59:46,233 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-26 00:59:46,265 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((256 * (mode2 / 256) == mode2 && 256 * (mode1 / 256) == mode1) && st3 + st2 + st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && r1 <= r1 / 256 * 256) && (((((((((((((((((((((((((((((((((((((((((((((((48 == unknown-#length-unknown[2] && 0 <= id3) && unknown-#length-unknown[3] == 12) && nomsg == p1_new) && 0 <= id1) && p2 == 0) && __return_1465 == 0) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && send3 == id3) && p3_new == nomsg) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && st3 == 0) && init__tmp == __return_1389) && nomsg == p2_\old) && !(id3 == id2)) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && main__c1 == 0) && id1 <= 127) && nomsg == p2_new) && !(id1 == id2)) && nomsg == p1_\old) && init__tmp == 1) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && nomsg + 1 == 0) && send1 == id1) && \valid[0] == 0) && id3 <= 127) && \valid[2] == 1) && #NULL == 0) && st2 == 0) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && nodes[2] == #funAddr~node3.offset) && id2 <= 127) && p3 == 0) && unknown-#memory_int-unknown[1][1] == 0) && p1 == 0) && #funAddr~node2.offset == nodes[1]) && __return_main == 0) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((((check__tmp <= 1 && 0 <= id3) && 0 <= p3_new + 1) && 0 <= check__tmp) && 0 <= id1) && check__tmp == __return_1465) && p2 == 0) && p1_new + 1 <= 0) && 0 <= mode3) && mode2 <= 1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && mode3 <= 1) && 0 <= send2) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && mode1 <= 1) && assert__arg == __tmp_1) && p2_new + 1 <= 0) && id3 <= 127) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && __return_main == 0) && #NULL == 0) && main__i2 == 0))) || (((((((((((((((((((((((((((((((((((((((((((((((((check__tmp <= 1 && nomsg + 1 <= id3) && 0 <= p3_new + 1) && nomsg + 1 <= send2) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && check__tmp == __return_1465) && p1_new + 1 <= 0) && 0 <= mode3) && mode2 <= 1) && st3 + st2 + st1 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && id1 <= 127) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && nomsg + 1 <= 0) && assert__arg == __tmp_1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && !(r1 % 256 < 3)) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((((((((mode3 == 1 && ((((((check__tmp <= 1 && 0 <= id3) && 0 <= p3_new + 1) && 0 <= id1) && p1_new + 1 <= 0) && !(assert__arg % 256 == 0)) || ((((((((((((((((((((((((((((((((((48 == unknown-#length-unknown[2] && unknown-#length-unknown[3] == 12) && nomsg == p1_new) && mode3 % 256 == 0) && mode2 % 256 == 0) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && send3 == id3) && p3_new == nomsg) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && st3 == 0) && nomsg == p2_\old) && !(id3 == id2)) && mode1 % 256 == 0) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && main__c1 == 0) && st1 == 0) && !(id1 == id2)) && nomsg == p1_\old) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && send1 == id1) && \valid[0] == 0) && \valid[2] == 1) && st2 == 0) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && nodes[2] == #funAddr~node3.offset) && unknown-#memory_int-unknown[1][1] == 0) && r1 % 256 == 0) && #funAddr~node2.offset == nodes[1]) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2))) && mode2 == 1) && check__tmp == __return_1465) && st3 + st2 + st1 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && assert__arg == __tmp_1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((((((((((((((((((check__tmp <= 1 && 0 <= id3) && 0 <= p3_new + 1) && 0 <= id1) && p1_new + 1 <= 0) && !(assert__arg % 256 == 0)) || ((((((((((((((((((((((((((((((((((48 == unknown-#length-unknown[2] && unknown-#length-unknown[3] == 12) && nomsg == p1_new) && mode3 % 256 == 0) && mode2 % 256 == 0) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && send3 == id3) && p3_new == nomsg) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && st3 == 0) && nomsg == p2_\old) && !(id3 == id2)) && mode1 % 256 == 0) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && main__c1 == 0) && st1 == 0) && !(id1 == id2)) && nomsg == p1_\old) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && send1 == id1) && \valid[0] == 0) && \valid[2] == 1) && st2 == 0) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && nodes[2] == #funAddr~node3.offset) && unknown-#memory_int-unknown[1][1] == 0) && r1 % 256 == 0) && #funAddr~node2.offset == nodes[1]) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2)) && 256 * (mode2 / 256) == mode2) && check__tmp == __return_1465) && 0 <= mode3) && st3 + st2 + st1 == 0) && mode2 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && assert__arg == __tmp_1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) [2022-11-26 00:59:46,265 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((nomsg + 1 <= send2 && ((((((((((((((((((check__tmp <= 1 && 0 <= id3) && 0 <= p3_new + 1) && st2 <= 1) && 0 <= id1) && check__tmp == __return_1465) && p1_new + 1 <= 0) && 0 <= mode3) && mode2 <= 1) && mode3 <= 1) && st1 <= 1) && !(assert__arg % 256 == 0)) && mode1 <= 1) && assert__arg == __tmp_1) && st3 <= 1) && 0 <= mode2) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) || ((((((((((((((((((((((((((((((((((48 == unknown-#length-unknown[2] && unknown-#length-unknown[3] == 12) && nomsg == p1_new) && mode3 % 256 == 0) && mode2 % 256 == 0) && __return_1465 == 0) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && send3 == id3) && p3_new == nomsg) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && st3 == 0) && nomsg == p2_\old) && !(id3 == id2)) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && main__c1 == 0) && st1 == 0) && !(id1 == id2)) && nomsg == p1_\old) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && send1 == id1) && \valid[0] == 0) && \valid[2] == 1) && st2 == 0) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && nodes[2] == #funAddr~node3.offset) && unknown-#memory_int-unknown[1][1] == 0) && r1 % 256 == 0) && #funAddr~node2.offset == nodes[1]) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2))) && 256 * (mode2 / 256) == mode2) && r1 / 256 * 256 + 2 < r1) && st3 + st2 + st1 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && 0 <= p2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && mode1 == 0) && 0 <= __return_main) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && nomsg == node1__m1) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((check__tmp <= 1 && 0 <= id3) && 0 <= p3_new + 1) && st2 <= 1) && 0 <= id1) && check__tmp == __return_1465) && p1_new + 1 <= 0) && 0 <= mode3) && mode2 <= 1) && mode3 <= 1) && st1 <= 1) && !(assert__arg % 256 == 0)) && mode1 <= 1) && assert__arg == __tmp_1) && st3 <= 1) && 0 <= mode2) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) || ((((((((((((((((((((((((((((((((((48 == unknown-#length-unknown[2] && unknown-#length-unknown[3] == 12) && nomsg == p1_new) && mode3 % 256 == 0) && mode2 % 256 == 0) && __return_1465 == 0) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && send3 == id3) && p3_new == nomsg) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && st3 == 0) && nomsg == p2_\old) && !(id3 == id2)) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && main__c1 == 0) && st1 == 0) && !(id1 == id2)) && nomsg == p1_\old) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && send1 == id1) && \valid[0] == 0) && \valid[2] == 1) && st2 == 0) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && nodes[2] == #funAddr~node3.offset) && unknown-#memory_int-unknown[1][1] == 0) && r1 % 256 == 0) && #funAddr~node2.offset == nodes[1]) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2)) && 256 * (mode2 / 256) == mode2) && st3 + st2 + st1 <= 0) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && mode1 == 0) && 0 <= __return_main) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && nomsg == node1__m1) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || ((((((((((((((((((((((((((((((((((((((((0 <= id1 && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && st3 + st2 + st1 <= 0) && mode1 % 256 == 0) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && r1 <= r1 / 256 * 256) && 0 <= __return_main) && ((((((((((((0 <= id3 && 0 <= p3_new + 1) && check__tmp == __return_1465) && 0 <= mode3) && check__tmp == 1) && mode2 <= 1) && mode3 <= 1) && mode1 <= 1) && assert__arg == __tmp_1) && 0 <= mode2) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) || (((((((((((((((((((((((((((48 == unknown-#length-unknown[2] && unknown-#length-unknown[3] == 12) && __return_1465 == 0) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && send3 == id3) && p3_new == nomsg) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && nomsg == p2_\old) && !(id3 == id2)) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && main__c1 == 0) && !(id1 == id2)) && nomsg == p1_\old) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && send1 == id1) && \valid[0] == 0) && \valid[2] == 1) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && nodes[2] == #funAddr~node3.offset) && unknown-#memory_int-unknown[1][1] == 0) && #funAddr~node2.offset == nodes[1]) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2))) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && nomsg == node1__m1) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) [2022-11-26 00:59:46,267 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && mode2 == 1) && 0 <= id1) && p2 == 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && nomsg + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && init__tmp <= 1) && p3 == 0) && 0 <= __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || (((((((((((((((((((((((((((((((((((((((((256 * (mode2 / 256) == mode2 && check__tmp == __return_1465) && ((((((((check__tmp <= 1 && 0 <= id3) && 0 <= p3_new + 1) && st2 <= 1) && 0 <= id1) && p2 == 0) && p1_new + 1 <= 0) && !(assert__arg % 256 == 0)) || ((((((((((((((((((((((((((((((((48 == unknown-#length-unknown[2] && unknown-#length-unknown[3] == 12) && nomsg == p1_new) && p2 == 0) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && send3 == id3) && p3_new == nomsg) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && st3 == 0) && nomsg == p2_\old) && !(id3 == id2)) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && main__c1 == 0) && st1 == 0) && !(id1 == id2)) && nomsg == p1_\old) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && send1 == id1) && \valid[0] == 0) && \valid[2] == 1) && st2 == 0) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && nodes[2] == #funAddr~node3.offset) && unknown-#memory_int-unknown[1][1] == 0) && r1 % 256 == 0) && #funAddr~node2.offset == nodes[1]) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2))) && 0 <= mode3) && mode2 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= send2) && id1 <= 127) && st1 <= 1) && init__tmp == 1) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && assert__arg == __tmp_1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((nomsg + 1 <= id3 && mode3 == 1) && mode2 == 1) && nomsg + 1 <= send2) && 0 <= id1) && p2 == 0) && r1 / 256 * 256 + 2 < r1) && st3 + st2 + st1 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && mode1 == 1) && id1 <= 127) && nomsg + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && init__tmp <= 1) && p3 == 0) && 0 <= __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) [2022-11-26 00:59:46,301 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 00:59:46,301 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 00:59:46,301 INFO L158 Benchmark]: Toolchain (without parser) took 138957.54ms. Allocated memory was 130.0MB in the beginning and 752.9MB in the end (delta: 622.9MB). Free memory was 98.3MB in the beginning and 682.8MB in the end (delta: -584.5MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2022-11-26 00:59:46,302 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 107.0MB. Free memory is still 78.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:59:46,302 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.75ms. Allocated memory is still 130.0MB. Free memory was 98.3MB in the beginning and 98.4MB in the end (delta: -132.2kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-26 00:59:46,302 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.79ms. Allocated memory is still 130.0MB. Free memory was 98.4MB in the beginning and 95.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:59:46,303 INFO L158 Benchmark]: Boogie Preprocessor took 25.71ms. Allocated memory is still 130.0MB. Free memory was 95.7MB in the beginning and 94.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:59:46,303 INFO L158 Benchmark]: RCFGBuilder took 704.21ms. Allocated memory is still 130.0MB. Free memory was 94.2MB in the beginning and 62.8MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-11-26 00:59:46,303 INFO L158 Benchmark]: TraceAbstraction took 137687.14ms. Allocated memory was 130.0MB in the beginning and 752.9MB in the end (delta: 622.9MB). Free memory was 62.1MB in the beginning and 689.1MB in the end (delta: -627.0MB). Peak memory consumption was 423.8MB. Max. memory is 16.1GB. [2022-11-26 00:59:46,304 INFO L158 Benchmark]: Witness Printer took 88.49ms. Allocated memory is still 752.9MB. Free memory was 689.1MB in the beginning and 682.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-26 00:59:46,305 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.29ms. Allocated memory is still 107.0MB. Free memory is still 78.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.75ms. Allocated memory is still 130.0MB. Free memory was 98.3MB in the beginning and 98.4MB in the end (delta: -132.2kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.79ms. Allocated memory is still 130.0MB. Free memory was 98.4MB in the beginning and 95.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.71ms. Allocated memory is still 130.0MB. Free memory was 95.7MB in the beginning and 94.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 704.21ms. Allocated memory is still 130.0MB. Free memory was 94.2MB in the beginning and 62.8MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 137687.14ms. Allocated memory was 130.0MB in the beginning and 752.9MB in the end (delta: 622.9MB). Free memory was 62.1MB in the beginning and 689.1MB in the end (delta: -627.0MB). Peak memory consumption was 423.8MB. Max. memory is 16.1GB. * Witness Printer took 88.49ms. Allocated memory is still 752.9MB. Free memory was 689.1MB in the beginning and 682.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset * 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: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: 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, 73 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 137.4s, OverallIterations: 24, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 33.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 26.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2169 SdHoareTripleChecker+Valid, 6.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2169 mSDsluCounter, 3283 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1631 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3773 IncrementalHoareTripleChecker+Invalid, 3934 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 1652 mSDtfsCounter, 3773 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 731 GetRequests, 499 SyntacticMatches, 29 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5319 ImplicationChecksByTransitivity, 65.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1295occurred in iteration=13, InterpolantAutomatonStates: 189, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 494 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 86 NumberOfFragments, 6571 HoareAnnotationTreeSize, 17 FomulaSimplifications, 39287 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 17 FomulaSimplificationsInter, 23140 FormulaSimplificationTreeSizeReductionInter, 25.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 1779 NumberOfCodeBlocks, 1779 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1917 ConstructedInterpolants, 0 QuantifiedInterpolants, 10993 SizeOfPredicates, 32 NumberOfNonLiveVariables, 1030 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 29 InterpolantComputations, 22 PerfectInterpolantSequences, 604/890 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: 26.5s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 193, DAG_INTERPRETER_EARLY_EXITS: 3, TOOLS_POST_APPLICATIONS: 764, TOOLS_POST_TIME: 21.5s, 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: 760, TOOLS_QUANTIFIERELIM_TIME: 21.1s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.7s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 916, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 104, DOMAIN_JOIN_TIME: 3.2s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 10, DOMAIN_WIDEN_TIME: 0.2s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 18, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 193, DOMAIN_ISBOTTOM_TIME: 0.4s, LOOP_SUMMARIZER_APPLICATIONS: 8, LOOP_SUMMARIZER_CACHE_MISSES: 8, LOOP_SUMMARIZER_OVERALL_TIME: 19.1s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 19.1s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 18, 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.9s, DAG_COMPRESSION_PROCESSED_NODES: 40897, DAG_COMPRESSION_RETAINED_NODES: 478, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= id1) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && 0 <= mode3) && p3_new == nomsg) && st3 + st2 + st1 <= 0) && mode2 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((nomsg + 1 <= id3 && mode3 == 1) && mode2 == 1) && 0 <= id1) && p1_new + 1 <= 0) && p3_new == nomsg) && st3 + st2 + st1 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((((((((((((nomsg + 1 <= id3 && !(r1 <= r1 / 256 * 256 + 2)) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && 0 <= mode3) && p3_new == nomsg) && mode2 <= 1) && st3 + st2 + st1 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) - InvariantResult [Line: 360]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && nomsg == node2__m2) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && p2 == 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((((((((((check__tmp <= 1 && mode3 == 1) && 0 <= id3) && 0 <= p3_new + 1) && mode2 == 1) && nomsg == node2__m2) && st2 <= 1) && 0 <= id1) && check__tmp == __return_1465) && p2 == 0) && p1_new + 1 <= 0) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && 0 <= send2) && id1 <= 127) && st1 <= 1) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && nomsg + 1 <= 0) && assert__arg == __tmp_1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || ((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && nomsg == node2__m2) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && p2 == 0) && r1 / 256 * 256 + 2 < r1) && st3 + st2 + st1 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((nomsg + 1 <= id3 && mode2 == 1) && 0 <= id1) && r1 / 256 * 256 + 2 < r1) && p3_new == nomsg) && 0 <= main__i2) && #NULL <= 0) && st3 + st2 + st1 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && main__i2 <= 0) && 0 <= __return_main) && id3 <= 127) && 0 <= id2) && 0 <= nomsg + 1) && nomsg == node3__m3) && p2 <= 0) && node3____CPAchecker_TMP_0 == send3) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= #NULL) && p3 == 0) && 0 <= __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && 1 <= init__tmp) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((((((0 <= id3 && mode2 == 1) && 0 <= id1) && p3_new == nomsg) && st3 + st2 + st1 <= 0) && 0 <= main__i2) && #NULL <= 0) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && main__i2 <= 0) && 0 <= __return_main) && id3 <= 127) && 0 <= id2) && 0 <= nomsg + 1) && nomsg == node3__m3) && p2 <= 0) && node3____CPAchecker_TMP_0 == send3) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= #NULL) && p3 == 0) && 0 <= __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && 1 <= init__tmp) && #NULL == 0) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((check__tmp <= 1 && mode3 == 1) && 0 <= id3) && 0 <= p3_new + 1) && mode2 == 1) && st2 <= 1) && 0 <= id1) && check__tmp == __return_1465) && p2 == 0) && p1_new + 1 <= 0) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && 0 <= send2) && id1 <= 127) && st1 <= 1) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && nomsg + 1 <= 0) && assert__arg == __tmp_1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || (((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && p2 == 0) && r1 / 256 * 256 + 2 < r1) && st3 + st2 + st1 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || ((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && p2 == 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && mode2 == 1) && !(255 == r1 % 256)) && 0 <= id1) && check__tmp == __return_1465) && p1_new + 1 <= 0) && p3_new == nomsg) && st3 + st2 + st1 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && assert__arg == __tmp_1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) && __return_1465 <= 1) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && nomsg == node1__m1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0 - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((check__tmp <= 1 && mode3 == 1) && 0 <= id3) && 0 <= p3_new + 1) && st2 <= 1) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && check__tmp == __return_1465) && p2 == 0) && p1_new + 1 <= 0) && mode2 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && 0 <= send2) && id1 <= 127) && st1 <= 1) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && nomsg + 1 <= 0) && assert__arg == __tmp_1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((((nomsg + 1 <= id3 && 0 <= p3_new + 1) && mode2 == 1) && 0 <= id1) && r1 / 256 * 256 + 2 < r1) && 0 <= main__i2) && #NULL <= 0) && st3 + st2 + st1 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && main__i2 <= 0) && nomsg + 1 <= 0) && 0 <= __return_main) && id3 <= 127) && 0 <= id2) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= #NULL) && p3 == 0) && 0 <= __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && 1 <= init__tmp) && #NULL == 0)) || (((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && mode2 == 1) && 0 <= id1) && st3 + st2 + st1 <= 0) && 0 <= main__i2) && #NULL <= 0) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && main__i2 <= 0) && nomsg + 1 <= 0) && 0 <= __return_main) && id3 <= 127) && 0 <= id2) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= #NULL) && p3 == 0) && 0 <= __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && 1 <= init__tmp) && #NULL == 0) - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((check__tmp <= 1 && nomsg + 1 <= id3) && mode3 == 1) && mode2 == 1) && 0 <= check__tmp) && 0 <= id1) && p1_new + 1 <= 0) && p3_new == nomsg) && st3 + st2 + st1 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((((((((((check__tmp <= 1 && nomsg + 1 <= id3) && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 0 <= check__tmp) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && 0 <= mode3) && 256 * (mode1 / 256) == mode1) && p3_new == nomsg) && mode2 <= 1) && st3 + st2 + st1 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && nomsg + 1 <= id2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && !(r1 % 256 < 3)) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= __return_1465) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || ((((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 256 * (mode2 / 256) == mode2) && 256 * (mode1 / 256) == mode1) && check__tmp == 0) && st2 + st1 <= 2147483647) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && mode1 == 0) && !(2147483649 + st3 + st2 + st1 <= 0)) && !(2147483649 + st2 + st1 <= 0)) && st3 + st2 + st1 <= 2147483647)) || (((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= id1) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && 0 <= mode3) && check__tmp == 1) && p3_new == nomsg) && st3 + st2 + st1 == 0) && mode2 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && mode2 == 1) && !(255 == r1 % 256)) && 0 <= id1) && check__tmp == __return_1465) && p1_new + 1 <= 0) && p3_new == nomsg) && st3 + st2 + st1 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && assert__arg == __tmp_1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) && __return_1465 <= 1) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && nomsg == node1__m1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0 - InvariantResult [Line: 161]: Loop Invariant [2022-11-26 00:59:46,352 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,353 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-26 00:59:46,353 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-26 00:59:46,354 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,354 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-26 00:59:46,354 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,355 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,355 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-26 00:59:46,356 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,356 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-26 00:59:46,357 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-26 00:59:46,357 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,359 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,359 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-26 00:59:46,360 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-26 00:59:46,360 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,361 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-26 00:59:46,361 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,362 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,362 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-26 00:59:46,362 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,363 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-26 00:59:46,363 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-26 00:59:46,363 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset Derived loop invariant: (((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && mode2 == 1) && 0 <= id1) && p2 == 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && nomsg + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && init__tmp <= 1) && p3 == 0) && 0 <= __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || (((((((((((((((((((((((((((((((((((((((((256 * (mode2 / 256) == mode2 && check__tmp == __return_1465) && ((((((((check__tmp <= 1 && 0 <= id3) && 0 <= p3_new + 1) && st2 <= 1) && 0 <= id1) && p2 == 0) && p1_new + 1 <= 0) && !(assert__arg % 256 == 0)) || ((((((((((((((((((((((((((((((((48 == unknown-#length-unknown[2] && unknown-#length-unknown[3] == 12) && nomsg == p1_new) && p2 == 0) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && send3 == id3) && p3_new == nomsg) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && st3 == 0) && nomsg == p2_\old) && !(id3 == id2)) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && main__c1 == 0) && st1 == 0) && !(id1 == id2)) && nomsg == p1_\old) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && send1 == id1) && \valid[0] == 0) && \valid[2] == 1) && st2 == 0) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && nodes[2] == #funAddr~node3.offset) && unknown-#memory_int-unknown[1][1] == 0) && r1 % 256 == 0) && #funAddr~node2.offset == nodes[1]) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2))) && 0 <= mode3) && mode2 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= send2) && id1 <= 127) && st1 <= 1) && init__tmp == 1) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && assert__arg == __tmp_1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((nomsg + 1 <= id3 && mode3 == 1) && mode2 == 1) && nomsg + 1 <= send2) && 0 <= id1) && p2 == 0) && r1 / 256 * 256 + 2 < r1) && st3 + st2 + st1 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && mode1 == 1) && id1 <= 127) && nomsg + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && init__tmp <= 1) && p3 == 0) && 0 <= __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((nomsg + 1 <= id3 && 0 <= p3_new + 1) && mode2 == 1) && 0 <= id1) && r1 / 256 * 256 + 2 < r1) && 0 <= main__i2) && #NULL <= 0) && st3 + st2 + st1 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && main__i2 <= 0) && nomsg + 1 <= 0) && 0 <= __return_main) && id3 <= 127) && 0 <= id2) && 0 <= nomsg + 1) && nomsg == node3__m3) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= #NULL) && p3 == 0) && 0 <= __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && 1 <= init__tmp) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((((((((((((((check__tmp <= 1 && mode3 == 1) && 0 <= id3) && 0 <= p3_new + 1) && st2 <= 1) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && check__tmp == __return_1465) && p1_new + 1 <= 0) && mode2 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && st1 <= 1) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && nomsg + 1 <= 0) && assert__arg == __tmp_1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && nomsg == node3__m3) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || ((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && mode2 == 1) && 0 <= id1) && st3 + st2 + st1 <= 0) && 0 <= main__i2) && #NULL <= 0) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && main__i2 <= 0) && nomsg + 1 <= 0) && 0 <= __return_main) && id3 <= 127) && 0 <= id2) && 0 <= nomsg + 1) && nomsg == node3__m3) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= #NULL) && p3 == 0) && 0 <= __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && 1 <= init__tmp) && #NULL == 0) - InvariantResult [Line: 58]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 312]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= id1) && mode2 % 256 == 0) && r1 / 256 * 256 + 2 < r1) && send2 == node2____CPAchecker_TMP_0) && st3 + st2 + st1 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= node2__m2 + 1) && p3 == 0) && 0 <= __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && node2__m2 + 1 <= 0) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= id1) && mode2 % 256 == 0) && st3 + st2 + st1 <= 0) && send2 == node2____CPAchecker_TMP_0) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= node2__m2 + 1) && p3 == 0) && 0 <= __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && node2__m2 + 1 <= 0) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) - InvariantResult [Line: 114]: Loop Invariant [2022-11-26 00:59:46,370 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,371 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-26 00:59:46,371 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-26 00:59:46,372 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,372 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-26 00:59:46,372 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,373 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,373 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-26 00:59:46,373 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,373 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-26 00:59:46,374 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-26 00:59:46,374 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,374 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,375 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-26 00:59:46,375 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-26 00:59:46,375 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,376 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-26 00:59:46,376 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,377 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,377 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-26 00:59:46,378 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,378 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-26 00:59:46,378 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-26 00:59:46,379 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,379 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,380 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-26 00:59:46,380 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-26 00:59:46,381 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,381 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-26 00:59:46,381 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,382 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,382 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-26 00:59:46,383 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,383 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-26 00:59:46,384 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-26 00:59:46,384 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,387 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,387 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-26 00:59:46,388 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-26 00:59:46,388 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,388 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-26 00:59:46,389 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,389 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,389 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-26 00:59:46,390 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,390 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-26 00:59:46,390 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-26 00:59:46,390 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,391 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,391 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-26 00:59:46,392 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-26 00:59:46,392 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,392 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-26 00:59:46,393 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,393 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,394 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-26 00:59:46,394 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,394 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-26 00:59:46,395 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-26 00:59:46,395 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,395 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,396 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-26 00:59:46,396 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-26 00:59:46,397 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,397 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-26 00:59:46,398 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,398 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,398 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-26 00:59:46,399 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,399 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-26 00:59:46,400 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-26 00:59:46,400 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset Derived loop invariant: ((((((((((256 * (mode2 / 256) == mode2 && 256 * (mode1 / 256) == mode1) && st3 + st2 + st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && r1 <= r1 / 256 * 256) && (((((((((((((((((((((((((((((((((((((((((((((((48 == unknown-#length-unknown[2] && 0 <= id3) && unknown-#length-unknown[3] == 12) && nomsg == p1_new) && 0 <= id1) && p2 == 0) && __return_1465 == 0) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && send3 == id3) && p3_new == nomsg) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && st3 == 0) && init__tmp == __return_1389) && nomsg == p2_\old) && !(id3 == id2)) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && main__c1 == 0) && id1 <= 127) && nomsg == p2_new) && !(id1 == id2)) && nomsg == p1_\old) && init__tmp == 1) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && nomsg + 1 == 0) && send1 == id1) && \valid[0] == 0) && id3 <= 127) && \valid[2] == 1) && #NULL == 0) && st2 == 0) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && nodes[2] == #funAddr~node3.offset) && id2 <= 127) && p3 == 0) && unknown-#memory_int-unknown[1][1] == 0) && p1 == 0) && #funAddr~node2.offset == nodes[1]) && __return_main == 0) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((((check__tmp <= 1 && 0 <= id3) && 0 <= p3_new + 1) && 0 <= check__tmp) && 0 <= id1) && check__tmp == __return_1465) && p2 == 0) && p1_new + 1 <= 0) && 0 <= mode3) && mode2 <= 1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && mode3 <= 1) && 0 <= send2) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && mode1 <= 1) && assert__arg == __tmp_1) && p2_new + 1 <= 0) && id3 <= 127) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && __return_main == 0) && #NULL == 0) && main__i2 == 0))) || (((((((((((((((((((((((((((((((((((((((((((((((((check__tmp <= 1 && nomsg + 1 <= id3) && 0 <= p3_new + 1) && nomsg + 1 <= send2) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && check__tmp == __return_1465) && p1_new + 1 <= 0) && 0 <= mode3) && mode2 <= 1) && st3 + st2 + st1 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && id1 <= 127) && 0 <= p2_new + 1) && !(assert__arg % 256 == 0)) && nomsg + 1 <= 0) && assert__arg == __tmp_1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && !(r1 % 256 < 3)) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((((((((mode3 == 1 && ((((((check__tmp <= 1 && 0 <= id3) && 0 <= p3_new + 1) && 0 <= id1) && p1_new + 1 <= 0) && !(assert__arg % 256 == 0)) || ((((((((((((((((((((((((((((((((((48 == unknown-#length-unknown[2] && unknown-#length-unknown[3] == 12) && nomsg == p1_new) && mode3 % 256 == 0) && mode2 % 256 == 0) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && send3 == id3) && p3_new == nomsg) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && st3 == 0) && nomsg == p2_\old) && !(id3 == id2)) && mode1 % 256 == 0) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && main__c1 == 0) && st1 == 0) && !(id1 == id2)) && nomsg == p1_\old) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && send1 == id1) && \valid[0] == 0) && \valid[2] == 1) && st2 == 0) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && nodes[2] == #funAddr~node3.offset) && unknown-#memory_int-unknown[1][1] == 0) && r1 % 256 == 0) && #funAddr~node2.offset == nodes[1]) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2))) && mode2 == 1) && check__tmp == __return_1465) && st3 + st2 + st1 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 0 <= st2) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && assert__arg == __tmp_1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((((((((((((((((((check__tmp <= 1 && 0 <= id3) && 0 <= p3_new + 1) && 0 <= id1) && p1_new + 1 <= 0) && !(assert__arg % 256 == 0)) || ((((((((((((((((((((((((((((((((((48 == unknown-#length-unknown[2] && unknown-#length-unknown[3] == 12) && nomsg == p1_new) && mode3 % 256 == 0) && mode2 % 256 == 0) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && send3 == id3) && p3_new == nomsg) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && st3 == 0) && nomsg == p2_\old) && !(id3 == id2)) && mode1 % 256 == 0) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && main__c1 == 0) && st1 == 0) && !(id1 == id2)) && nomsg == p1_\old) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && send1 == id1) && \valid[0] == 0) && \valid[2] == 1) && st2 == 0) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && nodes[2] == #funAddr~node3.offset) && unknown-#memory_int-unknown[1][1] == 0) && r1 % 256 == 0) && #funAddr~node2.offset == nodes[1]) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2)) && 256 * (mode2 / 256) == mode2) && check__tmp == __return_1465) && 0 <= mode3) && st3 + st2 + st1 == 0) && mode2 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && assert__arg == __tmp_1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) - InvariantResult [Line: 362]: Loop Invariant [2022-11-26 00:59:46,403 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,404 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-26 00:59:46,404 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-26 00:59:46,405 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,405 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-26 00:59:46,405 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,406 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,406 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-26 00:59:46,407 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,407 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-26 00:59:46,407 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-26 00:59:46,408 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,408 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,409 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-26 00:59:46,409 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-26 00:59:46,409 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,410 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-26 00:59:46,410 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,411 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,411 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-26 00:59:46,411 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,412 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-26 00:59:46,412 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-26 00:59:46,412 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,413 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,413 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-26 00:59:46,414 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-26 00:59:46,414 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,414 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-26 00:59:46,415 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,415 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,415 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-26 00:59:46,416 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,416 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-26 00:59:46,416 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-26 00:59:46,416 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,419 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,420 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-26 00:59:46,420 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-26 00:59:46,421 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,421 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-26 00:59:46,421 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,422 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,422 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-26 00:59:46,423 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,423 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-26 00:59:46,424 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-26 00:59:46,424 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,424 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,425 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-26 00:59:46,425 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-26 00:59:46,426 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,426 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-26 00:59:46,427 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,427 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,427 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-26 00:59:46,428 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,428 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-26 00:59:46,429 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-26 00:59:46,429 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,430 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,430 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.base [2022-11-26 00:59:46,430 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.base [2022-11-26 00:59:46,431 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,431 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.base [2022-11-26 00:59:46,431 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.base [2022-11-26 00:59:46,432 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,432 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node1.offset [2022-11-26 00:59:46,432 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset [2022-11-26 00:59:46,433 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node3.offset [2022-11-26 00:59:46,433 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression #funAddr~node2.offset [2022-11-26 00:59:46,433 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var ~nodes~0 : [int]$Pointer$; and expression ~nodes~0.offset Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((nomsg + 1 <= send2 && ((((((((((((((((((check__tmp <= 1 && 0 <= id3) && 0 <= p3_new + 1) && st2 <= 1) && 0 <= id1) && check__tmp == __return_1465) && p1_new + 1 <= 0) && 0 <= mode3) && mode2 <= 1) && mode3 <= 1) && st1 <= 1) && !(assert__arg % 256 == 0)) && mode1 <= 1) && assert__arg == __tmp_1) && st3 <= 1) && 0 <= mode2) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) || ((((((((((((((((((((((((((((((((((48 == unknown-#length-unknown[2] && unknown-#length-unknown[3] == 12) && nomsg == p1_new) && mode3 % 256 == 0) && mode2 % 256 == 0) && __return_1465 == 0) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && send3 == id3) && p3_new == nomsg) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && st3 == 0) && nomsg == p2_\old) && !(id3 == id2)) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && main__c1 == 0) && st1 == 0) && !(id1 == id2)) && nomsg == p1_\old) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && send1 == id1) && \valid[0] == 0) && \valid[2] == 1) && st2 == 0) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && nodes[2] == #funAddr~node3.offset) && unknown-#memory_int-unknown[1][1] == 0) && r1 % 256 == 0) && #funAddr~node2.offset == nodes[1]) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2))) && 256 * (mode2 / 256) == mode2) && r1 / 256 * 256 + 2 < r1) && st3 + st2 + st1 <= 1) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && 0 <= p2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && mode1 == 0) && 0 <= __return_main) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && nomsg == node1__m1) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((check__tmp <= 1 && 0 <= id3) && 0 <= p3_new + 1) && st2 <= 1) && 0 <= id1) && check__tmp == __return_1465) && p1_new + 1 <= 0) && 0 <= mode3) && mode2 <= 1) && mode3 <= 1) && st1 <= 1) && !(assert__arg % 256 == 0)) && mode1 <= 1) && assert__arg == __tmp_1) && st3 <= 1) && 0 <= mode2) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) || ((((((((((((((((((((((((((((((((((48 == unknown-#length-unknown[2] && unknown-#length-unknown[3] == 12) && nomsg == p1_new) && mode3 % 256 == 0) && mode2 % 256 == 0) && __return_1465 == 0) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && send3 == id3) && p3_new == nomsg) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && st3 == 0) && nomsg == p2_\old) && !(id3 == id2)) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && main__c1 == 0) && st1 == 0) && !(id1 == id2)) && nomsg == p1_\old) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && send1 == id1) && \valid[0] == 0) && \valid[2] == 1) && st2 == 0) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && nodes[2] == #funAddr~node3.offset) && unknown-#memory_int-unknown[1][1] == 0) && r1 % 256 == 0) && #funAddr~node2.offset == nodes[1]) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2)) && 256 * (mode2 / 256) == mode2) && st3 + st2 + st1 <= 0) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && mode1 == 0) && 0 <= __return_main) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && 0 <= main__c1) && nomsg == node1__m1) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || ((((((((((((((((((((((((((((((((((((((((0 <= id1 && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && st3 + st2 + st1 <= 0) && mode1 % 256 == 0) && 0 <= st1) && __return_1389 <= 1) && 1 <= __return_1389) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && r1 <= r1 / 256 * 256) && 0 <= __return_main) && ((((((((((((0 <= id3 && 0 <= p3_new + 1) && check__tmp == __return_1465) && 0 <= mode3) && check__tmp == 1) && mode2 <= 1) && mode3 <= 1) && mode1 <= 1) && assert__arg == __tmp_1) && 0 <= mode2) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && main__c1 == __return_1465) || (((((((((((((((((((((((((((48 == unknown-#length-unknown[2] && unknown-#length-unknown[3] == 12) && __return_1465 == 0) && nodes[0] == #funAddr~node1.base) && 2 == unknown-#length-unknown[1]) && send3 == id3) && p3_new == nomsg) && #funAddr~node3.base == nodes[2]) && \valid[3] == 1) && nomsg == p2_\old) && !(id3 == id2)) && #funAddr~node2.base == nodes[1]) && !(id1 == id3)) && main__c1 == 0) && !(id1 == id2)) && nomsg == p1_\old) && nodes[0] == #funAddr~node1.offset) && \valid[1] == 1) && send1 == id1) && \valid[0] == 0) && \valid[2] == 1) && p3_\old == nomsg) && unknown-#memory_int-unknown[1][0] == 48) && nodes[2] == #funAddr~node3.offset) && unknown-#memory_int-unknown[1][1] == 0) && #funAddr~node2.offset == nodes[1]) && 0 < unknown-#StackHeapBarrier-unknown) && send2 == id2))) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && 0 <= node1____CPAchecker_TMP_0) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && nomsg == node1__m1) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) RESULT: Ultimate proved your program to be correct! [2022-11-26 00:59:46,454 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f729f8c-12fe-4bdc-a21a-56eab1304aaa/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