./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/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_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/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_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/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 66e52001defd7e771c0df8c73cdf4ec6b3d90072c8faf9f52fce6d45ff1a83e7 --- 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-25 23:46:08,201 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:46:08,204 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:46:08,247 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:46:08,247 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:46:08,249 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:46:08,250 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:46:08,252 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:46:08,257 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:46:08,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:46:08,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:46:08,268 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:46:08,268 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:46:08,271 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:46:08,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:46:08,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:46:08,279 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:46:08,280 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:46:08,282 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:46:08,289 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:46:08,291 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:46:08,293 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:46:08,295 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:46:08,297 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:46:08,308 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:46:08,309 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:46:08,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:46:08,311 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:46:08,312 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:46:08,313 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:46:08,313 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:46:08,315 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:46:08,317 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:46:08,318 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:46:08,320 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:46:08,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:46:08,321 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:46:08,322 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:46:08,322 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:46:08,324 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:46:08,325 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:46:08,326 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-25 23:46:08,353 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:46:08,353 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:46:08,353 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:46:08,354 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:46:08,354 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:46:08,354 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:46:08,355 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:46:08,355 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:46:08,355 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:46:08,355 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:46:08,356 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:46:08,356 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:46:08,356 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:46:08,356 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:46:08,356 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:46:08,357 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:46:08,357 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:46:08,357 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:46:08,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:46:08,358 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:46:08,358 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:46:08,358 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:46:08,359 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:46:08,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:46:08,359 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:46:08,359 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:46:08,359 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:46:08,360 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 23:46:08,360 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:46:08,360 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:46:08,360 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:46:08,360 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:46:08,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:46:08,361 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:46:08,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:46:08,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:46:08,362 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:46:08,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:46:08,362 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:46:08,362 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:46:08,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:46:08,363 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:46:08,363 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:46:08,363 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_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/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_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/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 -> 66e52001defd7e771c0df8c73cdf4ec6b3d90072c8faf9f52fce6d45ff1a83e7 [2022-11-25 23:46:08,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:46:08,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:46:08,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:46:08,717 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:46:08,718 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:46:08,719 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2022-11-25 23:46:12,003 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:46:12,226 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:46:12,227 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2022-11-25 23:46:12,235 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/data/363e40759/2e5af8f22c9345d29618842da77d62cf/FLAGedbf60a37 [2022-11-25 23:46:12,249 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/data/363e40759/2e5af8f22c9345d29618842da77d62cf [2022-11-25 23:46:12,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:46:12,255 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:46:12,256 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:46:12,257 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:46:12,260 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:46:12,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:46:12" (1/1) ... [2022-11-25 23:46:12,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19ce0cd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:12, skipping insertion in model container [2022-11-25 23:46:12,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:46:12" (1/1) ... [2022-11-25 23:46:12,270 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:46:12,296 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:46:12,487 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_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c[6080,6093] [2022-11-25 23:46:12,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:46:12,500 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:46:12,538 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_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.UNBOUNDED.pals.c[6080,6093] [2022-11-25 23:46:12,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:46:12,553 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:46:12,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:12 WrapperNode [2022-11-25 23:46:12,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:46:12,554 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:46:12,554 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:46:12,555 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:46:12,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:12" (1/1) ... [2022-11-25 23:46:12,569 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:12" (1/1) ... [2022-11-25 23:46:12,596 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 222 [2022-11-25 23:46:12,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:46:12,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:46:12,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:46:12,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:46:12,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:12" (1/1) ... [2022-11-25 23:46:12,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:12" (1/1) ... [2022-11-25 23:46:12,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:12" (1/1) ... [2022-11-25 23:46:12,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:12" (1/1) ... [2022-11-25 23:46:12,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:12" (1/1) ... [2022-11-25 23:46:12,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:12" (1/1) ... [2022-11-25 23:46:12,640 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:12" (1/1) ... [2022-11-25 23:46:12,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:12" (1/1) ... [2022-11-25 23:46:12,644 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:46:12,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:46:12,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:46:12,645 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:46:12,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:12" (1/1) ... [2022-11-25 23:46:12,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:46:12,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:12,678 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:46:12,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:46:12,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:46:12,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:46:12,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:46:12,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:46:12,932 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:46:12,934 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:46:13,284 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:46:13,566 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:46:13,566 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 23:46:13,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:46:13 BoogieIcfgContainer [2022-11-25 23:46:13,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:46:13,571 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:46:13,571 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:46:13,574 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:46:13,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:46:12" (1/3) ... [2022-11-25 23:46:13,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@671d66de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:46:13, skipping insertion in model container [2022-11-25 23:46:13,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:46:12" (2/3) ... [2022-11-25 23:46:13,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@671d66de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:46:13, skipping insertion in model container [2022-11-25 23:46:13,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:46:13" (3/3) ... [2022-11-25 23:46:13,577 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c [2022-11-25 23:46:13,604 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:46:13,604 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-11-25 23:46:13,646 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:46:13,653 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;@78663d89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:46:13,653 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-25 23:46:13,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:13,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 23:46:13,671 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:13,672 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 23:46:13,673 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-25 23:46:13,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:13,678 INFO L85 PathProgramCache]: Analyzing trace with hash 11472576, now seen corresponding path program 1 times [2022-11-25 23:46:13,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:13,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865829845] [2022-11-25 23:46:13,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:13,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:13,938 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-25 23:46:13,939 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:13,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865829845] [2022-11-25 23:46:13,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865829845] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:46:13,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:46:13,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:46:13,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546185965] [2022-11-25 23:46:13,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:46:13,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 23:46:13,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:14,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 23:46:14,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 23:46:14,010 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:14,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:14,060 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2022-11-25 23:46:14,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 23:46:14,065 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-25 23:46:14,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:14,074 INFO L225 Difference]: With dead ends: 38 [2022-11-25 23:46:14,074 INFO L226 Difference]: Without dead ends: 35 [2022-11-25 23:46:14,077 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-25 23:46:14,083 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:14,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:46:14,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-25 23:46:14,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-11-25 23:46:14,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 34 states have internal predecessors, (40), 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-25 23:46:14,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-11-25 23:46:14,126 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 4 [2022-11-25 23:46:14,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:14,128 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-11-25 23:46:14,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:14,130 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-11-25 23:46:14,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 23:46:14,131 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:14,131 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 23:46:14,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:46:14,132 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-25 23:46:14,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:14,134 INFO L85 PathProgramCache]: Analyzing trace with hash 355501231, now seen corresponding path program 1 times [2022-11-25 23:46:14,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:14,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609776792] [2022-11-25 23:46:14,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:14,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:14,557 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-25 23:46:14,557 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:14,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609776792] [2022-11-25 23:46:14,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609776792] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:46:14,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:46:14,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:46:14,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162614481] [2022-11-25 23:46:14,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:46:14,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:46:14,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:14,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:46:14,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:46:14,561 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:14,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:14,705 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-11-25 23:46:14,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:46:14,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 23:46:14,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:14,707 INFO L225 Difference]: With dead ends: 69 [2022-11-25 23:46:14,707 INFO L226 Difference]: Without dead ends: 66 [2022-11-25 23:46:14,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:46:14,709 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 32 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:14,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 24 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:46:14,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-25 23:46:14,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2022-11-25 23:46:14,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.7209302325581395) internal successors, (74), 54 states have internal predecessors, (74), 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-25 23:46:14,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. [2022-11-25 23:46:14,718 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 74 transitions. Word has length 5 [2022-11-25 23:46:14,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:14,718 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 74 transitions. [2022-11-25 23:46:14,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:14,719 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 74 transitions. [2022-11-25 23:46:14,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 23:46:14,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:14,720 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 23:46:14,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:46:14,720 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-25 23:46:14,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:14,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1864363488, now seen corresponding path program 1 times [2022-11-25 23:46:14,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:14,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141163767] [2022-11-25 23:46:14,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:14,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:14,927 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-25 23:46:14,928 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:14,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141163767] [2022-11-25 23:46:14,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141163767] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:46:14,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:46:14,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:46:14,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046130314] [2022-11-25 23:46:14,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:46:14,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:46:14,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:14,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:46:14,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:46:14,932 INFO L87 Difference]: Start difference. First operand 55 states and 74 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:15,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:15,046 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-11-25 23:46:15,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:46:15,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-25 23:46:15,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:15,048 INFO L225 Difference]: With dead ends: 66 [2022-11-25 23:46:15,048 INFO L226 Difference]: Without dead ends: 63 [2022-11-25 23:46:15,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:46:15,050 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:15,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 27 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:46:15,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-25 23:46:15,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2022-11-25 23:46:15,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 54 states have internal predecessors, (71), 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-25 23:46:15,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions. [2022-11-25 23:46:15,059 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 71 transitions. Word has length 6 [2022-11-25 23:46:15,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:15,059 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 71 transitions. [2022-11-25 23:46:15,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:15,060 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2022-11-25 23:46:15,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 23:46:15,060 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:15,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:15,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:46:15,061 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-25 23:46:15,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:15,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1960693039, now seen corresponding path program 1 times [2022-11-25 23:46:15,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:15,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067669389] [2022-11-25 23:46:15,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:15,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:15,382 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-25 23:46:15,382 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:15,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067669389] [2022-11-25 23:46:15,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067669389] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:46:15,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:46:15,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:46:15,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839570685] [2022-11-25 23:46:15,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:46:15,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:46:15,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:15,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:46:15,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:46:15,385 INFO L87 Difference]: Start difference. First operand 55 states and 71 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:15,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:15,559 INFO L93 Difference]: Finished difference Result 96 states and 125 transitions. [2022-11-25 23:46:15,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:46:15,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 23:46:15,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:15,566 INFO L225 Difference]: With dead ends: 96 [2022-11-25 23:46:15,566 INFO L226 Difference]: Without dead ends: 93 [2022-11-25 23:46:15,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:46:15,576 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 30 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:15,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 26 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:46:15,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-25 23:46:15,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2022-11-25 23:46:15,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 63 states have (on average 1.5714285714285714) internal successors, (99), 74 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:15,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 99 transitions. [2022-11-25 23:46:15,597 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 99 transitions. Word has length 7 [2022-11-25 23:46:15,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:15,597 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 99 transitions. [2022-11-25 23:46:15,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:15,598 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 99 transitions. [2022-11-25 23:46:15,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 23:46:15,599 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:15,600 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:15,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:46:15,601 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-25 23:46:15,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:15,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1817491085, now seen corresponding path program 1 times [2022-11-25 23:46:15,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:15,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681855580] [2022-11-25 23:46:15,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:15,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:15,862 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-25 23:46:15,862 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:15,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681855580] [2022-11-25 23:46:15,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681855580] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:46:15,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:46:15,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:46:15,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331475622] [2022-11-25 23:46:15,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:46:15,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:46:15,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:15,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:46:15,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:46:15,867 INFO L87 Difference]: Start difference. First operand 75 states and 99 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:16,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:16,056 INFO L93 Difference]: Finished difference Result 116 states and 148 transitions. [2022-11-25 23:46:16,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:46:16,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 23:46:16,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:16,059 INFO L225 Difference]: With dead ends: 116 [2022-11-25 23:46:16,059 INFO L226 Difference]: Without dead ends: 113 [2022-11-25 23:46:16,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:46:16,060 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 36 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:16,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 27 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:46:16,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-25 23:46:16,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 101. [2022-11-25 23:46:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 89 states have (on average 1.5842696629213484) internal successors, (141), 100 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 141 transitions. [2022-11-25 23:46:16,077 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 141 transitions. Word has length 7 [2022-11-25 23:46:16,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:16,077 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 141 transitions. [2022-11-25 23:46:16,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:16,077 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 141 transitions. [2022-11-25 23:46:16,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 23:46:16,078 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:16,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:16,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 23:46:16,078 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-25 23:46:16,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:16,079 INFO L85 PathProgramCache]: Analyzing trace with hash -651941822, now seen corresponding path program 1 times [2022-11-25 23:46:16,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:16,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627200491] [2022-11-25 23:46:16,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:16,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:16,273 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-25 23:46:16,273 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:16,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627200491] [2022-11-25 23:46:16,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627200491] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:46:16,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:46:16,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:46:16,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007874398] [2022-11-25 23:46:16,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:46:16,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:46:16,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:16,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:46:16,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:46:16,275 INFO L87 Difference]: Start difference. First operand 101 states and 141 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:16,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:16,379 INFO L93 Difference]: Finished difference Result 116 states and 158 transitions. [2022-11-25 23:46:16,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:46:16,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-25 23:46:16,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:16,381 INFO L225 Difference]: With dead ends: 116 [2022-11-25 23:46:16,381 INFO L226 Difference]: Without dead ends: 113 [2022-11-25 23:46:16,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:46:16,382 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 32 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:16,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 17 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:46:16,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-25 23:46:16,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2022-11-25 23:46:16,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 89 states have (on average 1.5056179775280898) internal successors, (134), 98 states have internal predecessors, (134), 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-25 23:46:16,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 134 transitions. [2022-11-25 23:46:16,394 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 134 transitions. Word has length 8 [2022-11-25 23:46:16,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:16,395 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 134 transitions. [2022-11-25 23:46:16,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:16,395 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 134 transitions. [2022-11-25 23:46:16,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 23:46:16,395 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:16,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:16,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 23:46:16,396 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-25 23:46:16,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:16,397 INFO L85 PathProgramCache]: Analyzing trace with hash -507648548, now seen corresponding path program 1 times [2022-11-25 23:46:16,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:16,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151136215] [2022-11-25 23:46:16,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:16,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:16,555 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-25 23:46:16,555 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:16,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151136215] [2022-11-25 23:46:16,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151136215] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:46:16,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:46:16,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:46:16,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643446608] [2022-11-25 23:46:16,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:46:16,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:46:16,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:16,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:46:16,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:46:16,557 INFO L87 Difference]: Start difference. First operand 99 states and 134 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:16,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:16,685 INFO L93 Difference]: Finished difference Result 109 states and 137 transitions. [2022-11-25 23:46:16,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:46:16,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-25 23:46:16,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:16,686 INFO L225 Difference]: With dead ends: 109 [2022-11-25 23:46:16,686 INFO L226 Difference]: Without dead ends: 106 [2022-11-25 23:46:16,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:46:16,687 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 59 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:16,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 23 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:46:16,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-25 23:46:16,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 75. [2022-11-25 23:46:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.476923076923077) internal successors, (96), 74 states have internal predecessors, (96), 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-25 23:46:16,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2022-11-25 23:46:16,696 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 8 [2022-11-25 23:46:16,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:16,697 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2022-11-25 23:46:16,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:16,697 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2022-11-25 23:46:16,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 23:46:16,698 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:16,698 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:16,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 23:46:16,698 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-25 23:46:16,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:16,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1442764437, now seen corresponding path program 1 times [2022-11-25 23:46:16,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:16,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938971691] [2022-11-25 23:46:16,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:16,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:16,923 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-25 23:46:16,923 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:16,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938971691] [2022-11-25 23:46:16,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938971691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:46:16,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:46:16,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:46:16,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189972666] [2022-11-25 23:46:16,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:46:16,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:46:16,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:16,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:46:16,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:46:16,925 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-25 23:46:17,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:17,079 INFO L93 Difference]: Finished difference Result 108 states and 134 transitions. [2022-11-25 23:46:17,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:46:17,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2022-11-25 23:46:17,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:17,084 INFO L225 Difference]: With dead ends: 108 [2022-11-25 23:46:17,085 INFO L226 Difference]: Without dead ends: 105 [2022-11-25 23:46:17,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:46:17,087 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:17,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 31 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:46:17,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-25 23:46:17,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 80. [2022-11-25 23:46:17,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.457142857142857) internal successors, (102), 79 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:17,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 102 transitions. [2022-11-25 23:46:17,111 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 102 transitions. Word has length 9 [2022-11-25 23:46:17,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:17,111 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 102 transitions. [2022-11-25 23:46:17,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-25 23:46:17,112 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-11-25 23:46:17,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 23:46:17,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:17,113 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:17,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 23:46:17,113 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-25 23:46:17,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:17,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1776024830, now seen corresponding path program 1 times [2022-11-25 23:46:17,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:17,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715756429] [2022-11-25 23:46:17,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:17,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:17,395 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-25 23:46:17,395 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:17,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715756429] [2022-11-25 23:46:17,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715756429] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:46:17,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:46:17,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:46:17,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903801694] [2022-11-25 23:46:17,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:46:17,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:46:17,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:17,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:46:17,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:46:17,399 INFO L87 Difference]: Start difference. First operand 80 states and 102 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-25 23:46:17,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:17,494 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2022-11-25 23:46:17,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:46:17,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2022-11-25 23:46:17,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:17,496 INFO L225 Difference]: With dead ends: 91 [2022-11-25 23:46:17,496 INFO L226 Difference]: Without dead ends: 90 [2022-11-25 23:46:17,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:46:17,500 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 30 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:17,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 17 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:46:17,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-25 23:46:17,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2022-11-25 23:46:17,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.476923076923077) internal successors, (96), 74 states have internal predecessors, (96), 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-25 23:46:17,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 96 transitions. [2022-11-25 23:46:17,513 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 96 transitions. Word has length 10 [2022-11-25 23:46:17,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:17,513 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 96 transitions. [2022-11-25 23:46:17,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-25 23:46:17,514 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 96 transitions. [2022-11-25 23:46:17,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 23:46:17,515 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:17,515 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:17,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 23:46:17,516 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-25 23:46:17,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:17,516 INFO L85 PathProgramCache]: Analyzing trace with hash -405485141, now seen corresponding path program 1 times [2022-11-25 23:46:17,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:17,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349118275] [2022-11-25 23:46:17,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:17,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:17,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:46:17,611 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:17,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349118275] [2022-11-25 23:46:17,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349118275] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:46:17,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:46:17,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:46:17,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406948657] [2022-11-25 23:46:17,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:46:17,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:46:17,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:17,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:46:17,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:46:17,614 INFO L87 Difference]: Start difference. First operand 75 states and 96 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:17,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:17,650 INFO L93 Difference]: Finished difference Result 191 states and 243 transitions. [2022-11-25 23:46:17,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:46:17,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 23:46:17,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:17,652 INFO L225 Difference]: With dead ends: 191 [2022-11-25 23:46:17,652 INFO L226 Difference]: Without dead ends: 131 [2022-11-25 23:46:17,652 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-25 23:46:17,653 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 27 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 75 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-25 23:46:17,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 75 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:46:17,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-25 23:46:17,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 113. [2022-11-25 23:46:17,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 103 states have (on average 1.4951456310679612) internal successors, (154), 112 states have internal predecessors, (154), 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-25 23:46:17,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 154 transitions. [2022-11-25 23:46:17,664 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 154 transitions. Word has length 16 [2022-11-25 23:46:17,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:17,664 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 154 transitions. [2022-11-25 23:46:17,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:17,665 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 154 transitions. [2022-11-25 23:46:17,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 23:46:17,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:17,665 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:17,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 23:46:17,666 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-25 23:46:17,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:17,666 INFO L85 PathProgramCache]: Analyzing trace with hash -262283187, now seen corresponding path program 1 times [2022-11-25 23:46:17,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:17,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838178493] [2022-11-25 23:46:17,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:17,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:18,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:46:18,106 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:18,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838178493] [2022-11-25 23:46:18,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838178493] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:18,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271894220] [2022-11-25 23:46:18,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:18,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:18,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:18,114 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:18,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:46:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:18,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 23:46:18,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:19,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:46:19,721 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:46:19,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271894220] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:46:19,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:46:19,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2022-11-25 23:46:19,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047460201] [2022-11-25 23:46:19,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:46:19,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:46:19,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:19,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:46:19,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2022-11-25 23:46:19,725 INFO L87 Difference]: Start difference. First operand 113 states and 154 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:19,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:19,865 INFO L93 Difference]: Finished difference Result 185 states and 253 transitions. [2022-11-25 23:46:19,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:46:19,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 23:46:19,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:19,867 INFO L225 Difference]: With dead ends: 185 [2022-11-25 23:46:19,867 INFO L226 Difference]: Without dead ends: 85 [2022-11-25 23:46:19,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2022-11-25 23:46:19,869 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:19,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 37 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:46:19,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-25 23:46:19,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2022-11-25 23:46:19,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.5441176470588236) internal successors, (105), 77 states have internal predecessors, (105), 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-25 23:46:19,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 105 transitions. [2022-11-25 23:46:19,877 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 105 transitions. Word has length 16 [2022-11-25 23:46:19,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:19,878 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 105 transitions. [2022-11-25 23:46:19,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:19,878 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 105 transitions. [2022-11-25 23:46:19,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 23:46:19,880 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:19,880 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:19,892 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:46:20,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-25 23:46:20,087 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-25 23:46:20,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:20,088 INFO L85 PathProgramCache]: Analyzing trace with hash -621849275, now seen corresponding path program 1 times [2022-11-25 23:46:20,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:20,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909165670] [2022-11-25 23:46:20,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:20,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:20,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:46:20,135 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:20,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909165670] [2022-11-25 23:46:20,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909165670] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:46:20,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:46:20,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:46:20,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663035620] [2022-11-25 23:46:20,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:46:20,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:46:20,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:20,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:46:20,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:46:20,137 INFO L87 Difference]: Start difference. First operand 78 states and 105 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:20,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:20,179 INFO L93 Difference]: Finished difference Result 156 states and 212 transitions. [2022-11-25 23:46:20,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:46:20,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 23:46:20,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:20,181 INFO L225 Difference]: With dead ends: 156 [2022-11-25 23:46:20,181 INFO L226 Difference]: Without dead ends: 96 [2022-11-25 23:46:20,182 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-25 23:46:20,183 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 22 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 65 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.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:20,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 65 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:46:20,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-25 23:46:20,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 89. [2022-11-25 23:46:20,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 79 states have (on average 1.518987341772152) internal successors, (120), 88 states have internal predecessors, (120), 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-25 23:46:20,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2022-11-25 23:46:20,192 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 18 [2022-11-25 23:46:20,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:20,193 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2022-11-25 23:46:20,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:20,193 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2022-11-25 23:46:20,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 23:46:20,195 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:20,195 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:20,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 23:46:20,196 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-25 23:46:20,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:20,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1881005135, now seen corresponding path program 1 times [2022-11-25 23:46:20,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:20,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809697031] [2022-11-25 23:46:20,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:20,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:20,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 23:46:20,618 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:20,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809697031] [2022-11-25 23:46:20,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809697031] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:20,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917414503] [2022-11-25 23:46:20,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:20,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:20,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:20,623 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:20,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:46:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:20,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 23:46:20,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:21,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:46:21,079 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:46:21,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917414503] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:46:21,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:46:21,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2022-11-25 23:46:21,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850587773] [2022-11-25 23:46:21,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:46:21,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:46:21,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:21,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:46:21,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:46:21,081 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:21,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:21,127 INFO L93 Difference]: Finished difference Result 164 states and 224 transitions. [2022-11-25 23:46:21,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:46:21,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-25 23:46:21,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:21,129 INFO L225 Difference]: With dead ends: 164 [2022-11-25 23:46:21,129 INFO L226 Difference]: Without dead ends: 91 [2022-11-25 23:46:21,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:46:21,132 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 9 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 58 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-25 23:46:21,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 58 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:46:21,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-25 23:46:21,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2022-11-25 23:46:21,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.513157894736842) internal successors, (115), 85 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:21,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 115 transitions. [2022-11-25 23:46:21,160 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 115 transitions. Word has length 22 [2022-11-25 23:46:21,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:21,160 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 115 transitions. [2022-11-25 23:46:21,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:21,160 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 115 transitions. [2022-11-25 23:46:21,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 23:46:21,161 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:21,161 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:21,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:46:21,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:21,362 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-25 23:46:21,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:21,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1005393701, now seen corresponding path program 1 times [2022-11-25 23:46:21,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:21,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913325350] [2022-11-25 23:46:21,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:21,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:21,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:46:21,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:21,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913325350] [2022-11-25 23:46:21,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913325350] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:21,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673916289] [2022-11-25 23:46:21,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:21,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:21,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:21,828 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:21,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:46:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:21,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-25 23:46:21,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:23,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:46:23,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:25,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:46:25,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673916289] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:46:25,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [349629689] [2022-11-25 23:46:25,645 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-25 23:46:25,645 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:46:25,649 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:46:25,656 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:46:25,656 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:46:34,580 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:46:39,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [349629689] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:46:39,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:46:39,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 7, 8] total 29 [2022-11-25 23:46:39,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273194141] [2022-11-25 23:46:39,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:46:39,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 23:46:39,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:39,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 23:46:39,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=619, Unknown=0, NotChecked=0, Total=930 [2022-11-25 23:46:39,661 INFO L87 Difference]: Start difference. First operand 86 states and 115 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 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-25 23:46:42,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:42,539 INFO L93 Difference]: Finished difference Result 206 states and 293 transitions. [2022-11-25 23:46:42,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 23:46:42,541 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 23:46:42,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:42,542 INFO L225 Difference]: With dead ends: 206 [2022-11-25 23:46:42,542 INFO L226 Difference]: Without dead ends: 136 [2022-11-25 23:46:42,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=402, Invalid=788, Unknown=0, NotChecked=0, Total=1190 [2022-11-25 23:46:42,544 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 19 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:42,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 38 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 23:46:42,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-25 23:46:42,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 125. [2022-11-25 23:46:42,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 115 states have (on average 1.4) internal successors, (161), 124 states have internal predecessors, (161), 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-25 23:46:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 161 transitions. [2022-11-25 23:46:42,570 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 161 transitions. Word has length 23 [2022-11-25 23:46:42,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:42,570 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 161 transitions. [2022-11-25 23:46:42,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 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-25 23:46:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 161 transitions. [2022-11-25 23:46:42,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 23:46:42,571 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:42,572 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:42,579 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 23:46:42,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-25 23:46:42,779 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-25 23:46:42,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:42,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1550018723, now seen corresponding path program 1 times [2022-11-25 23:46:42,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:42,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427203672] [2022-11-25 23:46:42,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:42,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:43,006 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:46:43,006 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:43,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427203672] [2022-11-25 23:46:43,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427203672] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:43,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660851486] [2022-11-25 23:46:43,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:43,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:43,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:43,009 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:43,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 23:46:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:43,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 23:46:43,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:43,162 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 23:46:43,162 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:46:43,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660851486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:46:43,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:46:43,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-25 23:46:43,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489837742] [2022-11-25 23:46:43,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:46:43,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:46:43,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:46:43,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:46:43,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:46:43,165 INFO L87 Difference]: Start difference. First operand 125 states and 161 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:43,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:46:43,238 INFO L93 Difference]: Finished difference Result 246 states and 308 transitions. [2022-11-25 23:46:43,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:46:43,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-25 23:46:43,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:46:43,240 INFO L225 Difference]: With dead ends: 246 [2022-11-25 23:46:43,240 INFO L226 Difference]: Without dead ends: 135 [2022-11-25 23:46:43,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:46:43,243 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 26 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:46:43,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 130 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:46:43,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-25 23:46:43,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2022-11-25 23:46:43,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 115 states have (on average 1.3391304347826087) internal successors, (154), 124 states have internal predecessors, (154), 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-25 23:46:43,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 154 transitions. [2022-11-25 23:46:43,268 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 154 transitions. Word has length 32 [2022-11-25 23:46:43,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:46:43,269 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 154 transitions. [2022-11-25 23:46:43,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:43,269 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 154 transitions. [2022-11-25 23:46:43,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-25 23:46:43,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:46:43,275 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:46:43,286 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 23:46:43,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 23:46:43,481 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-25 23:46:43,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:46:43,482 INFO L85 PathProgramCache]: Analyzing trace with hash -130196257, now seen corresponding path program 1 times [2022-11-25 23:46:43,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:46:43,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838146191] [2022-11-25 23:46:43,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:43,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:46:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:43,690 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:46:43,691 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:46:43,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838146191] [2022-11-25 23:46:43,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838146191] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:46:43,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91926254] [2022-11-25 23:46:43,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:46:43,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:46:43,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:46:43,693 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:46:43,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 23:46:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:46:43,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-25 23:46:43,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:46:45,137 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:46:45,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:46:46,191 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:46:46,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91926254] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:46:46,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [943567966] [2022-11-25 23:46:46,194 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-25 23:46:46,194 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:46:46,195 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:46:46,195 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:46:46,195 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:46:54,045 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:47:01,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [943567966] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:47:01,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:47:01,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5, 9, 9] total 34 [2022-11-25 23:47:01,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296007862] [2022-11-25 23:47:01,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:47:01,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 23:47:01,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:47:01,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 23:47:01,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=930, Unknown=0, NotChecked=0, Total=1190 [2022-11-25 23:47:01,907 INFO L87 Difference]: Start difference. First operand 125 states and 154 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:47:12,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:47:12,234 INFO L93 Difference]: Finished difference Result 259 states and 342 transitions. [2022-11-25 23:47:12,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-25 23:47:12,239 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-25 23:47:12,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:47:12,240 INFO L225 Difference]: With dead ends: 259 [2022-11-25 23:47:12,241 INFO L226 Difference]: Without dead ends: 189 [2022-11-25 23:47:12,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 75 SyntacticMatches, 9 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=618, Invalid=1832, Unknown=0, NotChecked=0, Total=2450 [2022-11-25 23:47:12,243 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 72 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:47:12,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 35 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-25 23:47:12,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-11-25 23:47:12,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 173. [2022-11-25 23:47:12,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 163 states have (on average 1.294478527607362) internal successors, (211), 172 states have internal predecessors, (211), 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-25 23:47:12,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 211 transitions. [2022-11-25 23:47:12,280 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 211 transitions. Word has length 38 [2022-11-25 23:47:12,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:47:12,280 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 211 transitions. [2022-11-25 23:47:12,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:47:12,281 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 211 transitions. [2022-11-25 23:47:12,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 23:47:12,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:47:12,281 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:47:12,294 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 23:47:12,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 23:47:12,492 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-25 23:47:12,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:47:12,492 INFO L85 PathProgramCache]: Analyzing trace with hash 258883568, now seen corresponding path program 1 times [2022-11-25 23:47:12,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:47:12,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321766956] [2022-11-25 23:47:12,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:12,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:47:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:12,681 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:47:12,681 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:47:12,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321766956] [2022-11-25 23:47:12,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321766956] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:47:12,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2382871] [2022-11-25 23:47:12,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:12,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:47:12,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:47:12,683 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:47:12,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 23:47:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:12,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-25 23:47:12,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:47:14,067 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:47:14,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:47:14,988 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:47:14,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2382871] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:47:14,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [778462606] [2022-11-25 23:47:14,991 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-25 23:47:14,991 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:47:14,992 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:47:14,992 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:47:14,992 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:47:22,567 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:47:31,229 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5372#(and (<= 0 |ULTIMATE.start_main_~c1~0#1|) (<= 0 ~id3~0) (= ~nomsg~0 ~p1_new~0) (<= 0 ~mode1~0) (<= 1 |ULTIMATE.start_init_~tmp~0#1|) (or (and (<= 0 (+ ~p3_old~0 1)) (or (and (not (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|)) (or (= ~st3~0 1) (and (<= 0 ~st3~0) (not (= ~id3~0 |ULTIMATE.start_node3_~m3~0#1|)))) (<= 0 ~send3~0)) (and (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|) (= ~send3~0 |ULTIMATE.start_node3_~m3~0#1|) (<= 0 ~st3~0))) (<= (+ ~p3_old~0 1) 0) (= ~mode3~0 0)) (and (= ~mode3~0 1) (exists ((v_~p3_new~0_51 Int)) (and (= ~p3_old~0 (ite (<= (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_51 ~nomsg~0)) ~send3~0 v_~p3_new~0_51) 256) 127) (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_51 ~nomsg~0)) ~send3~0 v_~p3_new~0_51) 256) (+ (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_51 ~nomsg~0)) ~send3~0 v_~p3_new~0_51) 256) (- 256)))) (<= (+ v_~p3_new~0_51 1) 0) (<= 0 (+ v_~p3_new~0_51 1)))) (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|) (<= 0 ~st3~0) (<= 0 ~send3~0))) (<= 0 ~id1~0) (or (and (= ~mode2~0 0) (<= 0 (+ ~p2_old~0 1)) (or (and (<= 0 ~st2~0) (= ~send2~0 |ULTIMATE.start_node2_~m2~0#1|) (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|)) (and (<= 0 ~send2~0) (or (= ~st2~0 1) (and (not (= |ULTIMATE.start_node2_~m2~0#1| ~id2~0)) (<= 0 ~st2~0))) (not (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|)))) (<= (+ ~p2_old~0 1) 0)) (and (= ~mode2~0 1) (exists ((v_~p2_new~0_51 Int)) (and (<= (+ v_~p2_new~0_51 1) 0) (<= 0 (+ v_~p2_new~0_51 1)) (= (ite (<= (mod (ite (and (not (= ~send2~0 ~nomsg~0)) (= v_~p2_new~0_51 ~nomsg~0)) ~send2~0 v_~p2_new~0_51) 256) 127) (mod (ite (and (not (= ~send2~0 ~nomsg~0)) (= v_~p2_new~0_51 ~nomsg~0)) ~send2~0 v_~p2_new~0_51) 256) (+ (- 256) (mod (ite (and (not (= ~send2~0 ~nomsg~0)) (= v_~p2_new~0_51 ~nomsg~0)) ~send2~0 v_~p2_new~0_51) 256))) ~p2_old~0))) (<= 0 ~st2~0) (<= 0 ~send2~0) (= ~nomsg~0 |ULTIMATE.start_node2_~m2~0#1|))) (= ~p2~0 0) (<= |ULTIMATE.start_init_~tmp~0#1| 1) (< 2147483647 (+ ~st2~0 ~st1~0)) (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= ~p3_new~0 ~nomsg~0) (<= |ULTIMATE.start_init_#res#1| 1) (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= 0 ~st1~0) (= |ULTIMATE.start_main_~i2~0#1| 0) (<= ~id1~0 127) (= ~nomsg~0 ~p2_new~0) (<= (+ ~nomsg~0 1) 0) (<= ~mode1~0 1) (<= 1 |ULTIMATE.start_init_#res#1|) (<= ~id3~0 127) (<= 0 ~id2~0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 127) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= ~p3~0 0) (= ~p1~0 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-25 23:47:31,229 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:47:31,230 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:47:31,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 22 [2022-11-25 23:47:31,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586285825] [2022-11-25 23:47:31,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:47:31,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 23:47:31,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:47:31,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 23:47:31,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1071, Unknown=0, NotChecked=0, Total=1260 [2022-11-25 23:47:31,232 INFO L87 Difference]: Start difference. First operand 173 states and 211 transitions. Second operand has 23 states, 22 states have (on average 5.2272727272727275) internal successors, (115), 23 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:47:32,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:47:32,735 INFO L93 Difference]: Finished difference Result 332 states and 376 transitions. [2022-11-25 23:47:32,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 23:47:32,736 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.2272727272727275) internal successors, (115), 23 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-25 23:47:32,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:47:32,738 INFO L225 Difference]: With dead ends: 332 [2022-11-25 23:47:32,738 INFO L226 Difference]: Without dead ends: 329 [2022-11-25 23:47:32,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 83 SyntacticMatches, 9 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=410, Invalid=2560, Unknown=0, NotChecked=0, Total=2970 [2022-11-25 23:47:32,740 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 529 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:47:32,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 84 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:47:32,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-11-25 23:47:32,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 171. [2022-11-25 23:47:32,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 163 states have (on average 1.2331288343558282) internal successors, (201), 170 states have internal predecessors, (201), 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-25 23:47:32,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 201 transitions. [2022-11-25 23:47:32,792 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 201 transitions. Word has length 39 [2022-11-25 23:47:32,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:47:32,792 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 201 transitions. [2022-11-25 23:47:32,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.2272727272727275) internal successors, (115), 23 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:47:32,793 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 201 transitions. [2022-11-25 23:47:32,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 23:47:32,793 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:47:32,793 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:47:32,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 23:47:32,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 23:47:33,000 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-25 23:47:33,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:47:33,000 INFO L85 PathProgramCache]: Analyzing trace with hash -320986606, now seen corresponding path program 1 times [2022-11-25 23:47:33,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:47:33,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475155172] [2022-11-25 23:47:33,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:33,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:47:33,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:33,731 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:47:33,732 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:47:33,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475155172] [2022-11-25 23:47:33,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475155172] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:47:33,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587323380] [2022-11-25 23:47:33,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:47:33,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:47:33,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:47:33,735 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:47:33,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 23:47:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:47:33,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-25 23:47:33,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:47:38,351 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:47:38,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:47:45,262 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:47:45,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587323380] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:47:45,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1872461689] [2022-11-25 23:47:45,265 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-25 23:47:45,265 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:47:45,265 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:47:45,266 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:47:45,266 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:47:52,368 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:48:01,253 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6316#(and (or (and (= ~mode2~0 1) (exists ((v_~p2_new~0_58 Int)) (and (<= (+ v_~p2_new~0_58 1) 0) (<= 0 (+ v_~p2_new~0_58 1)) (= (ite (<= (mod (ite (and (= v_~p2_new~0_58 ~nomsg~0) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_58) 256) 127) (mod (ite (and (= v_~p2_new~0_58 ~nomsg~0) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_58) 256) (+ (mod (ite (and (= v_~p2_new~0_58 ~nomsg~0) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_58) 256) (- 256))) ~p2_old~0))) (<= 0 ~st2~0) (<= 0 ~send2~0) (= ~nomsg~0 |ULTIMATE.start_node2_~m2~0#1|)) (and (= ~mode2~0 0) (<= 0 (+ ~p2_old~0 1)) (or (and (<= 0 ~st2~0) (= ~send2~0 |ULTIMATE.start_node2_~m2~0#1|) (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|)) (and (<= 0 ~send2~0) (or (= ~st2~0 1) (and (not (= |ULTIMATE.start_node2_~m2~0#1| ~id2~0)) (<= 0 ~st2~0))) (not (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|)))) (<= (+ ~p2_old~0 1) 0))) (<= 0 |ULTIMATE.start_main_~c1~0#1|) (<= 0 ~id3~0) (= ~nomsg~0 ~p1_new~0) (<= 0 ~mode1~0) (<= 1 |ULTIMATE.start_init_~tmp~0#1|) (<= 0 ~id1~0) (= ~p2~0 0) (<= |ULTIMATE.start_init_~tmp~0#1| 1) (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= ~p3_new~0 ~nomsg~0) (<= |ULTIMATE.start_init_#res#1| 1) (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= (+ ~st2~0 ~st1~0) 2147483647) (<= 0 ~st1~0) (= |ULTIMATE.start_main_~i2~0#1| 0) (<= ~id1~0 127) (= ~nomsg~0 ~p2_new~0) (<= (+ ~nomsg~0 1) 0) (<= ~mode1~0 1) (<= 1 |ULTIMATE.start_init_#res#1|) (< 2147483647 (+ ~st3~0 ~st2~0 ~st1~0)) (<= ~id3~0 127) (<= 0 ~id2~0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (or (and (<= 0 (+ ~p3_old~0 1)) (or (and (or (= ~st3~0 1) (not (= ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (not (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|)) (<= 0 ~send3~0)) (and (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|) (= ~send3~0 |ULTIMATE.start_node3_~m3~0#1|))) (<= (+ ~p3_old~0 1) 0) (= ~mode3~0 0)) (and (= ~mode3~0 1) (exists ((v_~p3_new~0_58 Int)) (and (= ~p3_old~0 (ite (<= (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_58 ~nomsg~0)) ~send3~0 v_~p3_new~0_58) 256) 127) (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_58 ~nomsg~0)) ~send3~0 v_~p3_new~0_58) 256) (+ (- 256) (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_58 ~nomsg~0)) ~send3~0 v_~p3_new~0_58) 256)))) (<= 0 (+ v_~p3_new~0_58 1)) (<= (+ v_~p3_new~0_58 1) 0))) (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|) (<= 0 ~send3~0))) (<= ~id2~0 127) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= ~p3~0 0) (= ~p1~0 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-25 23:48:01,253 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:48:01,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:48:01,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 25 [2022-11-25 23:48:01,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361484500] [2022-11-25 23:48:01,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:48:01,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-25 23:48:01,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:01,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-25 23:48:01,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=1232, Unknown=0, NotChecked=0, Total=1560 [2022-11-25 23:48:01,256 INFO L87 Difference]: Start difference. First operand 171 states and 201 transitions. Second operand has 27 states, 26 states have (on average 4.730769230769231) internal successors, (123), 26 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:07,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:07,976 INFO L93 Difference]: Finished difference Result 377 states and 432 transitions. [2022-11-25 23:48:07,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-25 23:48:07,976 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.730769230769231) internal successors, (123), 26 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-25 23:48:07,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:07,978 INFO L225 Difference]: With dead ends: 377 [2022-11-25 23:48:07,978 INFO L226 Difference]: Without dead ends: 309 [2022-11-25 23:48:07,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 80 SyntacticMatches, 10 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1436 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=853, Invalid=2929, Unknown=0, NotChecked=0, Total=3782 [2022-11-25 23:48:07,980 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 572 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:07,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 109 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-25 23:48:07,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-11-25 23:48:08,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 277. [2022-11-25 23:48:08,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 269 states have (on average 1.1598513011152416) internal successors, (312), 276 states have internal predecessors, (312), 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-25 23:48:08,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 312 transitions. [2022-11-25 23:48:08,084 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 312 transitions. Word has length 41 [2022-11-25 23:48:08,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:08,084 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 312 transitions. [2022-11-25 23:48:08,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.730769230769231) internal successors, (123), 26 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:48:08,085 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 312 transitions. [2022-11-25 23:48:08,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-25 23:48:08,089 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:08,089 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:08,100 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 23:48:08,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-25 23:48:08,300 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-25 23:48:08,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:08,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1266303391, now seen corresponding path program 1 times [2022-11-25 23:48:08,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:08,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489600090] [2022-11-25 23:48:08,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:08,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:09,417 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 85 proven. 38 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-25 23:48:09,418 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:09,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489600090] [2022-11-25 23:48:09,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489600090] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:48:09,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255426813] [2022-11-25 23:48:09,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:09,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:48:09,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:48:09,423 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:48:09,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 23:48:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:09,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 23:48:09,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:48:09,613 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 40 proven. 37 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-11-25 23:48:09,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:48:09,633 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-25 23:48:09,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255426813] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 23:48:09,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:48:09,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9, 4] total 12 [2022-11-25 23:48:09,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084390919] [2022-11-25 23:48:09,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:48:09,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:48:09,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:48:09,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:48:09,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-25 23:48:09,636 INFO L87 Difference]: Start difference. First operand 277 states and 312 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-25 23:48:09,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:48:09,782 INFO L93 Difference]: Finished difference Result 373 states and 415 transitions. [2022-11-25 23:48:09,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:48:09,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-25 23:48:09,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:48:09,784 INFO L225 Difference]: With dead ends: 373 [2022-11-25 23:48:09,784 INFO L226 Difference]: Without dead ends: 210 [2022-11-25 23:48:09,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-25 23:48:09,785 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:48:09,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:48:09,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-11-25 23:48:09,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2022-11-25 23:48:09,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 209 states have (on average 1.0478468899521531) internal successors, (219), 209 states have internal predecessors, (219), 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-25 23:48:09,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 219 transitions. [2022-11-25 23:48:09,897 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 219 transitions. Word has length 81 [2022-11-25 23:48:09,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:48:09,898 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 219 transitions. [2022-11-25 23:48:09,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-25 23:48:09,898 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 219 transitions. [2022-11-25 23:48:09,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-25 23:48:09,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:48:09,899 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:48:09,910 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 23:48:10,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:48:10,106 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-25 23:48:10,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:48:10,106 INFO L85 PathProgramCache]: Analyzing trace with hash 203063962, now seen corresponding path program 2 times [2022-11-25 23:48:10,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:48:10,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449704115] [2022-11-25 23:48:10,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:48:10,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:48:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:48:12,344 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 62 proven. 143 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-25 23:48:12,344 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:48:12,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449704115] [2022-11-25 23:48:12,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449704115] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:48:12,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629060501] [2022-11-25 23:48:12,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:48:12,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:48:12,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:48:12,346 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:48:12,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 23:48:12,756 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-25 23:48:12,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:48:12,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-25 23:48:12,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:48:21,552 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 145 proven. 95 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 23:48:21,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:48:44,068 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 128 proven. 108 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-25 23:48:44,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629060501] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:48:44,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1620704751] [2022-11-25 23:48:44,070 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-25 23:48:44,070 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:48:44,070 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:48:44,071 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:48:44,071 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:48:51,012 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:49:01,911 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9049#(and (<= 0 |ULTIMATE.start_main_~c1~0#1|) (<= 0 ~id3~0) (= ~nomsg~0 ~p1_new~0) (<= 0 ~mode1~0) (<= 1 |ULTIMATE.start_init_~tmp~0#1|) (<= 0 ~id1~0) (= ~p2~0 0) (<= |ULTIMATE.start_init_~tmp~0#1| 1) (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= ~p3_new~0 ~nomsg~0) (or (and (<= 0 (+ ~p3_old~0 1)) (or (and (or (= ~st3~0 1) (not (= ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (not (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|)) (<= 0 ~send3~0)) (and (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|) (= ~send3~0 |ULTIMATE.start_node3_~m3~0#1|))) (<= (+ ~p3_old~0 1) 0) (= ~mode3~0 0)) (and (exists ((v_~p3_new~0_68 Int)) (and (<= 0 (+ v_~p3_new~0_68 1)) (<= (+ v_~p3_new~0_68 1) 0) (= ~p3_old~0 (ite (<= (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_68 ~nomsg~0)) ~send3~0 v_~p3_new~0_68) 256) 127) (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_68 ~nomsg~0)) ~send3~0 v_~p3_new~0_68) 256) (+ (- 256) (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_68 ~nomsg~0)) ~send3~0 v_~p3_new~0_68) 256)))))) (= ~mode3~0 1) (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|) (<= 0 ~send3~0))) (<= |ULTIMATE.start_init_#res#1| 1) (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= (+ ~st2~0 ~st1~0) 2147483647) (<= 0 ~st1~0) (= |ULTIMATE.start_main_~i2~0#1| 0) (<= ~id1~0 127) (= ~nomsg~0 ~p2_new~0) (<= (+ ~nomsg~0 1) 0) (<= ~mode1~0 1) (<= 1 |ULTIMATE.start_init_#res#1|) (< 2147483647 (+ ~st3~0 ~st2~0 ~st1~0)) (or (and (= ~mode2~0 1) (<= 0 ~st2~0) (exists ((v_~p2_new~0_69 Int)) (and (<= 0 (+ v_~p2_new~0_69 1)) (= (ite (<= (mod (ite (and (not (= ~send2~0 ~nomsg~0)) (= v_~p2_new~0_69 ~nomsg~0)) ~send2~0 v_~p2_new~0_69) 256) 127) (mod (ite (and (not (= ~send2~0 ~nomsg~0)) (= v_~p2_new~0_69 ~nomsg~0)) ~send2~0 v_~p2_new~0_69) 256) (+ (- 256) (mod (ite (and (not (= ~send2~0 ~nomsg~0)) (= v_~p2_new~0_69 ~nomsg~0)) ~send2~0 v_~p2_new~0_69) 256))) ~p2_old~0) (<= (+ v_~p2_new~0_69 1) 0))) (<= 0 ~send2~0) (= ~nomsg~0 |ULTIMATE.start_node2_~m2~0#1|)) (and (= ~mode2~0 0) (<= 0 (+ ~p2_old~0 1)) (or (and (<= 0 ~st2~0) (= ~send2~0 |ULTIMATE.start_node2_~m2~0#1|) (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|)) (and (<= 0 ~send2~0) (or (= ~st2~0 1) (and (not (= |ULTIMATE.start_node2_~m2~0#1| ~id2~0)) (<= 0 ~st2~0))) (not (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|)))) (<= (+ ~p2_old~0 1) 0))) (<= ~id3~0 127) (<= 0 ~id2~0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 127) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= ~p3~0 0) (= ~p1~0 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-25 23:49:01,911 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:49:01,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:49:01,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 11] total 28 [2022-11-25 23:49:01,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586835613] [2022-11-25 23:49:01,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:49:01,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-25 23:49:01,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:49:01,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 23:49:01,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=1407, Unknown=0, NotChecked=0, Total=1722 [2022-11-25 23:49:01,914 INFO L87 Difference]: Start difference. First operand 210 states and 219 transitions. Second operand has 29 states, 28 states have (on average 9.428571428571429) internal successors, (264), 29 states have internal predecessors, (264), 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-25 23:49:05,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:49:05,560 INFO L93 Difference]: Finished difference Result 210 states and 219 transitions. [2022-11-25 23:49:05,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 23:49:05,560 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 9.428571428571429) internal successors, (264), 29 states have internal predecessors, (264), 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 105 [2022-11-25 23:49:05,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:49:05,561 INFO L225 Difference]: With dead ends: 210 [2022-11-25 23:49:05,561 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 23:49:05,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 250 SyntacticMatches, 32 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2246 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=637, Invalid=2669, Unknown=0, NotChecked=0, Total=3306 [2022-11-25 23:49:05,563 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 176 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 23:49:05,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 136 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 23:49:05,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 23:49:05,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 23:49:05,564 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-25 23:49:05,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 23:49:05,564 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2022-11-25 23:49:05,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:49:05,565 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 23:49:05,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 9.428571428571429) internal successors, (264), 29 states have internal predecessors, (264), 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-25 23:49:05,565 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 23:49:05,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 23:49:05,568 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-11-25 23:49:05,569 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-11-25 23:49:05,569 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-11-25 23:49:05,569 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-11-25 23:49:05,569 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-11-25 23:49:05,569 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-11-25 23:49:05,570 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-11-25 23:49:05,570 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-11-25 23:49:05,570 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-11-25 23:49:05,570 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-11-25 23:49:05,570 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-11-25 23:49:05,571 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-11-25 23:49:05,571 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-11-25 23:49:05,571 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-11-25 23:49:05,579 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-25 23:49:05,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:49:05,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 23:49:17,180 WARN L233 SmtUtils]: Spent 5.44s on a formula simplification. DAG size of input: 466 DAG size of output: 194 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-25 23:49:23,068 WARN L233 SmtUtils]: Spent 5.88s on a formula simplification. DAG size of input: 466 DAG size of output: 199 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-25 23:49:32,126 WARN L233 SmtUtils]: Spent 5.71s on a formula simplification. DAG size of input: 489 DAG size of output: 176 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-25 23:49:32,130 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 210) no Hoare annotation was computed. [2022-11-25 23:49:32,131 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-11-25 23:49:32,131 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 214) no Hoare annotation was computed. [2022-11-25 23:49:32,131 INFO L899 garLoopResultBuilder]: For program point L219(line 219) no Hoare annotation was computed. [2022-11-25 23:49:32,131 INFO L899 garLoopResultBuilder]: For program point L219-1(line 219) no Hoare annotation was computed. [2022-11-25 23:49:32,131 INFO L899 garLoopResultBuilder]: For program point L219-2(line 219) no Hoare annotation was computed. [2022-11-25 23:49:32,131 INFO L899 garLoopResultBuilder]: For program point L219-3(line 219) no Hoare annotation was computed. [2022-11-25 23:49:32,131 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 214) no Hoare annotation was computed. [2022-11-25 23:49:32,131 INFO L899 garLoopResultBuilder]: For program point L57(lines 57 78) no Hoare annotation was computed. [2022-11-25 23:49:32,132 INFO L895 garLoopResultBuilder]: At program point L57-2(lines 51 81) the Hoare annotation is: (let ((.cse48 (mod ~send2~0 256))) (let ((.cse24 (+ ~nomsg~0 1)) (.cse49 (+ ~p2_new~0 1)) (.cse47 (<= .cse48 127)) (.cse50 (+ ~p3_new~0 1))) (let ((.cse1 (<= 0 ~id3~0)) (.cse2 (<= 0 .cse50)) (.cse19 (<= 0 ~st1~0)) (.cse20 (<= 0 ~st2~0)) (.cse21 (<= 0 ~send2~0)) (.cse6 (= ~mode2~0 0)) (.cse10 (= ~mode2~0 1)) (.cse9 (= ~mode3~0 1)) (.cse12 (and (or (not (= ~id3~0 .cse48)) (= ~st3~0 1)) (<= .cse48 ~id3~0))) (.cse7 (= ~send3~0 .cse48)) (.cse8 (< ~id3~0 ~send3~0)) (.cse11 (+ 256 ~p2_old~0)) (.cse13 (not .cse47)) (.cse30 (<= 0 ~st3~0)) (.cse31 (<= .cse50 0)) (.cse0 (<= 0 |ULTIMATE.start_main_~c1~0#1|)) (.cse3 (<= 1 |ULTIMATE.start_init_~tmp~0#1|)) (.cse4 (<= 0 ~id1~0)) (.cse34 (= ~p2~0 0)) (.cse14 (<= |ULTIMATE.start_init_~tmp~0#1| 1)) (.cse15 (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse16 (<= |ULTIMATE.start_init_#res#1| 1)) (.cse46 (= ~nomsg~0 ~p2_old~0)) (.cse17 (not (= ~id3~0 ~id2~0))) (.cse18 (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse35 (= |ULTIMATE.start_main_~i2~0#1| 0)) (.cse42 (= ~mode1~0 1)) (.cse22 (<= ~id1~0 127)) (.cse43 (= ~nomsg~0 ~p1_old~0)) (.cse23 (<= 0 .cse49)) (.cse44 (= .cse24 0)) (.cse25 (<= .cse49 0)) (.cse26 (<= 1 |ULTIMATE.start_init_#res#1|)) (.cse27 (<= ~id3~0 127)) (.cse28 (<= 0 ~id2~0)) (.cse36 (= |#NULL.offset| 0)) (.cse29 (<= ~id2~0 127)) (.cse32 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse33 (= ~p3~0 0)) (.cse38 (<= 0 ~send3~0)) (.cse37 (= ~p1~0 0)) (.cse39 (<= 0 |#StackHeapBarrier|)) (.cse40 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse41 (= |#NULL.base| 0))) (or (let ((.cse5 (+ ~p1_new~0 1))) (and .cse0 .cse1 .cse2 .cse3 (<= ~st2~0 1) .cse4 (<= .cse5 0) (or (and .cse6 .cse7 .cse8) (and .cse9 .cse6) (and .cse10 (or (and (< ~p2_old~0 0) (<= (+ 257 (* 256 (div (+ (- 129) (- ~p2_old~0)) 256)) ~p2_old~0) 0) (<= 0 .cse11)) (and (< ~p2_old~0 256) (<= (mod ~p2_old~0 256) 127) (<= 0 ~p2_old~0)))) (and .cse6 (or .cse12 .cse13))) .cse14 (<= 0 ~mode3~0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= ~mode3~0 1) (<= |ULTIMATE.start_main_~c1~0#1| 1) .cse21 .cse22 (<= ~st1~0 1) .cse23 (<= .cse24 0) .cse25 .cse26 (= ~mode1~0 0) .cse27 (<= ~st3~0 1) .cse28 (<= 0 .cse24) .cse29 .cse30 .cse31 .cse32 .cse33 (<= 0 .cse5) (or (and (= |ULTIMATE.start_check_~tmp~1#1| 0) .cse34 .cse35 .cse36 .cse37) (and (= |ULTIMATE.start_check_~tmp~1#1| 1) .cse34 .cse35 .cse36 .cse37)) .cse38 .cse39 .cse40 .cse41)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse34 .cse14 .cse15 .cse16 .cse17 .cse18 (<= (+ ~st3~0 ~st2~0 ~st1~0) 1) .cse19 .cse35 .cse20 .cse21 .cse42 .cse22 .cse43 .cse23 .cse44 .cse25 .cse26 .cse27 .cse28 .cse36 (let ((.cse45 (= ~mode3~0 0))) (or (and .cse6 (or .cse9 .cse45) .cse46) (and .cse10 (or (and .cse9 (or .cse12 (and .cse7 .cse8) .cse13)) .cse45) (or (and .cse47 (= .cse48 ~p2_old~0)) (and (= .cse48 .cse11) .cse13))))) .cse29 .cse30 .cse31 .cse32 .cse33 .cse38 .cse37 .cse39 .cse40 .cse41) (and .cse0 .cse3 (= (mod ~mode3~0 256) 0) .cse4 (= (mod ~mode2~0 256) 0) .cse34 .cse14 .cse15 (= ~send3~0 ~id3~0) (= ~p3_new~0 ~nomsg~0) .cse16 (= ~st3~0 0) .cse46 .cse17 .cse18 .cse35 .cse42 .cse22 (= ~st1~0 0) .cse43 .cse23 .cse44 .cse25 .cse26 .cse27 .cse28 .cse36 (= ~st2~0 0) (= ~p3_old~0 ~nomsg~0) .cse29 .cse32 .cse33 (= (mod ~r1~0 256) 0) .cse38 .cse37 .cse39 .cse40 (= ~send2~0 ~id2~0) .cse41))))) [2022-11-25 23:49:32,133 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 219) no Hoare annotation was computed. [2022-11-25 23:49:32,133 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 23:49:32,133 INFO L899 garLoopResultBuilder]: For program point L58-2(lines 58 60) no Hoare annotation was computed. [2022-11-25 23:49:32,133 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 219) no Hoare annotation was computed. [2022-11-25 23:49:32,133 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 210) no Hoare annotation was computed. [2022-11-25 23:49:32,133 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 214) no Hoare annotation was computed. [2022-11-25 23:49:32,133 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 214) no Hoare annotation was computed. [2022-11-25 23:49:32,133 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 61) no Hoare annotation was computed. [2022-11-25 23:49:32,134 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2022-11-25 23:49:32,134 INFO L899 garLoopResultBuilder]: For program point L210(line 210) no Hoare annotation was computed. [2022-11-25 23:49:32,134 INFO L899 garLoopResultBuilder]: For program point L210-1(line 210) no Hoare annotation was computed. [2022-11-25 23:49:32,134 INFO L899 garLoopResultBuilder]: For program point L210-2(line 210) no Hoare annotation was computed. [2022-11-25 23:49:32,134 INFO L899 garLoopResultBuilder]: For program point L210-3(line 210) no Hoare annotation was computed. [2022-11-25 23:49:32,134 INFO L899 garLoopResultBuilder]: For program point L210-4(lines 210 229) no Hoare annotation was computed. [2022-11-25 23:49:32,135 INFO L895 garLoopResultBuilder]: At program point L210-5(lines 210 229) the Hoare annotation is: (let ((.cse40 (= ~mode3~0 1)) (.cse21 (= ~mode3~0 0)) (.cse41 (= ~mode2~0 1)) (.cse56 (+ ~p2_new~0 1)) (.cse2 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse0 (= |ULTIMATE.start_check_~tmp~1#1| 0)) (.cse49 (+ ~p1_new~0 1)) (.cse48 (= ~st3~0 1)) (.cse59 (mod ~send2~0 256))) (let ((.cse27 (= ~mode1~0 0)) (.cse3 (<= 0 |ULTIMATE.start_main_~c1~0#1|)) (.cse4 (<= 0 ~id3~0)) (.cse19 (and (or (not (= ~id3~0 .cse59)) .cse48) (<= .cse59 ~id3~0))) (.cse20 (and (= ~send3~0 .cse59) (< ~id3~0 ~send3~0))) (.cse22 (not (<= .cse59 127))) (.cse5 (<= 1 |ULTIMATE.start_init_~tmp~0#1|)) (.cse6 (<= 0 ~id1~0)) (.cse7 (<= .cse49 0)) (.cse8 (<= |ULTIMATE.start_init_~tmp~0#1| 1)) (.cse9 (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse10 (= ~p3_new~0 ~nomsg~0)) (.cse11 (<= |ULTIMATE.start_init_#res#1| 1)) (.cse12 (not (= ~id3~0 ~id2~0))) (.cse13 (let ((.cse57 (= ~p2~0 0)) (.cse58 (= |ULTIMATE.start_main_~i2~0#1| 0))) (or (and .cse0 .cse57 .cse58) (and (= |ULTIMATE.start_check_~tmp~1#1| 1) .cse57 .cse58)))) (.cse14 (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse15 (<= .cse2 1)) (.cse16 (<= 0 ~st1~0)) (.cse1 (= ~mode1~0 1)) (.cse17 (<= ~id1~0 127)) (.cse18 (<= 0 .cse56)) (.cse24 (<= .cse56 0)) (.cse25 (<= 1 |ULTIMATE.start_init_#res#1|)) (.cse26 (let ((.cse51 (<= 0 ~st2~0)) (.cse53 (<= 0 ~send2~0))) (or (let ((.cse50 (+ ~p2_old~0 1))) (and (= ~mode2~0 0) (<= 0 .cse50) (let ((.cse52 (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|))) (or (and .cse51 (= ~send2~0 |ULTIMATE.start_node2_~m2~0#1|) .cse52) (and .cse53 (or (= ~st2~0 1) (and (not (= |ULTIMATE.start_node2_~m2~0#1| ~id2~0)) .cse51)) (not .cse52)))) (<= .cse50 0))) (and .cse41 (exists ((v_~p2_new~0_44 Int)) (let ((.cse55 (+ v_~p2_new~0_44 1))) (and (= (let ((.cse54 (mod (ite (and (= v_~p2_new~0_44 ~nomsg~0) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_44) 256))) (ite (<= .cse54 127) .cse54 (+ (- 256) .cse54))) ~p2_old~0) (<= .cse55 0) (<= 0 .cse55)))) .cse51 .cse53 (= ~nomsg~0 |ULTIMATE.start_node2_~m2~0#1|))))) (.cse28 (<= ~id3~0 127)) (.cse29 (<= 0 ~id2~0)) (.cse30 (= |#NULL.offset| 0)) (.cse23 (+ ~nomsg~0 1)) (.cse31 (<= ~id2~0 127)) (.cse32 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse33 (= ~p3~0 0)) (.cse34 (<= 0 .cse49)) (.cse35 (= ~p1~0 0)) (.cse36 (<= 0 |#StackHeapBarrier|)) (.cse37 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse38 (let ((.cse45 (<= 0 ~send3~0)) (.cse44 (<= 0 ~st3~0))) (or (and .cse40 (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|) (exists ((v_~p3_new~0_44 Int)) (let ((.cse42 (+ v_~p3_new~0_44 1))) (and (<= 0 .cse42) (= ~p3_old~0 (let ((.cse43 (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_44 ~nomsg~0)) ~send3~0 v_~p3_new~0_44) 256))) (ite (<= .cse43 127) .cse43 (+ (- 256) .cse43)))) (<= .cse42 0)))) .cse44 .cse45) (let ((.cse46 (+ ~p3_old~0 1))) (and (<= 0 .cse46) (let ((.cse47 (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (or (and (not .cse47) (or .cse48 (and .cse44 (not (= ~id3~0 |ULTIMATE.start_node3_~m3~0#1|)))) .cse45) (and .cse47 (= ~send3~0 |ULTIMATE.start_node3_~m3~0#1|) .cse44))) (<= .cse46 0) .cse21))))) (.cse39 (= |#NULL.base| 0))) (or (and (= ~nomsg~0 ~p1_new~0) .cse0 (<= (+ ~st2~0 ~st1~0) 2147483647) .cse1 (<= .cse2 2147483647)) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= |ULTIMATE.start_main_~c1~0#1| 1) .cse17 (= ~nomsg~0 ~p1_old~0) .cse18 (or .cse19 (= ~nomsg~0 ~p2_old~0) .cse20 .cse21 .cse22) (= .cse23 0) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39) (and .cse0 .cse27) (and .cse3 .cse4 (or .cse40 .cse41 .cse19 .cse20 .cse22) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse1 .cse17 .cse18 .cse24 .cse25 .cse26 .cse28 .cse29 .cse30 (<= 0 .cse23) .cse31 (<= (+ ~p3_new~0 1) 0) .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39)))) [2022-11-25 23:49:32,135 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 61) no Hoare annotation was computed. [2022-11-25 23:49:32,135 INFO L899 garLoopResultBuilder]: For program point L211(lines 211 226) no Hoare annotation was computed. [2022-11-25 23:49:32,135 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 219) no Hoare annotation was computed. [2022-11-25 23:49:32,136 INFO L895 garLoopResultBuilder]: At program point L262-2(lines 262 276) the Hoare annotation is: (let ((.cse45 (+ ~p2_new~0 1)) (.cse44 (+ ~p1_new~0 1)) (.cse2 (= ~mode3~0 1)) (.cse43 (<= 0 ~send3~0)) (.cse39 (= ~mode3~0 0)) (.cse3 (= ~mode2~0 1)) (.cse51 (= ~st3~0 1)) (.cse58 (mod ~send2~0 256)) (.cse41 (= ~p2~0 0)) (.cse42 (= |ULTIMATE.start_main_~i2~0#1| 0))) (let ((.cse1 (<= 0 ~id3~0)) (.cse15 (or (and (= |ULTIMATE.start_check_~tmp~1#1| 0) .cse41 .cse42) (and (= |ULTIMATE.start_check_~tmp~1#1| 1) .cse41 .cse42))) (.cse17 (<= (+ ~st3~0 ~st2~0 ~st1~0) 1)) (.cse18 (<= 0 ~st1~0)) (.cse4 (and (or (not (= ~id3~0 .cse58)) .cse51) (<= .cse58 ~id3~0))) (.cse5 (and (= ~send3~0 .cse58) (< ~id3~0 ~send3~0))) (.cse6 (not (<= .cse58 127))) (.cse23 (let ((.cse53 (<= 0 ~st2~0)) (.cse55 (<= 0 ~send2~0))) (or (let ((.cse52 (+ ~p2_old~0 1))) (and (= ~mode2~0 0) (<= 0 .cse52) (let ((.cse54 (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|))) (or (and .cse53 (= ~send2~0 |ULTIMATE.start_node2_~m2~0#1|) .cse54) (and .cse55 (or (= ~st2~0 1) (and (not (= |ULTIMATE.start_node2_~m2~0#1| ~id2~0)) .cse53)) (not .cse54)))) (<= .cse52 0))) (and .cse3 (exists ((v_~p2_new~0_44 Int)) (let ((.cse57 (+ v_~p2_new~0_44 1))) (and (= (let ((.cse56 (mod (ite (and (= v_~p2_new~0_44 ~nomsg~0) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_44) 256))) (ite (<= .cse56 127) .cse56 (+ (- 256) .cse56))) ~p2_old~0) (<= .cse57 0) (<= 0 .cse57)))) .cse53 .cse55 (= ~nomsg~0 |ULTIMATE.start_node2_~m2~0#1|))))) (.cse34 (let ((.cse48 (<= 0 ~st3~0))) (or (and .cse2 (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|) (exists ((v_~p3_new~0_44 Int)) (let ((.cse46 (+ v_~p3_new~0_44 1))) (and (<= 0 .cse46) (= ~p3_old~0 (let ((.cse47 (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_44 ~nomsg~0)) ~send3~0 v_~p3_new~0_44) 256))) (ite (<= .cse47 127) .cse47 (+ (- 256) .cse47)))) (<= .cse46 0)))) .cse48 .cse43) (let ((.cse49 (+ ~p3_old~0 1))) (and (<= 0 .cse49) (let ((.cse50 (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (or (and (not .cse50) (or .cse51 (and .cse48 (not (= ~id3~0 |ULTIMATE.start_node3_~m3~0#1|)))) .cse43) (and .cse50 (= ~send3~0 |ULTIMATE.start_node3_~m3~0#1|) .cse48))) (<= .cse49 0) .cse39))))) (.cse0 (<= 0 |ULTIMATE.start_main_~c1~0#1|)) (.cse7 (<= 1 |ULTIMATE.start_init_~tmp~0#1|)) (.cse8 (<= 0 ~id1~0)) (.cse9 (<= .cse44 0)) (.cse10 (<= |ULTIMATE.start_init_~tmp~0#1| 1)) (.cse11 (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse12 (= ~p3_new~0 ~nomsg~0)) (.cse13 (<= |ULTIMATE.start_init_#res#1| 1)) (.cse38 (= ~nomsg~0 ~p2_old~0)) (.cse14 (not (= ~id3~0 ~id2~0))) (.cse16 (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse19 (<= |ULTIMATE.start_main_~c1~0#1| 1)) (.cse20 (<= ~id1~0 127)) (.cse36 (= ~nomsg~0 ~p1_old~0)) (.cse37 (<= 0 .cse45)) (.cse21 (= (+ ~nomsg~0 1) 0)) (.cse40 (<= .cse45 0)) (.cse22 (<= 1 |ULTIMATE.start_init_#res#1|)) (.cse24 (<= ~id3~0 127)) (.cse25 (<= 0 ~id2~0)) (.cse26 (= |#NULL.offset| 0)) (.cse27 (<= ~id2~0 127)) (.cse28 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse29 (= ~p3~0 0)) (.cse30 (<= 0 .cse44)) (.cse31 (= ~p1~0 0)) (.cse32 (<= 0 |#StackHeapBarrier|)) (.cse33 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse35 (= |#NULL.base| 0))) (or (and .cse0 .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= ~mode1~0 1) .cse20 (= ~nomsg~0 ~p2_new~0) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35) (and .cse0 .cse1 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse36 .cse37 (or .cse4 .cse38 .cse5 .cse39 .cse6) .cse21 .cse40 .cse22 .cse23 (= ~mode1~0 0) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35) (and .cse0 .cse7 (= (mod ~mode3~0 256) 0) .cse8 (= (mod ~mode2~0 256) 0) .cse41 .cse9 .cse10 .cse11 (= ~send3~0 ~id3~0) .cse12 .cse13 (= ~st3~0 0) .cse38 .cse14 (= (mod ~mode1~0 256) 0) .cse16 .cse42 .cse19 .cse20 (= ~st1~0 0) .cse36 .cse37 .cse21 .cse40 .cse22 .cse24 .cse25 .cse26 (= ~st2~0 0) (= ~p3_old~0 ~nomsg~0) .cse27 .cse28 .cse29 .cse30 (= (mod ~r1~0 256) 0) .cse43 .cse31 .cse32 .cse33 (= ~send2~0 ~id2~0) .cse35)))) [2022-11-25 23:49:32,136 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 219) no Hoare annotation was computed. [2022-11-25 23:49:32,136 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 210) no Hoare annotation was computed. [2022-11-25 23:49:32,136 INFO L899 garLoopResultBuilder]: For program point L214(line 214) no Hoare annotation was computed. [2022-11-25 23:49:32,136 INFO L899 garLoopResultBuilder]: For program point L214-1(line 214) no Hoare annotation was computed. [2022-11-25 23:49:32,136 INFO L899 garLoopResultBuilder]: For program point L214-2(line 214) no Hoare annotation was computed. [2022-11-25 23:49:32,136 INFO L899 garLoopResultBuilder]: For program point L214-3(line 214) no Hoare annotation was computed. [2022-11-25 23:49:32,136 INFO L899 garLoopResultBuilder]: For program point L214-4(lines 214 226) no Hoare annotation was computed. [2022-11-25 23:49:32,137 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 210) no Hoare annotation was computed. [2022-11-25 23:49:32,137 INFO L895 garLoopResultBuilder]: At program point L215(lines 211 226) the Hoare annotation is: (let ((.cse34 (= ~mode3~0 1)) (.cse18 (= ~mode3~0 0)) (.cse35 (= ~mode2~0 1)) (.cse42 (= ~st3~0 1)) (.cse49 (mod ~send2~0 256))) (let ((.cse0 (<= 0 |ULTIMATE.start_main_~c1~0#1|)) (.cse1 (<= 0 ~id3~0)) (.cse16 (and (or (not (= ~id3~0 .cse49)) .cse42) (<= .cse49 ~id3~0))) (.cse17 (and (= ~send3~0 .cse49) (< ~id3~0 ~send3~0))) (.cse19 (not (<= .cse49 127))) (.cse2 (<= 1 |ULTIMATE.start_init_~tmp~0#1|)) (.cse3 (<= 0 ~id1~0)) (.cse5 (<= |ULTIMATE.start_init_~tmp~0#1| 1)) (.cse6 (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse7 (= ~p3_new~0 ~nomsg~0)) (.cse8 (<= |ULTIMATE.start_init_#res#1| 1)) (.cse9 (not (= ~id3~0 ~id2~0))) (.cse10 (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse11 (<= (+ ~st3~0 ~st2~0 ~st1~0) 1)) (.cse12 (<= 0 ~st1~0)) (.cse13 (= |ULTIMATE.start_main_~i2~0#1| 0)) (.cse14 (<= ~id1~0 127)) (.cse15 (= ~nomsg~0 ~p2_new~0)) (.cse20 (= (+ ~nomsg~0 1) 0)) (.cse21 (<= 1 |ULTIMATE.start_init_#res#1|)) (.cse22 (let ((.cse44 (<= 0 ~st2~0)) (.cse46 (<= 0 ~send2~0))) (or (let ((.cse43 (+ ~p2_old~0 1))) (and (= ~mode2~0 0) (<= 0 .cse43) (let ((.cse45 (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|))) (or (and .cse44 (= ~send2~0 |ULTIMATE.start_node2_~m2~0#1|) .cse45) (and .cse46 (or (= ~st2~0 1) (and (not (= |ULTIMATE.start_node2_~m2~0#1| ~id2~0)) .cse44)) (not .cse45)))) (<= .cse43 0))) (and .cse35 (exists ((v_~p2_new~0_44 Int)) (let ((.cse48 (+ v_~p2_new~0_44 1))) (and (= (let ((.cse47 (mod (ite (and (= v_~p2_new~0_44 ~nomsg~0) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_44) 256))) (ite (<= .cse47 127) .cse47 (+ (- 256) .cse47))) ~p2_old~0) (<= .cse48 0) (<= 0 .cse48)))) .cse44 .cse46 (= ~nomsg~0 |ULTIMATE.start_node2_~m2~0#1|))))) (.cse23 (<= ~id3~0 127)) (.cse24 (<= 0 ~id2~0)) (.cse25 (= |#NULL.offset| 0)) (.cse26 (<= ~id2~0 127)) (.cse27 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse28 (= ~p3~0 0)) (.cse29 (= ~p1~0 0)) (.cse30 (<= 0 |#StackHeapBarrier|)) (.cse31 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse32 (let ((.cse39 (<= 0 ~send3~0)) (.cse38 (<= 0 ~st3~0))) (or (and .cse34 (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|) (exists ((v_~p3_new~0_44 Int)) (let ((.cse36 (+ v_~p3_new~0_44 1))) (and (<= 0 .cse36) (= ~p3_old~0 (let ((.cse37 (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_44 ~nomsg~0)) ~send3~0 v_~p3_new~0_44) 256))) (ite (<= .cse37 127) .cse37 (+ (- 256) .cse37)))) (<= .cse36 0)))) .cse38 .cse39) (let ((.cse40 (+ ~p3_old~0 1))) (and (<= 0 .cse40) (let ((.cse41 (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (or (and (not .cse41) (or .cse42 (and .cse38 (not (= ~id3~0 |ULTIMATE.start_node3_~m3~0#1|)))) .cse39) (and .cse41 (= ~send3~0 |ULTIMATE.start_node3_~m3~0#1|) .cse38))) (<= .cse40 0) .cse18))))) (.cse33 (= |#NULL.base| 0))) (or (let ((.cse4 (+ ~p1_new~0 1))) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= 0 ~p2~0) (<= |ULTIMATE.start_main_~c1~0#1| 1) .cse14 .cse15 (= ~nomsg~0 ~p1_old~0) (or .cse16 (= ~nomsg~0 ~p2_old~0) .cse17 .cse18 .cse19) .cse20 .cse21 .cse22 (= ~mode1~0 0) .cse23 .cse24 .cse25 (<= ~p2~0 0) .cse26 .cse27 .cse28 (<= 0 .cse4) .cse29 .cse30 .cse31 .cse32 .cse33)) (and .cse0 .cse1 (= ~nomsg~0 ~p1_new~0) (or .cse34 .cse35 .cse16 .cse17 .cse19) .cse2 .cse3 (= ~p2~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~mode1~0 1) .cse14 .cse15 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33)))) [2022-11-25 23:49:32,141 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:49:32,143 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 23:49:32,153 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,154 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,154 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,155 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,155 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,155 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,155 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,156 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,156 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,156 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,157 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,157 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,157 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,157 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,157 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,158 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,158 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,159 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,159 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,159 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,159 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,160 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,160 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,160 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,160 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,161 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,161 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,161 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,161 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,162 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,162 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,162 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,175 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,175 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,175 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,176 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,176 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,176 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,176 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,177 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,177 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,177 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,178 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,178 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,178 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,178 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,179 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,179 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,179 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,180 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,180 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,180 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,180 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,181 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,181 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,181 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,181 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,182 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,182 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,182 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,182 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,183 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,183 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,183 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,188 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,189 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,189 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,189 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,189 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,190 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,190 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,190 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,191 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,191 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,191 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,191 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,191 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,192 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,192 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,192 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,193 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,193 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,193 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,193 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,194 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,194 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,194 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,194 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,195 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,195 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,195 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,195 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,196 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,196 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,196 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,196 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,200 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,201 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,201 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,201 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,201 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,202 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,202 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,202 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,203 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,203 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,203 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,203 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,203 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,204 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,204 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,204 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,204 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,205 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,205 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,205 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,205 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,206 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,206 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,206 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,207 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,207 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,207 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,207 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,207 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,208 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,208 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,208 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,217 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,217 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,217 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,218 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,218 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,218 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,218 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,219 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,219 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,219 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,219 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,220 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,220 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,220 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,220 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,220 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,221 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,221 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,221 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,222 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,222 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,222 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,222 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,223 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,223 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,223 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,223 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,224 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,224 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,224 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,224 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,224 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,227 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,227 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,228 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,228 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,228 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,229 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,229 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,229 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,229 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,230 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,230 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,230 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,230 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,230 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,231 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,231 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,231 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,231 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,232 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,232 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,232 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,232 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,233 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,233 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,233 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,233 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,234 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,234 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,234 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,234 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,234 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,235 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 11:49:32 BoogieIcfgContainer [2022-11-25 23:49:32,237 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 23:49:32,238 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 23:49:32,238 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 23:49:32,238 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 23:49:32,239 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:46:13" (3/4) ... [2022-11-25 23:49:32,242 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 23:49:32,254 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2022-11-25 23:49:32,255 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-11-25 23:49:32,255 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-25 23:49:32,256 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 23:49:32,283 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && ((((mode3 == 1 || mode2 == 1) || ((!(id3 == send2 % 256) || st3 == 1) && send2 % 256 <= id3)) || (send3 == send2 % 256 && id3 < send3)) || !(send2 % 256 <= 127))) && 1 <= tmp) && 0 <= id1) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && !(id3 == id2)) && (((tmp == 0 && p2 == 0) && i2 == 0) || ((tmp == 1 && p2 == 0) && i2 == 0))) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && c1 <= 1) && mode1 == 1) && id1 <= 127) && nomsg == p2_new) && nomsg + 1 == 0) && 1 <= \result) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || ((((mode2 == 1 && (\exists v_~p2_new~0_44 : int :: ((if (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256 <= 127 then (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256 else -256 + (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256) == p2_\old && v_~p2_new~0_44 + 1 <= 0) && 0 <= v_~p2_new~0_44 + 1)) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && id3 <= 127) && 0 <= id2) && #NULL == 0) && id2 <= 127) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && cond <= 1) && (((((mode3 == 1 && nomsg == m3) && (\exists v_~p3_new~0_44 : int :: (0 <= v_~p3_new~0_44 + 1 && p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256)) && v_~p3_new~0_44 + 1 <= 0)) && 0 <= st3) && 0 <= send3) || (((0 <= p3_\old + 1 && (((!(id3 < m3) && (st3 == 1 || (0 <= st3 && !(id3 == m3)))) && 0 <= send3) || ((id3 < m3 && send3 == m3) && 0 <= st3))) && p3_\old + 1 <= 0) && mode3 == 0))) && #NULL == 0) || (((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && 1 <= tmp) && 0 <= id1) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && !(id3 == id2)) && (((tmp == 0 && p2 == 0) && i2 == 0) || ((tmp == 1 && p2 == 0) && i2 == 0))) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && c1 <= 1) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && ((((((!(id3 == send2 % 256) || st3 == 1) && send2 % 256 <= id3) || nomsg == p2_\old) || (send3 == send2 % 256 && id3 < send3)) || mode3 == 0) || !(send2 % 256 <= 127))) && nomsg + 1 == 0) && p2_new + 1 <= 0) && 1 <= \result) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || ((((mode2 == 1 && (\exists v_~p2_new~0_44 : int :: ((if (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256 <= 127 then (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256 else -256 + (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256) == p2_\old && v_~p2_new~0_44 + 1 <= 0) && 0 <= v_~p2_new~0_44 + 1)) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && id2 <= 127) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && cond <= 1) && (((((mode3 == 1 && nomsg == m3) && (\exists v_~p3_new~0_44 : int :: (0 <= v_~p3_new~0_44 + 1 && p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256)) && v_~p3_new~0_44 + 1 <= 0)) && 0 <= st3) && 0 <= send3) || (((0 <= p3_\old + 1 && (((!(id3 < m3) && (st3 == 1 || (0 <= st3 && !(id3 == m3)))) && 0 <= send3) || ((id3 < m3 && send3 == m3) && 0 <= st3))) && p3_\old + 1 <= 0) && mode3 == 0))) && #NULL == 0)) || (((((((((((((((((((((((((((((((((((((((((0 <= c1 && 1 <= tmp) && mode3 % 256 == 0) && 0 <= id1) && mode2 % 256 == 0) && p2 == 0) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && send3 == id3) && p3_new == nomsg) && \result <= 1) && st3 == 0) && nomsg == p2_\old) && !(id3 == id2)) && mode1 % 256 == 0) && 1 <= \old(cond)) && i2 == 0) && c1 <= 1) && id1 <= 127) && st1 == 0) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 == 0) && p2_new + 1 <= 0) && 1 <= \result) && id3 <= 127) && 0 <= id2) && #NULL == 0) && st2 == 0) && p3_\old == nomsg) && id2 <= 127) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && r1 % 256 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && cond <= 1) && send2 == id2) && #NULL == 0) [2022-11-25 23:49:32,283 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && 0 <= p3_new + 1) && 1 <= tmp) && st2 <= 1) && 0 <= id1) && p1_new + 1 <= 0) && (((((mode2 == 0 && send3 == send2 % 256) && id3 < send3) || (mode3 == 1 && mode2 == 0)) || (mode2 == 1 && (((p2_\old < 0 && 257 + 256 * ((-129 + -p2_\old) / 256) + p2_\old <= 0) && 0 <= 256 + p2_\old) || ((p2_\old < 256 && p2_\old % 256 <= 127) && 0 <= p2_\old)))) || (mode2 == 0 && (((!(id3 == send2 % 256) || st3 == 1) && send2 % 256 <= id3) || !(send2 % 256 <= 127))))) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && \result <= 1) && !(id3 == id2)) && 1 <= \old(cond)) && 0 <= st1) && 0 <= st2) && mode3 <= 1) && c1 <= 1) && 0 <= send2) && id1 <= 127) && st1 <= 1) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && id3 <= 127) && st3 <= 1) && 0 <= id2) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && (((((tmp == 0 && p2 == 0) && i2 == 0) && #NULL == 0) && p1 == 0) || ((((tmp == 1 && p2 == 0) && i2 == 0) && #NULL == 0) && p1 == 0))) && 0 <= send3) && 0 <= unknown-#StackHeapBarrier-unknown) && cond <= 1) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && 0 <= p3_new + 1) && 1 <= tmp) && 0 <= id1) && p2 == 0) && tmp <= 1) && 1 <= cond) && \result <= 1) && !(id3 == id2)) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && i2 == 0) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 == 0) && p2_new + 1 <= 0) && 1 <= \result) && id3 <= 127) && 0 <= id2) && #NULL == 0) && (((mode2 == 0 && (mode3 == 1 || mode3 == 0)) && nomsg == p2_\old) || ((mode2 == 1 && ((mode3 == 1 && ((((!(id3 == send2 % 256) || st3 == 1) && send2 % 256 <= id3) || (send3 == send2 % 256 && id3 < send3)) || !(send2 % 256 <= 127))) || mode3 == 0)) && ((send2 % 256 <= 127 && send2 % 256 == p2_\old) || (send2 % 256 == 256 + p2_\old && !(send2 % 256 <= 127)))))) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && cond <= 1) && #NULL == 0)) || ((((((((((((((((((((((((((((((((((((((0 <= c1 && 1 <= tmp) && mode3 % 256 == 0) && 0 <= id1) && mode2 % 256 == 0) && p2 == 0) && tmp <= 1) && 1 <= cond) && send3 == id3) && p3_new == nomsg) && \result <= 1) && st3 == 0) && nomsg == p2_\old) && !(id3 == id2)) && 1 <= \old(cond)) && i2 == 0) && mode1 == 1) && id1 <= 127) && st1 == 0) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 == 0) && p2_new + 1 <= 0) && 1 <= \result) && id3 <= 127) && 0 <= id2) && #NULL == 0) && st2 == 0) && p3_\old == nomsg) && id2 <= 127) && \old(cond) <= 1) && p3 == 0) && r1 % 256 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && cond <= 1) && send2 == id2) && #NULL == 0) [2022-11-25 23:49:32,284 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && 1 <= tmp) && 0 <= id1) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && !(id3 == id2)) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && i2 == 0) && 0 <= p2) && c1 <= 1) && id1 <= 127) && nomsg == p2_new) && nomsg == p1_\old) && ((((((!(id3 == send2 % 256) || st3 == 1) && send2 % 256 <= id3) || nomsg == p2_\old) || (send3 == send2 % 256 && id3 < send3)) || mode3 == 0) || !(send2 % 256 <= 127))) && nomsg + 1 == 0) && 1 <= \result) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || ((((mode2 == 1 && (\exists v_~p2_new~0_44 : int :: ((if (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256 <= 127 then (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256 else -256 + (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256) == p2_\old && v_~p2_new~0_44 + 1 <= 0) && 0 <= v_~p2_new~0_44 + 1)) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && p2 <= 0) && id2 <= 127) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && cond <= 1) && (((((mode3 == 1 && nomsg == m3) && (\exists v_~p3_new~0_44 : int :: (0 <= v_~p3_new~0_44 + 1 && p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256)) && v_~p3_new~0_44 + 1 <= 0)) && 0 <= st3) && 0 <= send3) || (((0 <= p3_\old + 1 && (((!(id3 < m3) && (st3 == 1 || (0 <= st3 && !(id3 == m3)))) && 0 <= send3) || ((id3 < m3 && send3 == m3) && 0 <= st3))) && p3_\old + 1 <= 0) && mode3 == 0))) && #NULL == 0) || ((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && nomsg == p1_new) && ((((mode3 == 1 || mode2 == 1) || ((!(id3 == send2 % 256) || st3 == 1) && send2 % 256 <= id3)) || (send3 == send2 % 256 && id3 < send3)) || !(send2 % 256 <= 127))) && 1 <= tmp) && 0 <= id1) && p2 == 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && !(id3 == id2)) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && i2 == 0) && mode1 == 1) && id1 <= 127) && nomsg == p2_new) && nomsg + 1 == 0) && 1 <= \result) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || ((((mode2 == 1 && (\exists v_~p2_new~0_44 : int :: ((if (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256 <= 127 then (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256 else -256 + (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256) == p2_\old && v_~p2_new~0_44 + 1 <= 0) && 0 <= v_~p2_new~0_44 + 1)) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && id3 <= 127) && 0 <= id2) && #NULL == 0) && id2 <= 127) && \old(cond) <= 1) && p3 == 0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && cond <= 1) && (((((mode3 == 1 && nomsg == m3) && (\exists v_~p3_new~0_44 : int :: (0 <= v_~p3_new~0_44 + 1 && p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256)) && v_~p3_new~0_44 + 1 <= 0)) && 0 <= st3) && 0 <= send3) || (((0 <= p3_\old + 1 && (((!(id3 < m3) && (st3 == 1 || (0 <= st3 && !(id3 == m3)))) && 0 <= send3) || ((id3 < m3 && send3 == m3) && 0 <= st3))) && p3_\old + 1 <= 0) && mode3 == 0))) && #NULL == 0) [2022-11-25 23:49:32,285 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((nomsg == p1_new && tmp == 0) && st2 + st1 <= 2147483647) && mode1 == 1) && st3 + st2 + st1 <= 2147483647) || (((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && 1 <= tmp) && 0 <= id1) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && !(id3 == id2)) && (((tmp == 0 && p2 == 0) && i2 == 0) || ((tmp == 1 && p2 == 0) && i2 == 0))) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && c1 <= 1) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && ((((((!(id3 == send2 % 256) || st3 == 1) && send2 % 256 <= id3) || nomsg == p2_\old) || (send3 == send2 % 256 && id3 < send3)) || mode3 == 0) || !(send2 % 256 <= 127))) && nomsg + 1 == 0) && p2_new + 1 <= 0) && 1 <= \result) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || ((((mode2 == 1 && (\exists v_~p2_new~0_44 : int :: ((if (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256 <= 127 then (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256 else -256 + (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256) == p2_\old && v_~p2_new~0_44 + 1 <= 0) && 0 <= v_~p2_new~0_44 + 1)) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && id2 <= 127) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && cond <= 1) && (((((mode3 == 1 && nomsg == m3) && (\exists v_~p3_new~0_44 : int :: (0 <= v_~p3_new~0_44 + 1 && p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256)) && v_~p3_new~0_44 + 1 <= 0)) && 0 <= st3) && 0 <= send3) || (((0 <= p3_\old + 1 && (((!(id3 < m3) && (st3 == 1 || (0 <= st3 && !(id3 == m3)))) && 0 <= send3) || ((id3 < m3 && send3 == m3) && 0 <= st3))) && p3_\old + 1 <= 0) && mode3 == 0))) && #NULL == 0)) || (tmp == 0 && mode1 == 0)) || ((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && ((((mode3 == 1 || mode2 == 1) || ((!(id3 == send2 % 256) || st3 == 1) && send2 % 256 <= id3)) || (send3 == send2 % 256 && id3 < send3)) || !(send2 % 256 <= 127))) && 1 <= tmp) && 0 <= id1) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && !(id3 == id2)) && (((tmp == 0 && p2 == 0) && i2 == 0) || ((tmp == 1 && p2 == 0) && i2 == 0))) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || ((((mode2 == 1 && (\exists v_~p2_new~0_44 : int :: ((if (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256 <= 127 then (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256 else -256 + (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256) == p2_\old && v_~p2_new~0_44 + 1 <= 0) && 0 <= v_~p2_new~0_44 + 1)) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && cond <= 1) && (((((mode3 == 1 && nomsg == m3) && (\exists v_~p3_new~0_44 : int :: (0 <= v_~p3_new~0_44 + 1 && p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256)) && v_~p3_new~0_44 + 1 <= 0)) && 0 <= st3) && 0 <= send3) || (((0 <= p3_\old + 1 && (((!(id3 < m3) && (st3 == 1 || (0 <= st3 && !(id3 == m3)))) && 0 <= send3) || ((id3 < m3 && send3 == m3) && 0 <= st3))) && p3_\old + 1 <= 0) && mode3 == 0))) && #NULL == 0) [2022-11-25 23:49:32,307 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-25 23:49:32,308 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 23:49:32,308 INFO L158 Benchmark]: Toolchain (without parser) took 200053.39ms. Allocated memory was 142.6MB in the beginning and 627.0MB in the end (delta: 484.4MB). Free memory was 98.6MB in the beginning and 211.5MB in the end (delta: -112.9MB). Peak memory consumption was 373.6MB. Max. memory is 16.1GB. [2022-11-25 23:49:32,309 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 142.6MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:49:32,309 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.25ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 85.5MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 23:49:32,309 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.50ms. Allocated memory is still 142.6MB. Free memory was 85.5MB in the beginning and 83.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:49:32,309 INFO L158 Benchmark]: Boogie Preprocessor took 39.88ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 81.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:49:32,310 INFO L158 Benchmark]: RCFGBuilder took 924.13ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 82.2MB in the end (delta: -356.4kB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2022-11-25 23:49:32,310 INFO L158 Benchmark]: TraceAbstraction took 198666.79ms. Allocated memory was 142.6MB in the beginning and 627.0MB in the end (delta: 484.4MB). Free memory was 81.4MB in the beginning and 216.8MB in the end (delta: -135.3MB). Peak memory consumption was 357.3MB. Max. memory is 16.1GB. [2022-11-25 23:49:32,311 INFO L158 Benchmark]: Witness Printer took 69.73ms. Allocated memory is still 627.0MB. Free memory was 216.8MB in the beginning and 211.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 23:49:32,312 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.27ms. Allocated memory is still 142.6MB. Free memory is still 95.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.25ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 85.5MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.50ms. Allocated memory is still 142.6MB. Free memory was 85.5MB in the beginning and 83.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.88ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 81.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 924.13ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 82.2MB in the end (delta: -356.4kB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * TraceAbstraction took 198666.79ms. Allocated memory was 142.6MB in the beginning and 627.0MB in the end (delta: 484.4MB). Free memory was 81.4MB in the beginning and 216.8MB in the end (delta: -135.3MB). Peak memory consumption was 357.3MB. Max. memory is 16.1GB. * Witness Printer took 69.73ms. Allocated memory is still 627.0MB. Free memory was 216.8MB in the beginning and 211.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 210]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 210]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 210]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 210]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 214]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 214]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 214]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 214]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 219]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 219]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 219]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 219]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 198.5s, OverallIterations: 20, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 26.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 26.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1745 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1745 mSDsluCounter, 1036 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 642 mSDsCounter, 226 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3474 IncrementalHoareTripleChecker+Invalid, 3700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 226 mSolverCounterUnsat, 394 mSDtfsCounter, 3474 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1120 GetRequests, 753 SyntacticMatches, 66 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6233 ImplicationChecksByTransitivity, 68.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=277occurred in iteration=18, InterpolantAutomatonStates: 158, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 398 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 60 NumberOfFragments, 3131 HoareAnnotationTreeSize, 5 FomulaSimplifications, 864590 FormulaSimplificationTreeSizeReduction, 6.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 94007 FormulaSimplificationTreeSizeReductionInter, 20.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 60.7s InterpolantComputationTime, 892 NumberOfCodeBlocks, 874 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1184 ConstructedInterpolants, 0 QuantifiedInterpolants, 41887 SizeOfPredicates, 223 NumberOfNonLiveVariables, 1807 ConjunctsInSsa, 176 ConjunctsInUnsatCore, 35 InterpolantComputations, 15 PerfectInterpolantSequences, 813/1446 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: 16.8s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 61, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 180, TOOLS_POST_TIME: 15.1s, 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: 180, TOOLS_QUANTIFIERELIM_TIME: 15.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.4s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 246, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 26, DOMAIN_JOIN_TIME: 1.1s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 4, DOMAIN_WIDEN_TIME: 0.2s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 6, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 61, DOMAIN_ISBOTTOM_TIME: 0.2s, LOOP_SUMMARIZER_APPLICATIONS: 2, LOOP_SUMMARIZER_CACHE_MISSES: 2, LOOP_SUMMARIZER_OVERALL_TIME: 12.5s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 12.5s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 6, 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.0s, DAG_COMPRESSION_PROCESSED_NODES: 1323, DAG_COMPRESSION_RETAINED_NODES: 150, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 210]: Loop Invariant [2022-11-25 23:49:32,342 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,343 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,343 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,343 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,343 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,344 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,344 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,344 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,345 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,345 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,345 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,345 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,345 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,345 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,346 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,346 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,350 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,351 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,351 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,351 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,351 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,352 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,352 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,352 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,352 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,353 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,353 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,353 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,353 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,353 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,353 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,354 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,356 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,356 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,356 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,357 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,357 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,357 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,357 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,357 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,358 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,358 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,358 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,358 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,359 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,359 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,359 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,359 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,359 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,360 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,360 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,360 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,360 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,361 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,361 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,361 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,361 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,362 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,362 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,362 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,362 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,362 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,363 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,363 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] Derived loop invariant: ((((((nomsg == p1_new && tmp == 0) && st2 + st1 <= 2147483647) && mode1 == 1) && st3 + st2 + st1 <= 2147483647) || (((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && 1 <= tmp) && 0 <= id1) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && !(id3 == id2)) && (((tmp == 0 && p2 == 0) && i2 == 0) || ((tmp == 1 && p2 == 0) && i2 == 0))) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && c1 <= 1) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && ((((((!(id3 == send2 % 256) || st3 == 1) && send2 % 256 <= id3) || nomsg == p2_\old) || (send3 == send2 % 256 && id3 < send3)) || mode3 == 0) || !(send2 % 256 <= 127))) && nomsg + 1 == 0) && p2_new + 1 <= 0) && 1 <= \result) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || ((((mode2 == 1 && (\exists v_~p2_new~0_44 : int :: ((if (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256 <= 127 then (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256 else -256 + (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256) == p2_\old && v_~p2_new~0_44 + 1 <= 0) && 0 <= v_~p2_new~0_44 + 1)) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && id2 <= 127) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && cond <= 1) && (((((mode3 == 1 && nomsg == m3) && (\exists v_~p3_new~0_44 : int :: (0 <= v_~p3_new~0_44 + 1 && p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256)) && v_~p3_new~0_44 + 1 <= 0)) && 0 <= st3) && 0 <= send3) || (((0 <= p3_\old + 1 && (((!(id3 < m3) && (st3 == 1 || (0 <= st3 && !(id3 == m3)))) && 0 <= send3) || ((id3 < m3 && send3 == m3) && 0 <= st3))) && p3_\old + 1 <= 0) && mode3 == 0))) && #NULL == 0)) || (tmp == 0 && mode1 == 0)) || ((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && ((((mode3 == 1 || mode2 == 1) || ((!(id3 == send2 % 256) || st3 == 1) && send2 % 256 <= id3)) || (send3 == send2 % 256 && id3 < send3)) || !(send2 % 256 <= 127))) && 1 <= tmp) && 0 <= id1) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && !(id3 == id2)) && (((tmp == 0 && p2 == 0) && i2 == 0) || ((tmp == 1 && p2 == 0) && i2 == 0))) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || ((((mode2 == 1 && (\exists v_~p2_new~0_44 : int :: ((if (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256 <= 127 then (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256 else -256 + (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256) == p2_\old && v_~p2_new~0_44 + 1 <= 0) && 0 <= v_~p2_new~0_44 + 1)) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && cond <= 1) && (((((mode3 == 1 && nomsg == m3) && (\exists v_~p3_new~0_44 : int :: (0 <= v_~p3_new~0_44 + 1 && p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256)) && v_~p3_new~0_44 + 1 <= 0)) && 0 <= st3) && 0 <= send3) || (((0 <= p3_\old + 1 && (((!(id3 < m3) && (st3 == 1 || (0 <= st3 && !(id3 == m3)))) && 0 <= send3) || ((id3 < m3 && send3 == m3) && 0 <= st3))) && p3_\old + 1 <= 0) && mode3 == 0))) && #NULL == 0) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 262]: Loop Invariant [2022-11-25 23:49:32,365 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,365 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,366 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,366 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,366 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,366 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,367 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,367 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,367 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,367 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,367 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,368 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,368 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,368 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,368 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,368 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,369 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,369 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,369 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,369 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,370 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,370 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,370 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,370 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,370 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,371 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,371 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,371 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,371 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,371 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,372 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,372 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,374 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,374 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,374 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,375 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,375 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,375 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,375 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,376 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,376 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,376 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,376 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,376 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,377 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,377 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,377 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,377 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,377 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,378 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,378 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,378 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,378 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,379 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,379 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,379 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,379 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,380 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,380 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,380 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,380 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,380 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,380 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,381 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && ((((mode3 == 1 || mode2 == 1) || ((!(id3 == send2 % 256) || st3 == 1) && send2 % 256 <= id3)) || (send3 == send2 % 256 && id3 < send3)) || !(send2 % 256 <= 127))) && 1 <= tmp) && 0 <= id1) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && !(id3 == id2)) && (((tmp == 0 && p2 == 0) && i2 == 0) || ((tmp == 1 && p2 == 0) && i2 == 0))) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && c1 <= 1) && mode1 == 1) && id1 <= 127) && nomsg == p2_new) && nomsg + 1 == 0) && 1 <= \result) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || ((((mode2 == 1 && (\exists v_~p2_new~0_44 : int :: ((if (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256 <= 127 then (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256 else -256 + (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256) == p2_\old && v_~p2_new~0_44 + 1 <= 0) && 0 <= v_~p2_new~0_44 + 1)) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && id3 <= 127) && 0 <= id2) && #NULL == 0) && id2 <= 127) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && cond <= 1) && (((((mode3 == 1 && nomsg == m3) && (\exists v_~p3_new~0_44 : int :: (0 <= v_~p3_new~0_44 + 1 && p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256)) && v_~p3_new~0_44 + 1 <= 0)) && 0 <= st3) && 0 <= send3) || (((0 <= p3_\old + 1 && (((!(id3 < m3) && (st3 == 1 || (0 <= st3 && !(id3 == m3)))) && 0 <= send3) || ((id3 < m3 && send3 == m3) && 0 <= st3))) && p3_\old + 1 <= 0) && mode3 == 0))) && #NULL == 0) || (((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && 1 <= tmp) && 0 <= id1) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && !(id3 == id2)) && (((tmp == 0 && p2 == 0) && i2 == 0) || ((tmp == 1 && p2 == 0) && i2 == 0))) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && c1 <= 1) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && ((((((!(id3 == send2 % 256) || st3 == 1) && send2 % 256 <= id3) || nomsg == p2_\old) || (send3 == send2 % 256 && id3 < send3)) || mode3 == 0) || !(send2 % 256 <= 127))) && nomsg + 1 == 0) && p2_new + 1 <= 0) && 1 <= \result) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || ((((mode2 == 1 && (\exists v_~p2_new~0_44 : int :: ((if (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256 <= 127 then (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256 else -256 + (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256) == p2_\old && v_~p2_new~0_44 + 1 <= 0) && 0 <= v_~p2_new~0_44 + 1)) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && id2 <= 127) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && cond <= 1) && (((((mode3 == 1 && nomsg == m3) && (\exists v_~p3_new~0_44 : int :: (0 <= v_~p3_new~0_44 + 1 && p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256)) && v_~p3_new~0_44 + 1 <= 0)) && 0 <= st3) && 0 <= send3) || (((0 <= p3_\old + 1 && (((!(id3 < m3) && (st3 == 1 || (0 <= st3 && !(id3 == m3)))) && 0 <= send3) || ((id3 < m3 && send3 == m3) && 0 <= st3))) && p3_\old + 1 <= 0) && mode3 == 0))) && #NULL == 0)) || (((((((((((((((((((((((((((((((((((((((((0 <= c1 && 1 <= tmp) && mode3 % 256 == 0) && 0 <= id1) && mode2 % 256 == 0) && p2 == 0) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && send3 == id3) && p3_new == nomsg) && \result <= 1) && st3 == 0) && nomsg == p2_\old) && !(id3 == id2)) && mode1 % 256 == 0) && 1 <= \old(cond)) && i2 == 0) && c1 <= 1) && id1 <= 127) && st1 == 0) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 == 0) && p2_new + 1 <= 0) && 1 <= \result) && id3 <= 127) && 0 <= id2) && #NULL == 0) && st2 == 0) && p3_\old == nomsg) && id2 <= 127) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && r1 % 256 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && cond <= 1) && send2 == id2) && #NULL == 0) - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && 0 <= p3_new + 1) && 1 <= tmp) && st2 <= 1) && 0 <= id1) && p1_new + 1 <= 0) && (((((mode2 == 0 && send3 == send2 % 256) && id3 < send3) || (mode3 == 1 && mode2 == 0)) || (mode2 == 1 && (((p2_\old < 0 && 257 + 256 * ((-129 + -p2_\old) / 256) + p2_\old <= 0) && 0 <= 256 + p2_\old) || ((p2_\old < 256 && p2_\old % 256 <= 127) && 0 <= p2_\old)))) || (mode2 == 0 && (((!(id3 == send2 % 256) || st3 == 1) && send2 % 256 <= id3) || !(send2 % 256 <= 127))))) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && \result <= 1) && !(id3 == id2)) && 1 <= \old(cond)) && 0 <= st1) && 0 <= st2) && mode3 <= 1) && c1 <= 1) && 0 <= send2) && id1 <= 127) && st1 <= 1) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && id3 <= 127) && st3 <= 1) && 0 <= id2) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && (((((tmp == 0 && p2 == 0) && i2 == 0) && #NULL == 0) && p1 == 0) || ((((tmp == 1 && p2 == 0) && i2 == 0) && #NULL == 0) && p1 == 0))) && 0 <= send3) && 0 <= unknown-#StackHeapBarrier-unknown) && cond <= 1) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && 0 <= p3_new + 1) && 1 <= tmp) && 0 <= id1) && p2 == 0) && tmp <= 1) && 1 <= cond) && \result <= 1) && !(id3 == id2)) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && i2 == 0) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 == 0) && p2_new + 1 <= 0) && 1 <= \result) && id3 <= 127) && 0 <= id2) && #NULL == 0) && (((mode2 == 0 && (mode3 == 1 || mode3 == 0)) && nomsg == p2_\old) || ((mode2 == 1 && ((mode3 == 1 && ((((!(id3 == send2 % 256) || st3 == 1) && send2 % 256 <= id3) || (send3 == send2 % 256 && id3 < send3)) || !(send2 % 256 <= 127))) || mode3 == 0)) && ((send2 % 256 <= 127 && send2 % 256 == p2_\old) || (send2 % 256 == 256 + p2_\old && !(send2 % 256 <= 127)))))) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && cond <= 1) && #NULL == 0)) || ((((((((((((((((((((((((((((((((((((((0 <= c1 && 1 <= tmp) && mode3 % 256 == 0) && 0 <= id1) && mode2 % 256 == 0) && p2 == 0) && tmp <= 1) && 1 <= cond) && send3 == id3) && p3_new == nomsg) && \result <= 1) && st3 == 0) && nomsg == p2_\old) && !(id3 == id2)) && 1 <= \old(cond)) && i2 == 0) && mode1 == 1) && id1 <= 127) && st1 == 0) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 == 0) && p2_new + 1 <= 0) && 1 <= \result) && id3 <= 127) && 0 <= id2) && #NULL == 0) && st2 == 0) && p3_\old == nomsg) && id2 <= 127) && \old(cond) <= 1) && p3 == 0) && r1 % 256 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && cond <= 1) && send2 == id2) && #NULL == 0) - InvariantResult [Line: 211]: Loop Invariant [2022-11-25 23:49:32,386 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,386 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,386 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,387 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,387 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,387 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,387 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,388 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,388 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,388 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,388 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,388 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,389 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,389 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,389 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,389 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,389 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,390 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,390 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,390 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,390 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,391 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,391 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,391 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,391 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,391 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,392 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,392 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,392 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,392 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,392 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,392 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,394 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,395 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,395 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,395 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,395 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,395 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,396 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,396 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,396 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,396 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,397 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,397 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,397 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,397 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,397 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,397 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,398 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,398 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,398 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,398 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,399 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,399 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,399 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,399 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p2_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,400 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,400 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,400 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,400 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,400 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,401 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,401 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] [2022-11-25 23:49:32,401 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~p3_new~0_44,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && 1 <= tmp) && 0 <= id1) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && !(id3 == id2)) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && i2 == 0) && 0 <= p2) && c1 <= 1) && id1 <= 127) && nomsg == p2_new) && nomsg == p1_\old) && ((((((!(id3 == send2 % 256) || st3 == 1) && send2 % 256 <= id3) || nomsg == p2_\old) || (send3 == send2 % 256 && id3 < send3)) || mode3 == 0) || !(send2 % 256 <= 127))) && nomsg + 1 == 0) && 1 <= \result) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || ((((mode2 == 1 && (\exists v_~p2_new~0_44 : int :: ((if (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256 <= 127 then (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256 else -256 + (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256) == p2_\old && v_~p2_new~0_44 + 1 <= 0) && 0 <= v_~p2_new~0_44 + 1)) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && p2 <= 0) && id2 <= 127) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && cond <= 1) && (((((mode3 == 1 && nomsg == m3) && (\exists v_~p3_new~0_44 : int :: (0 <= v_~p3_new~0_44 + 1 && p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256)) && v_~p3_new~0_44 + 1 <= 0)) && 0 <= st3) && 0 <= send3) || (((0 <= p3_\old + 1 && (((!(id3 < m3) && (st3 == 1 || (0 <= st3 && !(id3 == m3)))) && 0 <= send3) || ((id3 < m3 && send3 == m3) && 0 <= st3))) && p3_\old + 1 <= 0) && mode3 == 0))) && #NULL == 0) || ((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && nomsg == p1_new) && ((((mode3 == 1 || mode2 == 1) || ((!(id3 == send2 % 256) || st3 == 1) && send2 % 256 <= id3)) || (send3 == send2 % 256 && id3 < send3)) || !(send2 % 256 <= 127))) && 1 <= tmp) && 0 <= id1) && p2 == 0) && tmp <= 1) && 1 <= cond) && p3_new == nomsg) && \result <= 1) && !(id3 == id2)) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && i2 == 0) && mode1 == 1) && id1 <= 127) && nomsg == p2_new) && nomsg + 1 == 0) && 1 <= \result) && ((((mode2 == 0 && 0 <= p2_\old + 1) && (((0 <= st2 && send2 == m2) && id2 < m2) || ((0 <= send2 && (st2 == 1 || (!(m2 == id2) && 0 <= st2))) && !(id2 < m2)))) && p2_\old + 1 <= 0) || ((((mode2 == 1 && (\exists v_~p2_new~0_44 : int :: ((if (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256 <= 127 then (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256 else -256 + (if v_~p2_new~0_44 == nomsg && !(send2 == nomsg) then send2 else v_~p2_new~0_44) % 256) == p2_\old && v_~p2_new~0_44 + 1 <= 0) && 0 <= v_~p2_new~0_44 + 1)) && 0 <= st2) && 0 <= send2) && nomsg == m2))) && id3 <= 127) && 0 <= id2) && #NULL == 0) && id2 <= 127) && \old(cond) <= 1) && p3 == 0) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && cond <= 1) && (((((mode3 == 1 && nomsg == m3) && (\exists v_~p3_new~0_44 : int :: (0 <= v_~p3_new~0_44 + 1 && p3_\old == (if (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256 <= 127 then (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256 else -256 + (if !(send3 == nomsg) && v_~p3_new~0_44 == nomsg then send3 else v_~p3_new~0_44) % 256)) && v_~p3_new~0_44 + 1 <= 0)) && 0 <= st3) && 0 <= send3) || (((0 <= p3_\old + 1 && (((!(id3 < m3) && (st3 == 1 || (0 <= st3 && !(id3 == m3)))) && 0 <= send3) || ((id3 < m3 && send3 == m3) && 0 <= st3))) && p3_\old + 1 <= 0) && mode3 == 0))) && #NULL == 0) RESULT: Ultimate proved your program to be correct! [2022-11-25 23:49:32,446 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14afd7fb-ea4b-4e08-be6e-77beedb02fc1/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