./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 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_5438cf8d-93fd-42b2-ad72-5ed43f7e3c81/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5438cf8d-93fd-42b2-ad72-5ed43f7e3c81/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5438cf8d-93fd-42b2-ad72-5ed43f7e3c81/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5438cf8d-93fd-42b2-ad72-5ed43f7e3c81/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5438cf8d-93fd-42b2-ad72-5ed43f7e3c81/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5438cf8d-93fd-42b2-ad72-5ed43f7e3c81/bin/utaipan-gh47qXpMRh --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 d33c1f18af8463c39a69fa160e98d9892e84f7d8b10911d6b0c55a462978880c --- 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-2329fc7 [2022-12-14 13:11:47,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 13:11:47,186 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 13:11:47,211 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 13:11:47,212 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 13:11:47,214 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 13:11:47,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 13:11:47,218 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 13:11:47,221 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 13:11:47,222 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 13:11:47,224 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 13:11:47,225 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 13:11:47,226 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 13:11:47,227 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 13:11:47,229 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 13:11:47,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 13:11:47,232 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 13:11:47,233 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 13:11:47,236 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 13:11:47,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 13:11:47,241 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 13:11:47,243 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 13:11:47,245 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 13:11:47,246 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 13:11:47,252 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 13:11:47,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 13:11:47,254 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 13:11:47,255 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 13:11:47,255 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 13:11:47,257 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 13:11:47,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 13:11:47,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 13:11:47,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 13:11:47,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 13:11:47,262 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 13:11:47,262 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 13:11:47,262 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 13:11:47,263 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 13:11:47,263 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 13:11:47,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 13:11:47,264 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 13:11:47,265 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5438cf8d-93fd-42b2-ad72-5ed43f7e3c81/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-12-14 13:11:47,283 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 13:11:47,283 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 13:11:47,283 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 13:11:47,283 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 13:11:47,284 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 13:11:47,284 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 13:11:47,284 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 13:11:47,284 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 13:11:47,284 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 13:11:47,284 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 13:11:47,284 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 13:11:47,284 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 13:11:47,285 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 13:11:47,285 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 13:11:47,285 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 13:11:47,285 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 13:11:47,285 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 13:11:47,285 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 13:11:47,286 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 13:11:47,286 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 13:11:47,286 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 13:11:47,286 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 13:11:47,286 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 13:11:47,286 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 13:11:47,286 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 13:11:47,286 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 13:11:47,287 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 13:11:47,287 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 13:11:47,287 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 13:11:47,287 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 13:11:47,287 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 13:11:47,287 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 13:11:47,287 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 13:11:47,287 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 13:11:47,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 13:11:47,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 13:11:47,288 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 13:11:47,288 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 13:11:47,288 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 13:11:47,288 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 13:11:47,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 13:11:47,288 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 13:11:47,288 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 13:11:47,289 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_5438cf8d-93fd-42b2-ad72-5ed43f7e3c81/bin/utaipan-gh47qXpMRh/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_5438cf8d-93fd-42b2-ad72-5ed43f7e3c81/bin/utaipan-gh47qXpMRh 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 -> d33c1f18af8463c39a69fa160e98d9892e84f7d8b10911d6b0c55a462978880c [2022-12-14 13:11:47,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 13:11:47,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 13:11:47,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 13:11:47,469 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 13:11:47,469 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 13:11:47,470 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5438cf8d-93fd-42b2-ad72-5ed43f7e3c81/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-12-14 13:11:50,057 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 13:11:50,195 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 13:11:50,196 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5438cf8d-93fd-42b2-ad72-5ed43f7e3c81/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-12-14 13:11:50,203 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5438cf8d-93fd-42b2-ad72-5ed43f7e3c81/bin/utaipan-gh47qXpMRh/data/91f5e519b/7a94536a2f214f9e899ec7f3cd5fbdea/FLAGcd7f30ebb [2022-12-14 13:11:50,216 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5438cf8d-93fd-42b2-ad72-5ed43f7e3c81/bin/utaipan-gh47qXpMRh/data/91f5e519b/7a94536a2f214f9e899ec7f3cd5fbdea [2022-12-14 13:11:50,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 13:11:50,220 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 13:11:50,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 13:11:50,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 13:11:50,224 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 13:11:50,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:11:50" (1/1) ... [2022-12-14 13:11:50,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@179fac94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:50, skipping insertion in model container [2022-12-14 13:11:50,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:11:50" (1/1) ... [2022-12-14 13:11:50,231 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 13:11:50,248 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 13:11:50,375 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_5438cf8d-93fd-42b2-ad72-5ed43f7e3c81/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4107,4120] [2022-12-14 13:11:50,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 13:11:50,395 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 13:11:50,416 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_5438cf8d-93fd-42b2-ad72-5ed43f7e3c81/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4107,4120] [2022-12-14 13:11:50,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 13:11:50,435 INFO L208 MainTranslator]: Completed translation [2022-12-14 13:11:50,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:50 WrapperNode [2022-12-14 13:11:50,435 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 13:11:50,436 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 13:11:50,436 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 13:11:50,436 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 13:11:50,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:50" (1/1) ... [2022-12-14 13:11:50,448 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:50" (1/1) ... [2022-12-14 13:11:50,465 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 281 [2022-12-14 13:11:50,465 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 13:11:50,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 13:11:50,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 13:11:50,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 13:11:50,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:50" (1/1) ... [2022-12-14 13:11:50,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:50" (1/1) ... [2022-12-14 13:11:50,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:50" (1/1) ... [2022-12-14 13:11:50,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:50" (1/1) ... [2022-12-14 13:11:50,478 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:50" (1/1) ... [2022-12-14 13:11:50,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:50" (1/1) ... [2022-12-14 13:11:50,483 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:50" (1/1) ... [2022-12-14 13:11:50,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:50" (1/1) ... [2022-12-14 13:11:50,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 13:11:50,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 13:11:50,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 13:11:50,489 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 13:11:50,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:50" (1/1) ... [2022-12-14 13:11:50,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 13:11:50,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5438cf8d-93fd-42b2-ad72-5ed43f7e3c81/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:11:50,519 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5438cf8d-93fd-42b2-ad72-5ed43f7e3c81/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 13:11:50,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5438cf8d-93fd-42b2-ad72-5ed43f7e3c81/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 13:11:50,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 13:11:50,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 13:11:50,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 13:11:50,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 13:11:50,637 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 13:11:50,638 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 13:11:50,912 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 13:11:50,961 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 13:11:50,961 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-14 13:11:50,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:11:50 BoogieIcfgContainer [2022-12-14 13:11:50,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 13:11:50,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 13:11:50,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 13:11:50,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 13:11:50,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:11:50" (1/3) ... [2022-12-14 13:11:50,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e304c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:11:50, skipping insertion in model container [2022-12-14 13:11:50,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:11:50" (2/3) ... [2022-12-14 13:11:50,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e304c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:11:50, skipping insertion in model container [2022-12-14 13:11:50,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:11:50" (3/3) ... [2022-12-14 13:11:50,971 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2022-12-14 13:11:50,985 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 13:11:50,985 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-12-14 13:11:51,022 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 13:11:51,027 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;@2af0385f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 13:11:51,027 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-12-14 13:11:51,031 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 73 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:11:51,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 13:11:51,036 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:11:51,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:11:51,037 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-12-14 13:11:51,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:11:51,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1190146159, now seen corresponding path program 1 times [2022-12-14 13:11:51,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:11:51,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839709591] [2022-12-14 13:11:51,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:11:51,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:11:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:11:51,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:11:51,225 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:11:51,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839709591] [2022-12-14 13:11:51,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839709591] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:11:51,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:11:51,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 13:11:51,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310514180] [2022-12-14 13:11:51,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:11:51,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 13:11:51,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:11:51,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 13:11:51,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 13:11:51,257 INFO L87 Difference]: Start difference. First operand has 74 states, 58 states have (on average 1.7758620689655173) internal successors, (103), 73 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 21.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:11:51,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:11:51,289 INFO L93 Difference]: Finished difference Result 76 states and 104 transitions. [2022-12-14 13:11:51,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 13:11:51,291 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 21.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 13:11:51,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:11:51,297 INFO L225 Difference]: With dead ends: 76 [2022-12-14 13:11:51,297 INFO L226 Difference]: Without dead ends: 69 [2022-12-14 13:11:51,299 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-12-14 13:11:51,301 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:11:51,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:11:51,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-12-14 13:11:51,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-12-14 13:11:51,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 68 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:11:51,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2022-12-14 13:11:51,326 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 21 [2022-12-14 13:11:51,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:11:51,327 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2022-12-14 13:11:51,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 21.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:11:51,327 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2022-12-14 13:11:51,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 13:11:51,327 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:11:51,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:11:51,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 13:11:51,328 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-12-14 13:11:51,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:11:51,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1628803833, now seen corresponding path program 1 times [2022-12-14 13:11:51,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:11:51,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294505876] [2022-12-14 13:11:51,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:11:51,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:11:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:11:51,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:11:51,406 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:11:51,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294505876] [2022-12-14 13:11:51,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294505876] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:11:51,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:11:51,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:11:51,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277934627] [2022-12-14 13:11:51,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:11:51,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:11:51,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:11:51,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:11:51,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:11:51,410 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:11:51,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:11:51,445 INFO L93 Difference]: Finished difference Result 165 states and 199 transitions. [2022-12-14 13:11:51,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:11:51,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 13:11:51,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:11:51,447 INFO L225 Difference]: With dead ends: 165 [2022-12-14 13:11:51,447 INFO L226 Difference]: Without dead ends: 114 [2022-12-14 13:11:51,447 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-12-14 13:11:51,448 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 58 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:11:51,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 181 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:11:51,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-12-14 13:11:51,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 98. [2022-12-14 13:11:51,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 86 states have (on average 1.4883720930232558) internal successors, (128), 97 states have internal predecessors, (128), 0 states have call successors, (0), 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-12-14 13:11:51,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 128 transitions. [2022-12-14 13:11:51,459 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 128 transitions. Word has length 28 [2022-12-14 13:11:51,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:11:51,459 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 128 transitions. [2022-12-14 13:11:51,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:11:51,460 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 128 transitions. [2022-12-14 13:11:51,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 13:11:51,460 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:11:51,460 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:11:51,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 13:11:51,460 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:11:51,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:11:51,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1333674629, now seen corresponding path program 1 times [2022-12-14 13:11:51,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:11:51,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984460536] [2022-12-14 13:11:51,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:11:51,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:11:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:11:51,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:11:51,522 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:11:51,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984460536] [2022-12-14 13:11:51,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984460536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:11:51,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:11:51,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:11:51,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138923794] [2022-12-14 13:11:51,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:11:51,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:11:51,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:11:51,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:11:51,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:11:51,524 INFO L87 Difference]: Start difference. First operand 98 states and 128 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:11:51,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:11:51,566 INFO L93 Difference]: Finished difference Result 250 states and 336 transitions. [2022-12-14 13:11:51,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:11:51,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 13:11:51,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:11:51,569 INFO L225 Difference]: With dead ends: 250 [2022-12-14 13:11:51,569 INFO L226 Difference]: Without dead ends: 170 [2022-12-14 13:11:51,570 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-12-14 13:11:51,571 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 55 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:11:51,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 178 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:11:51,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-12-14 13:11:51,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 154. [2022-12-14 13:11:51,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 142 states have (on average 1.528169014084507) internal successors, (217), 153 states have internal predecessors, (217), 0 states have call successors, (0), 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-12-14 13:11:51,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 217 transitions. [2022-12-14 13:11:51,589 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 217 transitions. Word has length 29 [2022-12-14 13:11:51,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:11:51,590 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 217 transitions. [2022-12-14 13:11:51,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:11:51,590 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 217 transitions. [2022-12-14 13:11:51,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 13:11:51,590 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:11:51,590 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:11:51,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 13:11:51,591 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:11:51,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:11:51,591 INFO L85 PathProgramCache]: Analyzing trace with hash -2007586470, now seen corresponding path program 1 times [2022-12-14 13:11:51,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:11:51,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525295647] [2022-12-14 13:11:51,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:11:51,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:11:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:11:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:11:51,639 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:11:51,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525295647] [2022-12-14 13:11:51,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525295647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:11:51,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:11:51,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:11:51,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737726806] [2022-12-14 13:11:51,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:11:51,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:11:51,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:11:51,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:11:51,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:11:51,642 INFO L87 Difference]: Start difference. First operand 154 states and 217 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:11:51,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:11:51,696 INFO L93 Difference]: Finished difference Result 410 states and 591 transitions. [2022-12-14 13:11:51,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:11:51,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-14 13:11:51,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:11:51,700 INFO L225 Difference]: With dead ends: 410 [2022-12-14 13:11:51,700 INFO L226 Difference]: Without dead ends: 274 [2022-12-14 13:11:51,702 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-12-14 13:11:51,703 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 50 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:11:51,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 174 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:11:51,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-12-14 13:11:51,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 258. [2022-12-14 13:11:51,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 246 states have (on average 1.548780487804878) internal successors, (381), 257 states have internal predecessors, (381), 0 states have call successors, (0), 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-12-14 13:11:51,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 381 transitions. [2022-12-14 13:11:51,730 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 381 transitions. Word has length 32 [2022-12-14 13:11:51,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:11:51,731 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 381 transitions. [2022-12-14 13:11:51,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:11:51,731 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 381 transitions. [2022-12-14 13:11:51,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-14 13:11:51,731 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:11:51,731 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:11:51,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 13:11:51,732 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-12-14 13:11:51,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:11:51,732 INFO L85 PathProgramCache]: Analyzing trace with hash 62503230, now seen corresponding path program 1 times [2022-12-14 13:11:51,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:11:51,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684521907] [2022-12-14 13:11:51,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:11:51,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:11:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:11:51,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:11:51,807 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:11:51,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684521907] [2022-12-14 13:11:51,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684521907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:11:51,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:11:51,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:11:51,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281644762] [2022-12-14 13:11:51,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:11:51,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:11:51,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:11:51,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:11:51,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:11:51,809 INFO L87 Difference]: Start difference. First operand 258 states and 381 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:11:51,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:11:51,934 INFO L93 Difference]: Finished difference Result 397 states and 586 transitions. [2022-12-14 13:11:51,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 13:11:51,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-12-14 13:11:51,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:11:51,937 INFO L225 Difference]: With dead ends: 397 [2022-12-14 13:11:51,937 INFO L226 Difference]: Without dead ends: 394 [2022-12-14 13:11:51,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:11:51,938 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 172 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:11:51,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 88 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:11:51,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-12-14 13:11:51,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 377. [2022-12-14 13:11:51,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 365 states have (on average 1.5452054794520549) internal successors, (564), 376 states have internal predecessors, (564), 0 states have call successors, (0), 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-12-14 13:11:51,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 564 transitions. [2022-12-14 13:11:51,992 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 564 transitions. Word has length 35 [2022-12-14 13:11:51,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:11:51,992 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 564 transitions. [2022-12-14 13:11:51,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:11:51,993 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 564 transitions. [2022-12-14 13:11:51,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-14 13:11:51,993 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:11:51,994 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:11:51,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 13:11:51,994 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:11:51,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:11:51,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1937600266, now seen corresponding path program 1 times [2022-12-14 13:11:51,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:11:51,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113287462] [2022-12-14 13:11:51,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:11:51,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:11:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:11:52,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:11:52,066 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:11:52,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113287462] [2022-12-14 13:11:52,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113287462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:11:52,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:11:52,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:11:52,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232072346] [2022-12-14 13:11:52,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:11:52,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 13:11:52,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:11:52,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 13:11:52,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 13:11:52,068 INFO L87 Difference]: Start difference. First operand 377 states and 564 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:11:52,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:11:52,222 INFO L93 Difference]: Finished difference Result 482 states and 692 transitions. [2022-12-14 13:11:52,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:11:52,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-12-14 13:11:52,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:11:52,226 INFO L225 Difference]: With dead ends: 482 [2022-12-14 13:11:52,226 INFO L226 Difference]: Without dead ends: 479 [2022-12-14 13:11:52,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:11:52,228 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 163 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:11:52,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 157 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:11:52,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2022-12-14 13:11:52,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 447. [2022-12-14 13:11:52,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 435 states have (on average 1.5333333333333334) internal successors, (667), 446 states have internal predecessors, (667), 0 states have call successors, (0), 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-12-14 13:11:52,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 667 transitions. [2022-12-14 13:11:52,260 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 667 transitions. Word has length 36 [2022-12-14 13:11:52,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:11:52,261 INFO L495 AbstractCegarLoop]: Abstraction has 447 states and 667 transitions. [2022-12-14 13:11:52,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:11:52,261 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 667 transitions. [2022-12-14 13:11:52,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 13:11:52,261 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:11:52,261 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:11:52,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 13:11:52,262 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:11:52,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:11:52,262 INFO L85 PathProgramCache]: Analyzing trace with hash -63933760, now seen corresponding path program 1 times [2022-12-14 13:11:52,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:11:52,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150784536] [2022-12-14 13:11:52,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:11:52,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:11:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:11:52,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:11:52,340 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:11:52,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150784536] [2022-12-14 13:11:52,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150784536] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:11:52,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:11:52,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:11:52,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911290707] [2022-12-14 13:11:52,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:11:52,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:11:52,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:11:52,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:11:52,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:11:52,342 INFO L87 Difference]: Start difference. First operand 447 states and 667 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:11:52,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:11:52,566 INFO L93 Difference]: Finished difference Result 673 states and 968 transitions. [2022-12-14 13:11:52,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 13:11:52,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-12-14 13:11:52,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:11:52,569 INFO L225 Difference]: With dead ends: 673 [2022-12-14 13:11:52,570 INFO L226 Difference]: Without dead ends: 670 [2022-12-14 13:11:52,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 13:11:52,571 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 318 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:11:52,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 180 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:11:52,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-12-14 13:11:52,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 627. [2022-12-14 13:11:52,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 615 states have (on average 1.4991869918699188) internal successors, (922), 626 states have internal predecessors, (922), 0 states have call successors, (0), 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-12-14 13:11:52,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 922 transitions. [2022-12-14 13:11:52,617 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 922 transitions. Word has length 37 [2022-12-14 13:11:52,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:11:52,617 INFO L495 AbstractCegarLoop]: Abstraction has 627 states and 922 transitions. [2022-12-14 13:11:52,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:11:52,618 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 922 transitions. [2022-12-14 13:11:52,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-14 13:11:52,618 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:11:52,618 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:11:52,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 13:11:52,619 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:11:52,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:11:52,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1981946420, now seen corresponding path program 1 times [2022-12-14 13:11:52,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:11:52,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897100947] [2022-12-14 13:11:52,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:11:52,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:11:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:11:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:11:52,671 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:11:52,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897100947] [2022-12-14 13:11:52,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897100947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:11:52,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:11:52,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:11:52,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004347750] [2022-12-14 13:11:52,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:11:52,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:11:52,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:11:52,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:11:52,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:11:52,673 INFO L87 Difference]: Start difference. First operand 627 states and 922 transitions. Second operand has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:11:52,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:11:52,964 INFO L93 Difference]: Finished difference Result 1505 states and 2161 transitions. [2022-12-14 13:11:52,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 13:11:52,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-12-14 13:11:52,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:11:52,966 INFO L225 Difference]: With dead ends: 1505 [2022-12-14 13:11:52,966 INFO L226 Difference]: Without dead ends: 896 [2022-12-14 13:11:52,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-14 13:11:52,968 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 289 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:11:52,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 362 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:11:52,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2022-12-14 13:11:53,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 835. [2022-12-14 13:11:53,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 823 states have (on average 1.4617253948967193) internal successors, (1203), 834 states have internal predecessors, (1203), 0 states have call successors, (0), 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-12-14 13:11:53,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1203 transitions. [2022-12-14 13:11:53,015 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1203 transitions. Word has length 38 [2022-12-14 13:11:53,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:11:53,015 INFO L495 AbstractCegarLoop]: Abstraction has 835 states and 1203 transitions. [2022-12-14 13:11:53,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:11:53,016 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1203 transitions. [2022-12-14 13:11:53,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-14 13:11:53,016 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:11:53,016 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:11:53,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 13:11:53,016 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:11:53,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:11:53,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1551716282, now seen corresponding path program 1 times [2022-12-14 13:11:53,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:11:53,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105555553] [2022-12-14 13:11:53,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:11:53,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:11:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:11:53,063 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:11:53,063 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:11:53,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105555553] [2022-12-14 13:11:53,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105555553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:11:53,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:11:53,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:11:53,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911152908] [2022-12-14 13:11:53,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:11:53,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:11:53,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:11:53,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:11:53,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:11:53,065 INFO L87 Difference]: Start difference. First operand 835 states and 1203 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:11:53,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:11:53,144 INFO L93 Difference]: Finished difference Result 1645 states and 2365 transitions. [2022-12-14 13:11:53,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:11:53,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-12-14 13:11:53,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:11:53,146 INFO L225 Difference]: With dead ends: 1645 [2022-12-14 13:11:53,146 INFO L226 Difference]: Without dead ends: 836 [2022-12-14 13:11:53,147 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-12-14 13:11:53,148 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 29 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:11:53,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 136 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:11:53,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2022-12-14 13:11:53,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 822. [2022-12-14 13:11:53,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 810 states have (on average 1.4419753086419753) internal successors, (1168), 821 states have internal predecessors, (1168), 0 states have call successors, (0), 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-12-14 13:11:53,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1168 transitions. [2022-12-14 13:11:53,196 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1168 transitions. Word has length 53 [2022-12-14 13:11:53,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:11:53,196 INFO L495 AbstractCegarLoop]: Abstraction has 822 states and 1168 transitions. [2022-12-14 13:11:53,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:11:53,196 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1168 transitions. [2022-12-14 13:11:53,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-14 13:11:53,197 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:11:53,197 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:11:53,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 13:11:53,197 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:11:53,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:11:53,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2090750529, now seen corresponding path program 1 times [2022-12-14 13:11:53,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:11:53,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961595984] [2022-12-14 13:11:53,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:11:53,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:11:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:11:53,329 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:11:53,329 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:11:53,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961595984] [2022-12-14 13:11:53,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961595984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:11:53,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:11:53,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 13:11:53,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984903879] [2022-12-14 13:11:53,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:11:53,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:11:53,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:11:53,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:11:53,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:11:53,330 INFO L87 Difference]: Start difference. First operand 822 states and 1168 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:11:53,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:11:53,497 INFO L93 Difference]: Finished difference Result 1632 states and 2316 transitions. [2022-12-14 13:11:53,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:11:53,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-12-14 13:11:53,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:11:53,500 INFO L225 Difference]: With dead ends: 1632 [2022-12-14 13:11:53,500 INFO L226 Difference]: Without dead ends: 836 [2022-12-14 13:11:53,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-14 13:11:53,501 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 76 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:11:53,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 140 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:11:53,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2022-12-14 13:11:53,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 822. [2022-12-14 13:11:53,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 810 states have (on average 1.4382716049382716) internal successors, (1165), 821 states have internal predecessors, (1165), 0 states have call successors, (0), 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-12-14 13:11:53,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1165 transitions. [2022-12-14 13:11:53,557 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1165 transitions. Word has length 57 [2022-12-14 13:11:53,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:11:53,557 INFO L495 AbstractCegarLoop]: Abstraction has 822 states and 1165 transitions. [2022-12-14 13:11:53,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:11:53,558 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1165 transitions. [2022-12-14 13:11:53,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-14 13:11:53,558 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:11:53,558 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:11:53,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 13:11:53,558 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-12-14 13:11:53,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:11:53,559 INFO L85 PathProgramCache]: Analyzing trace with hash 847640831, now seen corresponding path program 1 times [2022-12-14 13:11:53,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:11:53,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124268957] [2022-12-14 13:11:53,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:11:53,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:11:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:11:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 13:11:53,624 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:11:53,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124268957] [2022-12-14 13:11:53,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124268957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:11:53,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:11:53,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:11:53,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912541512] [2022-12-14 13:11:53,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:11:53,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:11:53,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:11:53,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:11:53,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:11:53,626 INFO L87 Difference]: Start difference. First operand 822 states and 1165 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:11:53,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:11:53,731 INFO L93 Difference]: Finished difference Result 1618 states and 2302 transitions. [2022-12-14 13:11:53,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:11:53,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-12-14 13:11:53,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:11:53,733 INFO L225 Difference]: With dead ends: 1618 [2022-12-14 13:11:53,733 INFO L226 Difference]: Without dead ends: 822 [2022-12-14 13:11:53,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:11:53,735 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 187 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:11:53,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 76 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:11:53,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2022-12-14 13:11:53,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 822. [2022-12-14 13:11:53,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 810 states have (on average 1.4234567901234567) internal successors, (1153), 821 states have internal predecessors, (1153), 0 states have call successors, (0), 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-12-14 13:11:53,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1153 transitions. [2022-12-14 13:11:53,811 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1153 transitions. Word has length 58 [2022-12-14 13:11:53,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:11:53,811 INFO L495 AbstractCegarLoop]: Abstraction has 822 states and 1153 transitions. [2022-12-14 13:11:53,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:11:53,812 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1153 transitions. [2022-12-14 13:11:53,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-14 13:11:53,812 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:11:53,812 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:11:53,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 13:11:53,812 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-12-14 13:11:53,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:11:53,813 INFO L85 PathProgramCache]: Analyzing trace with hash -2119941276, now seen corresponding path program 1 times [2022-12-14 13:11:53,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:11:53,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709050945] [2022-12-14 13:11:53,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:11:53,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:11:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:11:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 13:11:53,877 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:11:53,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709050945] [2022-12-14 13:11:53,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709050945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:11:53,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:11:53,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:11:53,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355916366] [2022-12-14 13:11:53,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:11:53,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:11:53,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:11:53,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:11:53,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:11:53,879 INFO L87 Difference]: Start difference. First operand 822 states and 1153 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:11:53,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:11:53,985 INFO L93 Difference]: Finished difference Result 1618 states and 2278 transitions. [2022-12-14 13:11:53,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:11:53,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-12-14 13:11:53,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:11:53,988 INFO L225 Difference]: With dead ends: 1618 [2022-12-14 13:11:53,988 INFO L226 Difference]: Without dead ends: 822 [2022-12-14 13:11:53,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 13:11:53,989 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 197 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:11:53,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 68 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:11:53,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2022-12-14 13:11:54,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 822. [2022-12-14 13:11:54,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 810 states have (on average 1.4012345679012346) internal successors, (1135), 821 states have internal predecessors, (1135), 0 states have call successors, (0), 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-12-14 13:11:54,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1135 transitions. [2022-12-14 13:11:54,051 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1135 transitions. Word has length 58 [2022-12-14 13:11:54,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:11:54,051 INFO L495 AbstractCegarLoop]: Abstraction has 822 states and 1135 transitions. [2022-12-14 13:11:54,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:11:54,051 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1135 transitions. [2022-12-14 13:11:54,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-14 13:11:54,052 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:11:54,052 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:11:54,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 13:11:54,052 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-12-14 13:11:54,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:11:54,052 INFO L85 PathProgramCache]: Analyzing trace with hash -398610401, now seen corresponding path program 1 times [2022-12-14 13:11:54,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:11:54,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806187102] [2022-12-14 13:11:54,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:11:54,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:11:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:11:54,248 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 13:11:54,248 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:11:54,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806187102] [2022-12-14 13:11:54,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806187102] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:11:54,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816623276] [2022-12-14 13:11:54,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:11:54,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:11:54,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5438cf8d-93fd-42b2-ad72-5ed43f7e3c81/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:11:54,250 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5438cf8d-93fd-42b2-ad72-5ed43f7e3c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:11:54,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5438cf8d-93fd-42b2-ad72-5ed43f7e3c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 13:11:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:11:54,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 13:11:54,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:11:54,695 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 13:11:54,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:11:55,107 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 13:11:55,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816623276] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:11:55,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1981996303] [2022-12-14 13:11:55,126 INFO L159 IcfgInterpreter]: Started Sifa with 51 locations of interest [2022-12-14 13:11:55,127 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 13:11:55,130 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 13:11:55,135 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 13:11:55,136 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 13:11:55,418 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 13:11:55,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 13:11:55,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-12-14 13:11:55,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:11:55,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:11:55,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:11:55,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-12-14 13:12:02,703 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 13:12:12,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1981996303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:12:12,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:12:12,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [5, 4, 5] total 52 [2022-12-14 13:12:12,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477977543] [2022-12-14 13:12:12,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:12:12,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-12-14 13:12:12,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:12:12,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-12-14 13:12:12,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=2085, Unknown=0, NotChecked=0, Total=2756 [2022-12-14 13:12:12,634 INFO L87 Difference]: Start difference. First operand 822 states and 1135 transitions. Second operand has 43 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:12:19,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:12:19,038 INFO L93 Difference]: Finished difference Result 2065 states and 2881 transitions. [2022-12-14 13:12:19,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-12-14 13:12:19,038 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-12-14 13:12:19,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:12:19,041 INFO L225 Difference]: With dead ends: 2065 [2022-12-14 13:12:19,041 INFO L226 Difference]: Without dead ends: 1259 [2022-12-14 13:12:19,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 118 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2713 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=1330, Invalid=4990, Unknown=0, NotChecked=0, Total=6320 [2022-12-14 13:12:19,043 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 123 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 1501 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 13:12:19,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 142 Invalid, 1538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1501 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-14 13:12:19,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2022-12-14 13:12:19,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1217. [2022-12-14 13:12:19,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 1205 states have (on average 1.3228215767634854) internal successors, (1594), 1216 states have internal predecessors, (1594), 0 states have call successors, (0), 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-12-14 13:12:19,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1594 transitions. [2022-12-14 13:12:19,186 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1594 transitions. Word has length 58 [2022-12-14 13:12:19,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:12:19,186 INFO L495 AbstractCegarLoop]: Abstraction has 1217 states and 1594 transitions. [2022-12-14 13:12:19,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:12:19,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1594 transitions. [2022-12-14 13:12:19,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-12-14 13:12:19,187 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:12:19,188 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:12:19,194 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5438cf8d-93fd-42b2-ad72-5ed43f7e3c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 13:12:19,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5438cf8d-93fd-42b2-ad72-5ed43f7e3c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 13:12:19,388 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-12-14 13:12:19,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:12:19,389 INFO L85 PathProgramCache]: Analyzing trace with hash -545673620, now seen corresponding path program 1 times [2022-12-14 13:12:19,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:12:19,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164122347] [2022-12-14 13:12:19,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:12:19,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:12:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:12:19,451 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 13:12:19,452 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:12:19,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164122347] [2022-12-14 13:12:19,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164122347] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:12:19,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:12:19,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:12:19,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991814831] [2022-12-14 13:12:19,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:12:19,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:12:19,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:12:19,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:12:19,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:12:19,454 INFO L87 Difference]: Start difference. First operand 1217 states and 1594 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:12:19,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:12:19,620 INFO L93 Difference]: Finished difference Result 2288 states and 2995 transitions. [2022-12-14 13:12:19,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:12:19,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-12-14 13:12:19,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:12:19,626 INFO L225 Difference]: With dead ends: 2288 [2022-12-14 13:12:19,627 INFO L226 Difference]: Without dead ends: 1097 [2022-12-14 13:12:19,629 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-12-14 13:12:19,629 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 29 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:12:19,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 157 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:12:19,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2022-12-14 13:12:19,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 940. [2022-12-14 13:12:19,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 928 states have (on average 1.3200431034482758) internal successors, (1225), 939 states have internal predecessors, (1225), 0 states have call successors, (0), 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-12-14 13:12:19,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1225 transitions. [2022-12-14 13:12:19,758 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1225 transitions. Word has length 81 [2022-12-14 13:12:19,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:12:19,759 INFO L495 AbstractCegarLoop]: Abstraction has 940 states and 1225 transitions. [2022-12-14 13:12:19,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:12:19,759 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1225 transitions. [2022-12-14 13:12:19,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-12-14 13:12:19,759 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:12:19,759 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:12:19,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 13:12:19,760 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-12-14 13:12:19,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:12:19,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1816895466, now seen corresponding path program 2 times [2022-12-14 13:12:19,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:12:19,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628387277] [2022-12-14 13:12:19,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:12:19,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:12:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:12:19,795 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 13:12:19,795 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:12:19,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628387277] [2022-12-14 13:12:19,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628387277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:12:19,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:12:19,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 13:12:19,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41848491] [2022-12-14 13:12:19,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:12:19,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:12:19,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:12:19,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:12:19,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:12:19,797 INFO L87 Difference]: Start difference. First operand 940 states and 1225 transitions. Second operand has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:12:19,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:12:19,999 INFO L93 Difference]: Finished difference Result 941 states and 1225 transitions. [2022-12-14 13:12:20,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:12:20,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-12-14 13:12:20,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:12:20,002 INFO L225 Difference]: With dead ends: 941 [2022-12-14 13:12:20,002 INFO L226 Difference]: Without dead ends: 938 [2022-12-14 13:12:20,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:12:20,003 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 53 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:12:20,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 61 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:12:20,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2022-12-14 13:12:20,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 938. [2022-12-14 13:12:20,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 928 states have (on average 1.3017241379310345) internal successors, (1208), 937 states have internal predecessors, (1208), 0 states have call successors, (0), 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-12-14 13:12:20,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1208 transitions. [2022-12-14 13:12:20,119 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1208 transitions. Word has length 81 [2022-12-14 13:12:20,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:12:20,119 INFO L495 AbstractCegarLoop]: Abstraction has 938 states and 1208 transitions. [2022-12-14 13:12:20,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:12:20,119 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1208 transitions. [2022-12-14 13:12:20,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-12-14 13:12:20,120 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:12:20,120 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:12:20,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 13:12:20,120 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-12-14 13:12:20,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:12:20,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1325175212, now seen corresponding path program 3 times [2022-12-14 13:12:20,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:12:20,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504013384] [2022-12-14 13:12:20,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:12:20,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:12:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:12:20,178 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 13:12:20,178 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:12:20,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504013384] [2022-12-14 13:12:20,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504013384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:12:20,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:12:20,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:12:20,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714642205] [2022-12-14 13:12:20,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:12:20,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:12:20,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:12:20,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:12:20,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:12:20,180 INFO L87 Difference]: Start difference. First operand 938 states and 1208 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:12:20,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:12:20,281 INFO L93 Difference]: Finished difference Result 1326 states and 1683 transitions. [2022-12-14 13:12:20,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:12:20,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-12-14 13:12:20,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:12:20,282 INFO L225 Difference]: With dead ends: 1326 [2022-12-14 13:12:20,282 INFO L226 Difference]: Without dead ends: 408 [2022-12-14 13:12:20,283 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-12-14 13:12:20,283 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 23 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:12:20,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 138 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:12:20,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-12-14 13:12:20,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 383. [2022-12-14 13:12:20,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 373 states have (on average 1.2654155495978552) internal successors, (472), 382 states have internal predecessors, (472), 0 states have call successors, (0), 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-12-14 13:12:20,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 472 transitions. [2022-12-14 13:12:20,331 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 472 transitions. Word has length 81 [2022-12-14 13:12:20,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:12:20,331 INFO L495 AbstractCegarLoop]: Abstraction has 383 states and 472 transitions. [2022-12-14 13:12:20,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:12:20,331 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 472 transitions. [2022-12-14 13:12:20,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-12-14 13:12:20,331 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:12:20,331 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:12:20,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 13:12:20,332 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-12-14 13:12:20,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:12:20,332 INFO L85 PathProgramCache]: Analyzing trace with hash -489184462, now seen corresponding path program 1 times [2022-12-14 13:12:20,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:12:20,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903055307] [2022-12-14 13:12:20,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:12:20,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:12:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:12:20,368 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 13:12:20,368 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:12:20,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903055307] [2022-12-14 13:12:20,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903055307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:12:20,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:12:20,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 13:12:20,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870950623] [2022-12-14 13:12:20,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:12:20,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:12:20,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:12:20,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:12:20,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:12:20,370 INFO L87 Difference]: Start difference. First operand 383 states and 472 transitions. Second operand has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:12:20,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:12:20,476 INFO L93 Difference]: Finished difference Result 384 states and 472 transitions. [2022-12-14 13:12:20,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:12:20,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2022-12-14 13:12:20,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:12:20,477 INFO L225 Difference]: With dead ends: 384 [2022-12-14 13:12:20,477 INFO L226 Difference]: Without dead ends: 379 [2022-12-14 13:12:20,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:12:20,478 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 50 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:12:20,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 56 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:12:20,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-12-14 13:12:20,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 377. [2022-12-14 13:12:20,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 369 states have (on average 1.2249322493224932) internal successors, (452), 376 states have internal predecessors, (452), 0 states have call successors, (0), 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-12-14 13:12:20,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 452 transitions. [2022-12-14 13:12:20,533 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 452 transitions. Word has length 82 [2022-12-14 13:12:20,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:12:20,533 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 452 transitions. [2022-12-14 13:12:20,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 36.5) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:12:20,534 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 452 transitions. [2022-12-14 13:12:20,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-12-14 13:12:20,534 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:12:20,534 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:12:20,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 13:12:20,534 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:12:20,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:12:20,535 INFO L85 PathProgramCache]: Analyzing trace with hash 2015151000, now seen corresponding path program 1 times [2022-12-14 13:12:20,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:12:20,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327966172] [2022-12-14 13:12:20,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:12:20,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:12:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:12:20,593 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 13:12:20,593 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:12:20,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327966172] [2022-12-14 13:12:20,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327966172] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:12:20,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:12:20,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:12:20,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558814664] [2022-12-14 13:12:20,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:12:20,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:12:20,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:12:20,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:12:20,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:12:20,594 INFO L87 Difference]: Start difference. First operand 377 states and 452 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:12:20,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:12:20,648 INFO L93 Difference]: Finished difference Result 578 states and 683 transitions. [2022-12-14 13:12:20,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:12:20,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2022-12-14 13:12:20,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:12:20,649 INFO L225 Difference]: With dead ends: 578 [2022-12-14 13:12:20,649 INFO L226 Difference]: Without dead ends: 242 [2022-12-14 13:12:20,649 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-12-14 13:12:20,650 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 13 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:12:20,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 142 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:12:20,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-12-14 13:12:20,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 232. [2022-12-14 13:12:20,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 224 states have (on average 1.1875) internal successors, (266), 231 states have internal predecessors, (266), 0 states have call successors, (0), 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-12-14 13:12:20,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 266 transitions. [2022-12-14 13:12:20,679 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 266 transitions. Word has length 83 [2022-12-14 13:12:20,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:12:20,680 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 266 transitions. [2022-12-14 13:12:20,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:12:20,680 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 266 transitions. [2022-12-14 13:12:20,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-14 13:12:20,680 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:12:20,680 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:12:20,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 13:12:20,680 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:12:20,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:12:20,681 INFO L85 PathProgramCache]: Analyzing trace with hash -412724424, now seen corresponding path program 1 times [2022-12-14 13:12:20,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:12:20,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983476075] [2022-12-14 13:12:20,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:12:20,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:12:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:12:20,715 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-14 13:12:20,715 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:12:20,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983476075] [2022-12-14 13:12:20,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983476075] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:12:20,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:12:20,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 13:12:20,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262684406] [2022-12-14 13:12:20,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:12:20,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:12:20,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:12:20,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:12:20,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:12:20,717 INFO L87 Difference]: Start difference. First operand 232 states and 266 transitions. Second operand has 3 states, 2 states have (on average 38.5) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:12:20,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:12:20,796 INFO L93 Difference]: Finished difference Result 233 states and 266 transitions. [2022-12-14 13:12:20,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:12:20,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 38.5) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2022-12-14 13:12:20,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:12:20,798 INFO L225 Difference]: With dead ends: 233 [2022-12-14 13:12:20,798 INFO L226 Difference]: Without dead ends: 226 [2022-12-14 13:12:20,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:12:20,799 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 43 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:12:20,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 50 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:12:20,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-12-14 13:12:20,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2022-12-14 13:12:20,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 219 states have (on average 1.1643835616438356) internal successors, (255), 224 states have internal predecessors, (255), 0 states have call successors, (0), 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-12-14 13:12:20,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 255 transitions. [2022-12-14 13:12:20,855 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 255 transitions. Word has length 84 [2022-12-14 13:12:20,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:12:20,855 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 255 transitions. [2022-12-14 13:12:20,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 38.5) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:12:20,855 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 255 transitions. [2022-12-14 13:12:20,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-12-14 13:12:20,856 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:12:20,856 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:12:20,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 13:12:20,856 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:12:20,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:12:20,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1016833922, now seen corresponding path program 1 times [2022-12-14 13:12:20,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:12:20,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762166593] [2022-12-14 13:12:20,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:12:20,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:12:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:12:20,894 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 13:12:20,895 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:12:20,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762166593] [2022-12-14 13:12:20,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762166593] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:12:20,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:12:20,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 13:12:20,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943356433] [2022-12-14 13:12:20,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:12:20,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:12:20,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:12:20,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:12:20,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:12:20,896 INFO L87 Difference]: Start difference. First operand 225 states and 255 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:12:20,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:12:20,962 INFO L93 Difference]: Finished difference Result 355 states and 409 transitions. [2022-12-14 13:12:20,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:12:20,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2022-12-14 13:12:20,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:12:20,964 INFO L225 Difference]: With dead ends: 355 [2022-12-14 13:12:20,964 INFO L226 Difference]: Without dead ends: 224 [2022-12-14 13:12:20,964 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-12-14 13:12:20,965 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 4 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:12:20,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 125 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:12:20,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-12-14 13:12:21,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 200. [2022-12-14 13:12:21,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 194 states have (on average 1.1494845360824741) internal successors, (223), 199 states have internal predecessors, (223), 0 states have call successors, (0), 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-12-14 13:12:21,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 223 transitions. [2022-12-14 13:12:21,007 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 223 transitions. Word has length 85 [2022-12-14 13:12:21,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:12:21,007 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 223 transitions. [2022-12-14 13:12:21,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:12:21,007 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 223 transitions. [2022-12-14 13:12:21,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-12-14 13:12:21,008 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:12:21,008 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:12:21,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-14 13:12:21,008 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:12:21,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:12:21,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1316264089, now seen corresponding path program 1 times [2022-12-14 13:12:21,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:12:21,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981099640] [2022-12-14 13:12:21,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:12:21,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:12:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:12:21,059 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 13:12:21,059 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:12:21,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981099640] [2022-12-14 13:12:21,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981099640] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:12:21,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:12:21,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 13:12:21,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915690342] [2022-12-14 13:12:21,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:12:21,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:12:21,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:12:21,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:12:21,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:12:21,061 INFO L87 Difference]: Start difference. First operand 200 states and 223 transitions. Second operand has 3 states, 2 states have (on average 41.5) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:12:21,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:12:21,133 INFO L93 Difference]: Finished difference Result 201 states and 223 transitions. [2022-12-14 13:12:21,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:12:21,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 41.5) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2022-12-14 13:12:21,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:12:21,135 INFO L225 Difference]: With dead ends: 201 [2022-12-14 13:12:21,135 INFO L226 Difference]: Without dead ends: 194 [2022-12-14 13:12:21,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:12:21,135 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 34 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:12:21,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 50 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:12:21,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-12-14 13:12:21,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 164. [2022-12-14 13:12:21,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 160 states have (on average 1.11875) internal successors, (179), 163 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:12:21,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 179 transitions. [2022-12-14 13:12:21,169 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 179 transitions. Word has length 89 [2022-12-14 13:12:21,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:12:21,169 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 179 transitions. [2022-12-14 13:12:21,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 41.5) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:12:21,169 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 179 transitions. [2022-12-14 13:12:21,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-12-14 13:12:21,170 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:12:21,170 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:12:21,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-14 13:12:21,170 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-12-14 13:12:21,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:12:21,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1284876936, now seen corresponding path program 4 times [2022-12-14 13:12:21,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:12:21,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723051246] [2022-12-14 13:12:21,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:12:21,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:12:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:12:21,945 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 13:12:21,945 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:12:21,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723051246] [2022-12-14 13:12:21,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723051246] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:12:21,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829544362] [2022-12-14 13:12:21,946 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 13:12:21,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:12:21,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5438cf8d-93fd-42b2-ad72-5ed43f7e3c81/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:12:21,947 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5438cf8d-93fd-42b2-ad72-5ed43f7e3c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:12:21,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5438cf8d-93fd-42b2-ad72-5ed43f7e3c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 13:12:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:12:22,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 13:12:22,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:12:22,074 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 13:12:22,074 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 13:12:22,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829544362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:12:22,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 13:12:22,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2022-12-14 13:12:22,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125723986] [2022-12-14 13:12:22,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:12:22,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:12:22,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:12:22,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:12:22,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-12-14 13:12:22,076 INFO L87 Difference]: Start difference. First operand 164 states and 179 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:12:22,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:12:22,137 INFO L93 Difference]: Finished difference Result 172 states and 188 transitions. [2022-12-14 13:12:22,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:12:22,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2022-12-14 13:12:22,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:12:22,138 INFO L225 Difference]: With dead ends: 172 [2022-12-14 13:12:22,138 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 13:12:22,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-12-14 13:12:22,139 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 18 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:12:22,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 207 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:12:22,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 13:12:22,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 13:12:22,140 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-12-14 13:12:22,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 13:12:22,140 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 97 [2022-12-14 13:12:22,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:12:22,140 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 13:12:22,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:12:22,141 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 13:12:22,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 13:12:22,143 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-12-14 13:12:22,144 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-12-14 13:12:22,144 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-12-14 13:12:22,144 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-12-14 13:12:22,144 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-12-14 13:12:22,144 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-12-14 13:12:22,144 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-12-14 13:12:22,145 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-12-14 13:12:22,145 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-12-14 13:12:22,145 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-12-14 13:12:22,145 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-12-14 13:12:22,145 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-12-14 13:12:22,145 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-12-14 13:12:22,145 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-12-14 13:12:22,151 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5438cf8d-93fd-42b2-ad72-5ed43f7e3c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 13:12:22,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5438cf8d-93fd-42b2-ad72-5ed43f7e3c81/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-14 13:12:22,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 13:12:30,147 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-12-14 13:12:30,148 INFO L895 garLoopResultBuilder]: At program point L366(lines 363 376) the Hoare annotation is: (let ((.cse1 (+ ~p3_new~0 1)) (.cse13 (+ ~nomsg~0 1)) (.cse35 (+ ~p2_new~0 1)) (.cse34 (+ ~p1_new~0 1))) (let ((.cse0 (<= 0 ~id3~0)) (.cse2 (<= 0 ~id1~0)) (.cse3 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse4 (<= .cse34 0)) (.cse5 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse6 (= (mod ~mode1~0 256) 0)) (.cse7 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse8 (<= 0 ~st2~0)) (.cse9 (<= 0 ~p2~0)) (.cse10 (<= 0 ~send2~0)) (.cse11 (<= ~id1~0 127)) (.cse12 (<= 0 .cse35)) (.cse14 (<= ~__return_1394~0 1)) (.cse15 (<= .cse35 0)) (.cse16 (<= ~id3~0 127)) (.cse17 (<= 0 ~id2~0)) (.cse18 (= |#NULL.offset| 0)) (.cse19 (<= 0 .cse13)) (.cse20 (<= ~p2~0 0)) (.cse21 (<= ~id2~0 127)) (.cse22 (<= 0 ~st3~0)) (.cse23 (<= 1 ~__return_1394~0)) (.cse24 (<= .cse1 0)) (.cse25 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse26 (= ~p3~0 0)) (.cse27 (<= 0 .cse34)) (.cse28 (<= 0 ~send3~0)) (.cse29 (<= 0 |#StackHeapBarrier|)) (.cse30 (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~0#1|)) (.cse31 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse32 (= |#NULL.base| 0)) (.cse33 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (and .cse0 (<= 0 .cse1) .cse2 (<= 0 ~__return_1470~0) .cse3 .cse4 (<= |ULTIMATE.start_main_~main__c1~0#1| 1) (<= .cse5 0) .cse6 .cse7 .cse8 (<= ~p1~0 0) (<= ~__return_main~0 0) .cse9 .cse10 .cse11 .cse12 (<= .cse13 0) (<= ~st2~0 0) .cse14 .cse15 (<= ~r1~0 (* (div ~r1~0 256) 256)) (<= 0 ~__return_main~0) .cse16 .cse17 .cse18 .cse19 (<= 0 (+ ~st2~0 ~st1~0)) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (<= ~__return_1470~0 1) .cse26 .cse27 .cse28 (<= 0 ~p1~0) .cse29 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|) .cse30 .cse31 .cse32 .cse33) (and .cse0 (<= 0 ~mode1~0) (= |ULTIMATE.start_main_~check__tmp~0#1| ~__return_1470~0) .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~main__c1~0#1| ~__return_1470~0) (< (mod ~r1~0 256) 3) (<= 0 ~mode3~0) (= |ULTIMATE.start_main_~check__tmp~0#1| 1) (= ~p3_new~0 ~nomsg~0) (= .cse5 0) .cse6 (<= ~mode2~0 1) (<= 0 ~st1~0) .cse7 .cse8 (<= ~mode3~0 1) .cse9 .cse10 .cse11 .cse12 (<= ~mode1~0 1) (= |ULTIMATE.start_main_~assert__arg~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= 0 ~mode2~0) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (= (ite (= |ULTIMATE.start_main_~main__c1~0#1| 0) 0 1) |ULTIMATE.start_main_~__tmp_1~0#1|) .cse28 (= ~p1~0 0) .cse29 .cse30 (= ~__return_main~0 0) .cse31 .cse32 .cse33)))) [2022-12-14 13:12:30,148 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 280) no Hoare annotation was computed. [2022-12-14 13:12:30,148 INFO L899 garLoopResultBuilder]: For program point L102(lines 102 408) no Hoare annotation was computed. [2022-12-14 13:12:30,148 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 448) no Hoare annotation was computed. [2022-12-14 13:12:30,148 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-12-14 13:12:30,148 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-12-14 13:12:30,148 INFO L899 garLoopResultBuilder]: For program point L104(lines 104 403) no Hoare annotation was computed. [2022-12-14 13:12:30,148 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 443) no Hoare annotation was computed. [2022-12-14 13:12:30,149 INFO L895 garLoopResultBuilder]: At program point L270(lines 267 280) the Hoare annotation is: (let ((.cse0 (<= 0 ~id3~0)) (.cse1 (= ~mode2~0 1)) (.cse2 (<= 0 ~id1~0)) (.cse3 (<= 0 ~__return_1470~0)) (.cse4 (= ~p3_new~0 ~nomsg~0)) (.cse5 (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)) (.cse6 (<= 0 ~st1~0)) (.cse7 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse8 (<= 0 ~st2~0)) (.cse9 (<= 0 ~p2~0)) (.cse10 (<= 0 ~send2~0)) (.cse11 (= ~mode1~0 1)) (.cse12 (<= ~id1~0 127)) (.cse13 (<= ~__return_1394~0 1)) (.cse14 (<= ~id3~0 127)) (.cse15 (<= 0 ~id2~0)) (.cse16 (<= 0 (+ ~nomsg~0 1))) (.cse17 (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~0#1|)) (.cse18 (<= ~p2~0 0)) (.cse19 (= |ULTIMATE.start_main_~node3____CPAchecker_TMP_0~0#1| ~send3~0)) (.cse20 (<= ~id2~0 127)) (.cse21 (<= 0 ~st3~0)) (.cse22 (<= 1 ~__return_1394~0)) (.cse23 (<= (+ ~p3_new~0 1) 0)) (.cse24 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse25 (= ~p3~0 0)) (.cse26 (<= 0 ~send3~0)) (.cse27 (<= 0 |#StackHeapBarrier|)) (.cse28 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse29 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse30 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= 0 ~mode3~0) .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~mode3~0 1) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= |#NULL.offset| 0) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (= ~p1~0 0) .cse27 .cse28 (= ~__return_main~0 0) .cse29 .cse30 (= |ULTIMATE.start_main_~main__i2~0#1| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 |ULTIMATE.start_main_~main__i2~0#1|) (<= |#NULL.offset| 0) .cse6 .cse7 .cse8 (<= ~p1~0 0) (<= ~__return_main~0 0) .cse9 .cse10 .cse11 .cse12 (<= |ULTIMATE.start_main_~main__i2~0#1| 0) .cse13 (<= ~r1~0 (* (div ~r1~0 256) 256)) (<= 0 ~__return_main~0) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (<= 0 |#NULL.offset|) .cse25 .cse26 (<= 0 ~p1~0) .cse27 .cse28 .cse29 .cse30))) [2022-12-14 13:12:30,149 INFO L895 garLoopResultBuilder]: At program point L122(lines 114 384) the Hoare annotation is: (let ((.cse41 (+ ~p3_new~0 1)) (.cse43 (+ ~nomsg~0 1)) (.cse45 (+ ~p2_new~0 1)) (.cse44 (+ ~p1_new~0 1)) (.cse42 (+ ~st3~0 ~st2~0 ~st1~0))) (let ((.cse1 (= |ULTIMATE.start_main_~check__tmp~0#1| ~__return_1470~0)) (.cse4 (= |ULTIMATE.start_main_~main__c1~0#1| ~__return_1470~0)) (.cse5 (< (mod ~r1~0 256) 3)) (.cse6 (= |ULTIMATE.start_main_~check__tmp~0#1| 1)) (.cse7 (= ~p3_new~0 ~nomsg~0)) (.cse8 (= .cse42 0)) (.cse9 (<= 0 ~st1~0)) (.cse15 (= |ULTIMATE.start_main_~assert__arg~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|)) (.cse30 (= (ite (= |ULTIMATE.start_main_~main__c1~0#1| 0) 0 1) |ULTIMATE.start_main_~__tmp_1~0#1|)) (.cse32 (= ~p1~0 0)) (.cse34 (= ~__return_main~0 0)) (.cse0 (<= 0 ~id3~0)) (.cse2 (<= 0 ~id1~0)) (.cse38 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse3 (<= .cse44 0)) (.cse39 (= (* 256 (div ~mode1~0 256)) ~mode1~0)) (.cse40 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse10 (<= 0 ~st2~0)) (.cse11 (<= 0 ~p2~0)) (.cse12 (<= 0 ~send2~0)) (.cse13 (<= ~id1~0 127)) (.cse14 (<= 0 .cse45)) (.cse16 (<= ~__return_1394~0 1)) (.cse17 (<= .cse45 0)) (.cse18 (<= ~id3~0 127)) (.cse19 (<= 0 ~id2~0)) (.cse20 (= |#NULL.offset| 0)) (.cse21 (<= 0 .cse43)) (.cse22 (<= ~p2~0 0)) (.cse23 (<= ~id2~0 127)) (.cse24 (<= 0 ~st3~0)) (.cse25 (<= 1 ~__return_1394~0)) (.cse26 (<= .cse41 0)) (.cse27 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse28 (= ~p3~0 0)) (.cse29 (<= 0 .cse44)) (.cse31 (<= 0 ~send3~0)) (.cse33 (<= 0 |#StackHeapBarrier|)) (.cse35 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse36 (= |#NULL.base| 0)) (.cse37 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (and (= ~mode3~0 1) .cse0 (= ~mode2~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~mode1~0 1) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) (and .cse0 (<= 0 ~mode1~0) .cse1 .cse2 .cse38 .cse3 .cse4 .cse5 (<= 0 ~mode3~0) .cse6 .cse39 .cse7 .cse8 (<= ~mode2~0 1) .cse9 .cse40 .cse10 (<= ~mode3~0 1) .cse11 .cse12 .cse13 .cse14 (<= ~mode1~0 1) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (<= 0 ~mode2~0) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) (and .cse0 (<= 0 .cse41) .cse2 (<= 0 ~__return_1470~0) .cse38 .cse3 (<= |ULTIMATE.start_main_~main__c1~0#1| 1) .cse39 (<= .cse42 0) .cse40 .cse10 (<= ~p1~0 0) (<= ~__return_main~0 0) .cse11 .cse12 .cse13 .cse14 (<= .cse43 0) (<= ~st2~0 0) .cse16 .cse17 (<= ~r1~0 (* (div ~r1~0 256) 256)) (<= 0 ~__return_main~0) .cse18 .cse19 .cse20 .cse21 (<= 0 (+ ~st2~0 ~st1~0)) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (<= ~__return_1470~0 1) .cse28 .cse29 .cse31 (<= 0 ~p1~0) .cse33 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|) .cse35 .cse36 .cse37)))) [2022-12-14 13:12:30,149 INFO L895 garLoopResultBuilder]: At program point L172(lines 161 286) the Hoare annotation is: (let ((.cse27 (+ ~nomsg~0 1))) (let ((.cse0 (<= 0 ~id3~0)) (.cse1 (<= 0 ~id1~0)) (.cse2 (<= 0 ~__return_1470~0)) (.cse3 (= ~p2~0 0)) (.cse4 (<= 0 ~st1~0)) (.cse5 (<= 0 ~st2~0)) (.cse6 (<= 0 ~send2~0)) (.cse7 (<= ~id1~0 127)) (.cse8 (<= .cse27 0)) (.cse9 (<= ~__return_1394~0 1)) (.cse10 (<= ~id3~0 127)) (.cse11 (<= 0 ~id2~0)) (.cse12 (= |#NULL.offset| 0)) (.cse13 (<= 0 .cse27)) (.cse14 (<= ~id2~0 127)) (.cse15 (<= 0 ~st3~0)) (.cse16 (<= 1 ~__return_1394~0)) (.cse17 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse18 (= ~p3~0 0)) (.cse19 (<= 0 ~send3~0)) (.cse20 (= ~p1~0 0)) (.cse21 (<= 0 |#StackHeapBarrier|)) (.cse22 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse23 (= ~__return_main~0 0)) (.cse24 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse25 (= |#NULL.base| 0)) (.cse26 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (and (= ~mode3~0 1) .cse0 (= ~mode2~0 1) .cse1 .cse2 .cse3 (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) .cse4 .cse5 .cse6 (= ~mode1~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 (= ~nomsg~0 ~p1_new~0) (<= ~st2~0 1) .cse1 .cse2 (= (* 256 (div ~mode2~0 256)) ~mode2~0) .cse3 (<= 0 ~mode3~0) (= ~p3_new~0 ~nomsg~0) (<= ~mode2~0 1) .cse4 (= (* 256 (div ~mode3~0 256)) ~mode3~0) .cse5 (<= ~mode3~0 1) .cse6 .cse7 (= ~nomsg~0 ~p2_new~0) (<= ~st1~0 1) .cse8 .cse9 (= ~mode1~0 0) .cse10 (<= ~st3~0 1) .cse11 .cse12 .cse13 (<= 0 ~mode2~0) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26)))) [2022-12-14 13:12:30,149 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 398) no Hoare annotation was computed. [2022-12-14 13:12:30,150 INFO L895 garLoopResultBuilder]: At program point L189(lines 181 241) the Hoare annotation is: (let ((.cse0 (+ ~nomsg~0 1)) (.cse42 (+ ~p2_new~0 1)) (.cse5 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse41 (+ ~p1_new~0 1))) (let ((.cse6 (<= 0 ~id3~0)) (.cse7 (<= 0 ~id1~0)) (.cse8 (<= 0 ~__return_1470~0)) (.cse1 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse9 (<= .cse41 0)) (.cse10 (< (mod ~r1~0 256) 3)) (.cse11 (= |ULTIMATE.start_main_~check__tmp~0#1| 1)) (.cse12 (= ~p3_new~0 ~nomsg~0)) (.cse13 (= .cse5 0)) (.cse2 (<= 0 ~st1~0)) (.cse3 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse14 (<= 0 ~st2~0)) (.cse15 (<= 0 ~p2~0)) (.cse16 (<= 0 ~send2~0)) (.cse17 (<= ~id1~0 127)) (.cse18 (<= 0 .cse42)) (.cse19 (<= ~__return_1394~0 1)) (.cse20 (<= .cse42 0)) (.cse4 (= ~mode1~0 0)) (.cse21 (<= ~id3~0 127)) (.cse22 (<= 0 ~id2~0)) (.cse23 (= |#NULL.offset| 0)) (.cse24 (<= 0 .cse0)) (.cse25 (<= ~p2~0 0)) (.cse26 (<= ~id2~0 127)) (.cse27 (<= 0 ~st3~0)) (.cse28 (<= 1 ~__return_1394~0)) (.cse29 (<= (+ ~p3_new~0 1) 0)) (.cse30 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse31 (= ~p3~0 0)) (.cse32 (<= 0 .cse41)) (.cse33 (<= 0 ~send3~0)) (.cse34 (= ~p1~0 0)) (.cse35 (<= 0 |#StackHeapBarrier|)) (.cse36 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse37 (= ~__return_main~0 0)) (.cse38 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse39 (= |#NULL.base| 0)) (.cse40 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (and (<= .cse0 ~id3~0) (<= .cse0 ~send3~0) (<= .cse0 ~send2~0) .cse1 (= |ULTIMATE.start_main_~check__tmp~0#1| 0) (<= (+ ~st2~0 ~st1~0) 2147483647) .cse2 .cse3 (<= .cse0 ~id2~0) (<= .cse0 0) .cse4 (not (<= (+ 2147483649 ~st3~0 ~st2~0 ~st1~0) 0)) (not (<= (+ 2147483649 ~st2~0 ~st1~0) 0)) (<= .cse5 2147483647)) (and (= ~mode3~0 1) .cse6 (= ~mode2~0 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse2 .cse14 .cse15 .cse16 (= ~mode1~0 1) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40) (and .cse6 .cse7 .cse8 .cse1 .cse9 .cse10 (<= 0 ~mode3~0) .cse11 .cse12 .cse13 (<= ~mode2~0 1) .cse2 .cse3 .cse14 (<= ~mode3~0 1) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse4 .cse21 .cse22 .cse23 .cse24 .cse25 (<= 0 ~mode2~0) .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40)))) [2022-12-14 13:12:30,150 INFO L895 garLoopResultBuilder]: At program point $Ultimate##60(lines 186 222) the Hoare annotation is: (let ((.cse49 (+ ~nomsg~0 1)) (.cse51 (+ ~p2_new~0 1)) (.cse48 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse50 (+ ~p1_new~0 1))) (let ((.cse1 (<= 0 ~id3~0)) (.cse3 (<= 0 ~id1~0)) (.cse4 (<= 0 ~__return_1470~0)) (.cse5 (<= .cse50 0)) (.cse6 (= ~p3_new~0 ~nomsg~0)) (.cse7 (= .cse48 0)) (.cse9 (<= 0 ~st2~0)) (.cse10 (<= 0 ~p2~0)) (.cse11 (<= 0 ~send2~0)) (.cse13 (<= ~id1~0 127)) (.cse14 (<= 0 .cse51)) (.cse15 (<= ~__return_1394~0 1)) (.cse16 (<= .cse51 0)) (.cse17 (<= ~id3~0 127)) (.cse18 (<= 0 ~id2~0)) (.cse19 (= |#NULL.offset| 0)) (.cse20 (<= 0 .cse49)) (.cse21 (<= ~p2~0 0)) (.cse22 (<= ~id2~0 127)) (.cse23 (<= 0 ~st3~0)) (.cse24 (<= 1 ~__return_1394~0)) (.cse25 (<= (+ ~p3_new~0 1) 0)) (.cse26 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse27 (= ~p3~0 0)) (.cse28 (<= 0 .cse50)) (.cse29 (<= 0 ~send3~0)) (.cse30 (= ~p1~0 0)) (.cse31 (<= 0 |#StackHeapBarrier|)) (.cse32 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse33 (= ~__return_main~0 0)) (.cse34 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse35 (= |#NULL.base| 0)) (.cse36 (= |ULTIMATE.start_main_~main__i2~0#1| 0)) (.cse0 (= ~mode3~0 1)) (.cse2 (= ~mode2~0 1)) (.cse12 (= ~mode1~0 1)) (.cse37 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse8 (<= 0 ~st1~0)) (.cse38 (= (* 256 (div ~mode3~0 256)) ~mode3~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36) (and .cse1 .cse3 .cse4 .cse37 .cse5 (<= 0 ~mode3~0) .cse6 .cse7 (<= ~mode2~0 1) .cse8 .cse38 .cse9 (<= ~mode3~0 1) .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 (= ~mode1~0 0) .cse17 .cse18 .cse19 .cse20 .cse21 (<= 0 ~mode2~0) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36) (and (let ((.cse39 (<= .cse49 ~id3~0)) (.cse40 (not (<= ~r1~0 (+ (* (div ~r1~0 256) 256) 2)))) (.cse41 (<= .cse49 ~send3~0)) (.cse42 (<= .cse49 ~send2~0)) (.cse43 (<= (+ ~st2~0 ~st1~0) 2147483647)) (.cse44 (<= .cse49 ~id2~0)) (.cse45 (<= .cse49 0)) (.cse46 (not (<= (+ 2147483649 ~st2~0 ~st1~0) 0))) (.cse47 (<= .cse48 2147483647))) (or (and .cse39 .cse40 .cse41 .cse0 .cse2 .cse42 .cse43 .cse8 .cse12 .cse44 .cse45 .cse46 .cse47) (and .cse39 .cse40 .cse41 .cse42 .cse37 (= (* 256 (div ~mode1~0 256)) ~mode1~0) .cse43 .cse8 .cse38 .cse44 .cse45 .cse46 .cse47))) (not (<= (+ 2147483649 ~st3~0 ~st2~0 ~st1~0) 0)))))) [2022-12-14 13:12:30,150 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 438) no Hoare annotation was computed. [2022-12-14 13:12:30,150 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-12-14 13:12:30,150 INFO L895 garLoopResultBuilder]: At program point L322(lines 310 330) the Hoare annotation is: false [2022-12-14 13:12:30,150 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 13:12:30,150 INFO L895 garLoopResultBuilder]: At program point L157(lines 146 331) the Hoare annotation is: (let ((.cse35 (+ ~nomsg~0 1)) (.cse34 (+ ~p3_new~0 1))) (let ((.cse11 (= |#NULL.offset| 0)) (.cse21 (= ~p1~0 0)) (.cse24 (= ~__return_main~0 0)) (.cse27 (= |ULTIMATE.start_main_~main__i2~0#1| 0)) (.cse0 (<= 0 ~id3~0)) (.cse28 (<= 0 .cse34)) (.cse29 (= ~mode2~0 1)) (.cse1 (<= 0 ~id1~0)) (.cse2 (<= 0 ~__return_1470~0)) (.cse30 (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)) (.cse3 (<= 0 ~st1~0)) (.cse31 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse4 (<= 0 ~st2~0)) (.cse5 (<= 0 ~p2~0)) (.cse6 (<= 0 ~send2~0)) (.cse32 (= ~mode1~0 1)) (.cse7 (<= ~id1~0 127)) (.cse33 (<= .cse35 0)) (.cse8 (<= ~__return_1394~0 1)) (.cse9 (<= ~id3~0 127)) (.cse10 (<= 0 ~id2~0)) (.cse12 (<= 0 .cse35)) (.cse13 (<= ~p2~0 0)) (.cse14 (<= ~id2~0 127)) (.cse15 (<= 0 ~st3~0)) (.cse16 (<= 1 ~__return_1394~0)) (.cse17 (<= .cse34 0)) (.cse18 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse19 (= ~p3~0 0)) (.cse20 (<= 0 ~send3~0)) (.cse22 (<= 0 |#StackHeapBarrier|)) (.cse23 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse25 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse26 (= |#NULL.base| 0))) (or (and (= ~mode3~0 1) .cse0 (= ~nomsg~0 ~p1_new~0) (<= ~st3~0 0) (<= ~st2~0 1) .cse1 .cse2 (= (* 256 (div ~mode2~0 256)) ~mode2~0) (= ~p3_new~0 ~nomsg~0) (<= ~mode2~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 (= ~nomsg~0 ~p2_new~0) (<= ~st1~0 1) .cse8 (= ~mode1~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 (<= 0 ~mode2~0) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse0 .cse28 .cse29 .cse1 .cse2 (<= 0 ~mode3~0) .cse30 .cse3 .cse31 .cse4 (<= ~mode3~0 1) .cse5 .cse6 .cse32 .cse7 .cse33 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse0 .cse28 .cse29 .cse1 .cse2 .cse30 (<= 0 |ULTIMATE.start_main_~main__i2~0#1|) (<= |#NULL.offset| 0) .cse3 .cse31 .cse4 (<= ~p1~0 0) (<= ~__return_main~0 0) .cse5 .cse6 .cse32 .cse7 (<= |ULTIMATE.start_main_~main__i2~0#1| 0) .cse33 .cse8 (<= ~r1~0 (* (div ~r1~0 256) 256)) (<= 0 ~__return_main~0) .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= 0 |#NULL.offset|) .cse19 .cse20 (<= 0 ~p1~0) .cse22 .cse23 .cse25 .cse26)))) [2022-12-14 13:12:30,151 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-12-14 13:12:30,151 INFO L899 garLoopResultBuilder]: For program point L108(lines 108 393) no Hoare annotation was computed. [2022-12-14 13:12:30,151 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-12-14 13:12:30,151 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 433) no Hoare annotation was computed. [2022-12-14 13:12:30,151 INFO L895 garLoopResultBuilder]: At program point L373(lines 361 381) the Hoare annotation is: (let ((.cse1 (+ ~p3_new~0 1)) (.cse13 (+ ~nomsg~0 1)) (.cse35 (+ ~p2_new~0 1)) (.cse34 (+ ~p1_new~0 1))) (let ((.cse0 (<= 0 ~id3~0)) (.cse2 (<= 0 ~id1~0)) (.cse3 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse4 (<= .cse34 0)) (.cse5 (+ ~st3~0 ~st2~0 ~st1~0)) (.cse6 (= (mod ~mode1~0 256) 0)) (.cse7 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse8 (<= 0 ~st2~0)) (.cse9 (<= 0 ~p2~0)) (.cse10 (<= 0 ~send2~0)) (.cse11 (<= ~id1~0 127)) (.cse12 (<= 0 .cse35)) (.cse14 (<= ~__return_1394~0 1)) (.cse15 (<= .cse35 0)) (.cse16 (<= ~id3~0 127)) (.cse17 (<= 0 ~id2~0)) (.cse18 (= |#NULL.offset| 0)) (.cse19 (<= 0 .cse13)) (.cse20 (<= ~p2~0 0)) (.cse21 (<= ~id2~0 127)) (.cse22 (<= 0 ~st3~0)) (.cse23 (<= 1 ~__return_1394~0)) (.cse24 (<= .cse1 0)) (.cse25 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse26 (= ~p3~0 0)) (.cse27 (<= 0 .cse34)) (.cse28 (<= 0 ~send3~0)) (.cse29 (<= 0 |#StackHeapBarrier|)) (.cse30 (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~0#1|)) (.cse31 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse32 (= |#NULL.base| 0)) (.cse33 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (and .cse0 (<= 0 .cse1) .cse2 (<= 0 ~__return_1470~0) .cse3 .cse4 (<= |ULTIMATE.start_main_~main__c1~0#1| 1) (<= .cse5 0) .cse6 .cse7 .cse8 (<= ~p1~0 0) (<= ~__return_main~0 0) .cse9 .cse10 .cse11 .cse12 (<= .cse13 0) (<= ~st2~0 0) .cse14 .cse15 (<= ~r1~0 (* (div ~r1~0 256) 256)) (<= 0 ~__return_main~0) .cse16 .cse17 .cse18 .cse19 (<= 0 (+ ~st2~0 ~st1~0)) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (<= ~__return_1470~0 1) .cse26 .cse27 .cse28 (<= 0 ~p1~0) .cse29 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|) .cse30 .cse31 .cse32 .cse33) (and .cse0 (<= 0 ~mode1~0) (= |ULTIMATE.start_main_~check__tmp~0#1| ~__return_1470~0) .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~main__c1~0#1| ~__return_1470~0) (< (mod ~r1~0 256) 3) (<= 0 ~mode3~0) (= |ULTIMATE.start_main_~check__tmp~0#1| 1) (= ~p3_new~0 ~nomsg~0) (= .cse5 0) .cse6 (<= ~mode2~0 1) (<= 0 ~st1~0) .cse7 .cse8 (<= ~mode3~0 1) .cse9 .cse10 .cse11 .cse12 (<= ~mode1~0 1) (= |ULTIMATE.start_main_~assert__arg~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= 0 ~mode2~0) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (= (ite (= |ULTIMATE.start_main_~main__c1~0#1| 0) 0 1) |ULTIMATE.start_main_~__tmp_1~0#1|) .cse28 (= ~p1~0 0) .cse29 .cse30 (= ~__return_main~0 0) .cse31 .cse32 .cse33)))) [2022-12-14 13:12:30,151 INFO L895 garLoopResultBuilder]: At program point L142(lines 126 382) the Hoare annotation is: (let ((.cse39 (+ ~nomsg~0 1)) (.cse40 (+ ~p2_new~0 1)) (.cse38 (+ ~p3_new~0 1))) (let ((.cse13 (<= ~st2~0 0)) (.cse0 (<= 0 ~id3~0)) (.cse1 (<= 0 .cse38)) (.cse2 (<= 0 ~id1~0)) (.cse3 (<= 0 ~__return_1470~0)) (.cse4 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse5 (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)) (.cse33 (<= 0 ~st1~0)) (.cse6 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse7 (<= 0 ~st2~0)) (.cse34 (<= 0 ~p2~0)) (.cse8 (<= 0 ~send2~0)) (.cse9 (= ~mode1~0 1)) (.cse10 (<= ~id1~0 127)) (.cse11 (<= 0 .cse40)) (.cse12 (<= .cse39 0)) (.cse14 (<= ~__return_1394~0 1)) (.cse15 (<= .cse40 0)) (.cse16 (<= ~id3~0 127)) (.cse17 (<= 0 ~id2~0)) (.cse18 (= |#NULL.offset| 0)) (.cse19 (<= 0 .cse39)) (.cse35 (<= ~p2~0 0)) (.cse20 (<= ~id2~0 127)) (.cse21 (<= 0 ~st3~0)) (.cse22 (<= 1 ~__return_1394~0)) (.cse23 (<= .cse38 0)) (.cse36 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse24 (= ~p3~0 0)) (.cse25 (<= 0 ~send3~0)) (.cse26 (= ~p1~0 0)) (.cse27 (<= 0 |#StackHeapBarrier|)) (.cse28 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse29 (= ~__return_main~0 0)) (.cse37 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse30 (= |#NULL.base| 0)) (.cse31 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~p2~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~init__tmp~0#1| 1) .cse11 .cse12 .cse13 .cse14 .cse15 (<= ~r1~0 (* (div ~r1~0 256) 256)) .cse16 .cse17 .cse18 .cse19 (<= 0 (+ ~st2~0 ~st1~0)) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31) (let ((.cse32 (+ ~p1_new~0 1))) (and (= ~mode3~0 1) .cse0 (= ~mode2~0 1) (<= ~st3~0 0) .cse2 .cse3 (<= .cse32 0) (= ~p3_new~0 ~nomsg~0) .cse33 .cse7 .cse34 .cse8 .cse10 (<= ~st1~0 1) .cse11 .cse13 .cse14 .cse15 (= ~mode1~0 0) .cse16 .cse17 .cse18 .cse19 .cse35 .cse20 .cse21 .cse22 .cse23 .cse36 .cse24 (<= 0 .cse32) .cse25 .cse26 .cse27 .cse28 .cse29 .cse37 .cse30 .cse31)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 ~mode3~0) .cse5 (<= ~mode2~0 1) .cse33 .cse6 .cse7 (<= ~mode3~0 1) .cse34 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse35 (<= 0 ~mode2~0) .cse20 .cse21 .cse22 .cse23 .cse36 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse37 .cse30 .cse31)))) [2022-12-14 13:12:30,151 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-12-14 13:12:30,151 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 382) no Hoare annotation was computed. [2022-12-14 13:12:30,151 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 58 470) the Hoare annotation is: true [2022-12-14 13:12:30,151 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 212) no Hoare annotation was computed. [2022-12-14 13:12:30,152 INFO L899 garLoopResultBuilder]: For program point L226(line 226) no Hoare annotation was computed. [2022-12-14 13:12:30,152 INFO L899 garLoopResultBuilder]: For program point L226-1(line 226) no Hoare annotation was computed. [2022-12-14 13:12:30,152 INFO L899 garLoopResultBuilder]: For program point L226-2(line 226) no Hoare annotation was computed. [2022-12-14 13:12:30,152 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 132) no Hoare annotation was computed. [2022-12-14 13:12:30,152 INFO L899 garLoopResultBuilder]: For program point L226-3(line 226) no Hoare annotation was computed. [2022-12-14 13:12:30,152 INFO L899 garLoopResultBuilder]: For program point L94(lines 94 428) no Hoare annotation was computed. [2022-12-14 13:12:30,152 INFO L899 garLoopResultBuilder]: For program point L226-4(lines 226 234) no Hoare annotation was computed. [2022-12-14 13:12:30,152 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 468) no Hoare annotation was computed. [2022-12-14 13:12:30,152 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 132) no Hoare annotation was computed. [2022-12-14 13:12:30,152 INFO L895 garLoopResultBuilder]: At program point L161(lines 161 286) the Hoare annotation is: (let ((.cse36 (+ ~nomsg~0 1)) (.cse35 (+ ~p3_new~0 1))) (let ((.cse11 (= |#NULL.offset| 0)) (.cse22 (= ~p1~0 0)) (.cse25 (= ~__return_main~0 0)) (.cse28 (= |ULTIMATE.start_main_~main__i2~0#1| 0)) (.cse0 (<= 0 ~id3~0)) (.cse29 (<= 0 .cse35)) (.cse30 (= ~mode2~0 1)) (.cse1 (<= 0 ~id1~0)) (.cse2 (<= 0 ~__return_1470~0)) (.cse31 (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)) (.cse3 (<= 0 ~st1~0)) (.cse32 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse4 (<= 0 ~st2~0)) (.cse5 (<= 0 ~p2~0)) (.cse6 (<= 0 ~send2~0)) (.cse33 (= ~mode1~0 1)) (.cse7 (<= ~id1~0 127)) (.cse34 (<= .cse36 0)) (.cse8 (<= ~__return_1394~0 1)) (.cse9 (<= ~id3~0 127)) (.cse10 (<= 0 ~id2~0)) (.cse12 (<= 0 .cse36)) (.cse13 (= ~nomsg~0 |ULTIMATE.start_main_~node3__m3~0#1|)) (.cse14 (<= ~p2~0 0)) (.cse15 (<= ~id2~0 127)) (.cse16 (<= 0 ~st3~0)) (.cse17 (<= 1 ~__return_1394~0)) (.cse18 (<= .cse35 0)) (.cse19 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse20 (= ~p3~0 0)) (.cse21 (<= 0 ~send3~0)) (.cse23 (<= 0 |#StackHeapBarrier|)) (.cse24 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse26 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse27 (= |#NULL.base| 0))) (or (and (= ~mode3~0 1) .cse0 (= ~nomsg~0 ~p1_new~0) (<= ~st3~0 0) (<= ~st2~0 1) .cse1 .cse2 (= (* 256 (div ~mode2~0 256)) ~mode2~0) (= ~p3_new~0 ~nomsg~0) (<= ~mode2~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 (= ~nomsg~0 ~p2_new~0) (<= ~st1~0 1) .cse8 (= ~mode1~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= 0 ~mode2~0) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (and .cse0 .cse29 .cse30 .cse1 .cse2 (<= 0 ~mode3~0) .cse31 .cse3 .cse32 .cse4 (<= ~mode3~0 1) .cse5 .cse6 .cse33 .cse7 .cse34 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (and .cse0 .cse29 .cse30 .cse1 .cse2 .cse31 (<= 0 |ULTIMATE.start_main_~main__i2~0#1|) (<= |#NULL.offset| 0) .cse3 .cse32 .cse4 (<= ~p1~0 0) (<= ~__return_main~0 0) .cse5 .cse6 .cse33 .cse7 (<= |ULTIMATE.start_main_~main__i2~0#1| 0) .cse34 .cse8 (<= ~r1~0 (* (div ~r1~0 256) 256)) (<= 0 ~__return_main~0) .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= 0 |#NULL.offset|) .cse20 .cse21 (<= 0 ~p1~0) .cse23 .cse24 .cse26 .cse27)))) [2022-12-14 13:12:30,152 INFO L899 garLoopResultBuilder]: For program point L310(lines 310 330) no Hoare annotation was computed. [2022-12-14 13:12:30,152 INFO L895 garLoopResultBuilder]: At program point L277(lines 265 285) the Hoare annotation is: false [2022-12-14 13:12:30,152 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-14 13:12:30,152 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 423) no Hoare annotation was computed. [2022-12-14 13:12:30,152 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-12-14 13:12:30,152 INFO L899 garLoopResultBuilder]: For program point L212-1(line 212) no Hoare annotation was computed. [2022-12-14 13:12:30,153 INFO L895 garLoopResultBuilder]: At program point L146(lines 146 331) the Hoare annotation is: (let ((.cse40 (+ ~nomsg~0 1)) (.cse41 (+ ~p2_new~0 1)) (.cse39 (+ ~p3_new~0 1))) (let ((.cse5 (<= 0 ~st1~0)) (.cse7 (<= 0 ~p2~0)) (.cse18 (<= ~p2~0 0)) (.cse23 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse30 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse0 (<= 0 ~id3~0)) (.cse33 (<= 0 .cse39)) (.cse1 (= ~nomsg~0 |ULTIMATE.start_main_~node2__m2~0#1|)) (.cse2 (<= 0 ~id1~0)) (.cse3 (<= 0 ~__return_1470~0)) (.cse34 (= (* 256 (div ~mode2~0 256)) ~mode2~0)) (.cse35 (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)) (.cse36 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse6 (<= 0 ~st2~0)) (.cse8 (<= 0 ~send2~0)) (.cse37 (= ~mode1~0 1)) (.cse9 (<= ~id1~0 127)) (.cse10 (<= 0 .cse41)) (.cse38 (<= .cse40 0)) (.cse11 (<= ~st2~0 0)) (.cse12 (<= ~__return_1394~0 1)) (.cse13 (<= .cse41 0)) (.cse14 (<= ~id3~0 127)) (.cse15 (<= 0 ~id2~0)) (.cse16 (= |#NULL.offset| 0)) (.cse17 (<= 0 .cse40)) (.cse19 (<= ~id2~0 127)) (.cse20 (<= 0 ~st3~0)) (.cse21 (<= 1 ~__return_1394~0)) (.cse22 (<= .cse39 0)) (.cse24 (= ~p3~0 0)) (.cse25 (<= 0 ~send3~0)) (.cse26 (= ~p1~0 0)) (.cse27 (<= 0 |#StackHeapBarrier|)) (.cse28 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse29 (= ~__return_main~0 0)) (.cse31 (= |#NULL.base| 0)) (.cse32 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (let ((.cse4 (+ ~p1_new~0 1))) (and (= ~mode3~0 1) .cse0 (= ~mode2~0 1) (<= ~st3~0 0) .cse1 .cse2 .cse3 (<= .cse4 0) (= ~p3_new~0 ~nomsg~0) .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~st1~0 1) .cse10 .cse11 .cse12 .cse13 (= ~mode1~0 0) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (<= 0 .cse4) .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32)) (and .cse0 .cse33 .cse1 .cse2 .cse3 .cse34 (<= 0 ~mode3~0) .cse35 (<= ~mode2~0 1) .cse5 .cse36 .cse6 (<= ~mode3~0 1) .cse7 .cse8 .cse37 .cse9 .cse10 .cse38 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= 0 ~mode2~0) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) (and .cse0 .cse33 .cse1 .cse2 .cse3 .cse34 (= ~p2~0 0) .cse35 .cse36 .cse6 .cse8 .cse37 .cse9 (= |ULTIMATE.start_main_~init__tmp~0#1| 1) .cse10 .cse38 .cse11 .cse12 .cse13 (<= ~r1~0 (* (div ~r1~0 256) 256)) .cse14 .cse15 .cse16 .cse17 (<= 0 (+ ~st2~0 ~st1~0)) .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32)))) [2022-12-14 13:12:30,153 INFO L899 garLoopResultBuilder]: For program point L212-2(line 212) no Hoare annotation was computed. [2022-12-14 13:12:30,153 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 388) no Hoare annotation was computed. [2022-12-14 13:12:30,153 INFO L899 garLoopResultBuilder]: For program point L212-3(line 212) no Hoare annotation was computed. [2022-12-14 13:12:30,153 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 463) no Hoare annotation was computed. [2022-12-14 13:12:30,153 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-12-14 13:12:30,153 INFO L899 garLoopResultBuilder]: For program point L361(lines 361 381) no Hoare annotation was computed. [2022-12-14 13:12:30,153 INFO L899 garLoopResultBuilder]: For program point L312(lines 312 325) no Hoare annotation was computed. [2022-12-14 13:12:30,153 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 226) no Hoare annotation was computed. [2022-12-14 13:12:30,153 INFO L895 garLoopResultBuilder]: At program point L131(lines 128 356) the Hoare annotation is: (let ((.cse1 (+ ~p2_new~0 1)) (.cse0 (+ ~p1_new~0 1))) (and (= ~mode3~0 1) (<= 0 ~id3~0) (= ~mode2~0 1) (= |ULTIMATE.start_main_~check__tmp~0#1| ~__return_1470~0) (<= 0 ~id1~0) (<= .cse0 0) (= |ULTIMATE.start_main_~main__c1~0#1| ~__return_1470~0) (< (mod ~r1~0 256) 3) (= |ULTIMATE.start_main_~check__tmp~0#1| 1) (= ~p3_new~0 ~nomsg~0) (= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= 0 ~st1~0) (<= 0 ~st2~0) (<= 0 ~p2~0) (<= 0 ~send2~0) (= ~mode1~0 1) (<= ~id1~0 127) (<= 0 .cse1) (= |ULTIMATE.start_main_~assert__arg~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|) (<= ~__return_1394~0 1) (<= .cse1 0) (<= ~id3~0 127) (<= 0 ~id2~0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= ~p2~0 0) (<= ~id2~0 127) (<= 0 ~st3~0) (<= 1 ~__return_1394~0) (<= (+ ~p3_new~0 1) 0) (<= |ULTIMATE.start_main_~init__tmp~0#1| 1) (= ~p3~0 0) (<= 0 .cse0) (= (ite (= |ULTIMATE.start_main_~main__c1~0#1| 0) 0 1) |ULTIMATE.start_main_~__tmp_1~0#1|) (<= 0 ~send3~0) (= ~p1~0 0) (<= 0 |#StackHeapBarrier|) (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~0#1|) (= ~__return_main~0 0) (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|) (= |#NULL.base| 0) (= |ULTIMATE.start_main_~main__i2~0#1| 0))) [2022-12-14 13:12:30,153 INFO L899 garLoopResultBuilder]: For program point L98(lines 98 418) no Hoare annotation was computed. [2022-12-14 13:12:30,153 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-12-14 13:12:30,153 INFO L899 garLoopResultBuilder]: For program point L181(line 181) no Hoare annotation was computed. [2022-12-14 13:12:30,154 INFO L899 garLoopResultBuilder]: For program point L181-1(line 181) no Hoare annotation was computed. [2022-12-14 13:12:30,154 INFO L899 garLoopResultBuilder]: For program point L181-2(line 181) no Hoare annotation was computed. [2022-12-14 13:12:30,154 INFO L899 garLoopResultBuilder]: For program point L82(lines 82 458) no Hoare annotation was computed. [2022-12-14 13:12:30,154 INFO L899 garLoopResultBuilder]: For program point L181-3(line 181) no Hoare annotation was computed. [2022-12-14 13:12:30,154 INFO L899 garLoopResultBuilder]: For program point L181-4(lines 181 241) no Hoare annotation was computed. [2022-12-14 13:12:30,154 INFO L899 garLoopResultBuilder]: For program point L363(lines 363 376) no Hoare annotation was computed. [2022-12-14 13:12:30,154 INFO L895 garLoopResultBuilder]: At program point L132(line 132) the Hoare annotation is: (let ((.cse1 (+ ~p2_new~0 1)) (.cse0 (+ ~p1_new~0 1))) (and (= ~mode3~0 1) (<= 0 ~id3~0) (= ~mode2~0 1) (= |ULTIMATE.start_main_~check__tmp~0#1| ~__return_1470~0) (<= 0 ~id1~0) (<= .cse0 0) (= |ULTIMATE.start_main_~main__c1~0#1| ~__return_1470~0) (< (mod ~r1~0 256) 3) (= |ULTIMATE.start_main_~check__tmp~0#1| 1) (= ~p3_new~0 ~nomsg~0) (= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= 0 ~st1~0) (<= 0 ~st2~0) (<= 0 ~p2~0) (<= 0 ~send2~0) (= ~mode1~0 1) (<= ~id1~0 127) (<= 0 .cse1) (= |ULTIMATE.start_main_~assert__arg~0#1| |ULTIMATE.start_main_~__tmp_1~0#1|) (<= ~__return_1394~0 1) (<= .cse1 0) (<= ~id3~0 127) (<= 0 ~id2~0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= ~p2~0 0) (<= ~id2~0 127) (<= 0 ~st3~0) (<= 1 ~__return_1394~0) (<= (+ ~p3_new~0 1) 0) (<= |ULTIMATE.start_main_~init__tmp~0#1| 1) (= ~p3~0 0) (<= 0 .cse0) (= (ite (= |ULTIMATE.start_main_~main__c1~0#1| 0) 0 1) |ULTIMATE.start_main_~__tmp_1~0#1|) (<= 0 ~send3~0) (= ~p1~0 0) (<= 0 |#StackHeapBarrier|) (= ~nomsg~0 |ULTIMATE.start_main_~node1__m1~0#1|) (= ~__return_main~0 0) (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|) (= |#NULL.base| 0) (= |ULTIMATE.start_main_~main__i2~0#1| 0))) [2022-12-14 13:12:30,154 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 181) no Hoare annotation was computed. [2022-12-14 13:12:30,154 INFO L899 garLoopResultBuilder]: For program point L265(lines 265 285) no Hoare annotation was computed. [2022-12-14 13:12:30,154 INFO L899 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2022-12-14 13:12:30,154 INFO L899 garLoopResultBuilder]: For program point L100(lines 100 413) no Hoare annotation was computed. [2022-12-14 13:12:30,154 INFO L895 garLoopResultBuilder]: At program point L315(lines 312 325) the Hoare annotation is: (let ((.cse36 (+ |ULTIMATE.start_main_~node2__m2~0#1| 1)) (.cse38 (+ ~nomsg~0 1)) (.cse39 (+ ~p2_new~0 1)) (.cse37 (+ ~p3_new~0 1))) (let ((.cse0 (<= 0 ~id3~0)) (.cse1 (<= 0 .cse37)) (.cse2 (<= 0 ~id1~0)) (.cse3 (<= 0 ~__return_1470~0)) (.cse4 (= (mod ~mode2~0 256) 0)) (.cse5 (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)) (.cse6 (= ~send2~0 |ULTIMATE.start_main_~node2____CPAchecker_TMP_0~0#1|)) (.cse7 (= (* 256 (div ~mode3~0 256)) ~mode3~0)) (.cse8 (<= 0 ~st2~0)) (.cse9 (<= 0 ~send2~0)) (.cse10 (= ~mode1~0 1)) (.cse11 (<= ~id1~0 127)) (.cse12 (<= 0 .cse39)) (.cse13 (<= .cse38 0)) (.cse14 (<= ~__return_1394~0 1)) (.cse15 (<= .cse39 0)) (.cse16 (<= ~id3~0 127)) (.cse17 (<= 0 ~id2~0)) (.cse18 (= |#NULL.offset| 0)) (.cse19 (<= 0 .cse38)) (.cse20 (<= ~id2~0 127)) (.cse21 (<= 0 ~st3~0)) (.cse22 (<= 1 ~__return_1394~0)) (.cse23 (<= .cse37 0)) (.cse24 (<= |ULTIMATE.start_main_~init__tmp~0#1| 1)) (.cse25 (<= 0 .cse36)) (.cse26 (= ~p3~0 0)) (.cse27 (<= 0 ~send3~0)) (.cse28 (= ~p1~0 0)) (.cse29 (<= 0 |#StackHeapBarrier|)) (.cse30 (<= 0 |ULTIMATE.start_main_~main__c1~0#1|)) (.cse31 (<= .cse36 0)) (.cse32 (= ~__return_main~0 0)) (.cse33 (<= 1 |ULTIMATE.start_main_~init__tmp~0#1|)) (.cse34 (= |#NULL.base| 0)) (.cse35 (= |ULTIMATE.start_main_~main__i2~0#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 ~mode3~0) .cse5 .cse6 (<= ~mode2~0 1) (<= 0 ~st1~0) .cse7 .cse8 (<= ~mode3~0 1) (<= 0 ~p2~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= ~p2~0 0) (<= 0 ~mode2~0) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~p2~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ~st2~0 0) .cse14 .cse15 (<= ~r1~0 (* (div ~r1~0 256) 256)) .cse16 .cse17 .cse18 .cse19 (<= 0 (+ ~st2~0 ~st1~0)) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35)))) [2022-12-14 13:12:30,154 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 235) no Hoare annotation was computed. [2022-12-14 13:12:30,154 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 453) no Hoare annotation was computed. [2022-12-14 13:12:30,157 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:12:30,158 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 13:12:30,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 01:12:30 BoogieIcfgContainer [2022-12-14 13:12:30,193 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 13:12:30,194 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 13:12:30,194 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 13:12:30,194 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 13:12:30,194 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:11:50" (3/4) ... [2022-12-14 13:12:30,196 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 13:12:30,205 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-12-14 13:12:30,205 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-12-14 13:12:30,205 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-12-14 13:12:30,206 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 13:12:30,243 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5438cf8d-93fd-42b2-ad72-5ed43f7e3c81/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 13:12:30,243 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 13:12:30,244 INFO L158 Benchmark]: Toolchain (without parser) took 40023.90ms. Allocated memory was 127.9MB in the beginning and 339.7MB in the end (delta: 211.8MB). Free memory was 87.9MB in the beginning and 110.2MB in the end (delta: -22.4MB). Peak memory consumption was 191.8MB. Max. memory is 16.1GB. [2022-12-14 13:12:30,244 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 127.9MB. Free memory is still 70.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 13:12:30,244 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.78ms. Allocated memory is still 127.9MB. Free memory was 87.4MB in the beginning and 73.7MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-14 13:12:30,244 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.01ms. Allocated memory is still 127.9MB. Free memory was 73.7MB in the beginning and 71.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 13:12:30,244 INFO L158 Benchmark]: Boogie Preprocessor took 21.99ms. Allocated memory is still 127.9MB. Free memory was 71.1MB in the beginning and 70.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 13:12:30,245 INFO L158 Benchmark]: RCFGBuilder took 475.30ms. Allocated memory was 127.9MB in the beginning and 161.5MB in the end (delta: 33.6MB). Free memory was 70.0MB in the beginning and 120.5MB in the end (delta: -50.5MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2022-12-14 13:12:30,245 INFO L158 Benchmark]: TraceAbstraction took 39227.58ms. Allocated memory was 161.5MB in the beginning and 339.7MB in the end (delta: 178.3MB). Free memory was 119.7MB in the beginning and 116.6MB in the end (delta: 3.1MB). Peak memory consumption was 198.7MB. Max. memory is 16.1GB. [2022-12-14 13:12:30,245 INFO L158 Benchmark]: Witness Printer took 49.80ms. Allocated memory is still 339.7MB. Free memory was 116.6MB in the beginning and 110.2MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-12-14 13:12:30,246 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.17ms. Allocated memory is still 127.9MB. Free memory is still 70.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.78ms. Allocated memory is still 127.9MB. Free memory was 87.4MB in the beginning and 73.7MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.01ms. Allocated memory is still 127.9MB. Free memory was 73.7MB in the beginning and 71.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.99ms. Allocated memory is still 127.9MB. Free memory was 71.1MB in the beginning and 70.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 475.30ms. Allocated memory was 127.9MB in the beginning and 161.5MB in the end (delta: 33.6MB). Free memory was 70.0MB in the beginning and 120.5MB in the end (delta: -50.5MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * TraceAbstraction took 39227.58ms. Allocated memory was 161.5MB in the beginning and 339.7MB in the end (delta: 178.3MB). Free memory was 119.7MB in the beginning and 116.6MB in the end (delta: 3.1MB). Peak memory consumption was 198.7MB. Max. memory is 16.1GB. * Witness Printer took 49.80ms. Allocated memory is still 339.7MB. Free memory was 116.6MB in the beginning and 110.2MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 181]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 212]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 226]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 73 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 39.1s, OverallIterations: 22, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 8.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1984 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1984 mSDsluCounter, 2961 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1448 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2536 IncrementalHoareTripleChecker+Invalid, 2646 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 1513 mSDtfsCounter, 2536 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 387 GetRequests, 242 SyntacticMatches, 8 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2781 ImplicationChecksByTransitivity, 14.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1217occurred in iteration=13, InterpolantAutomatonStates: 140, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 520 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 47 NumberOfFragments, 4710 HoareAnnotationTreeSize, 17 FomulaSimplifications, 13542 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 17 FomulaSimplificationsInter, 9678 FormulaSimplificationTreeSizeReductionInter, 7.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1458 NumberOfCodeBlocks, 1458 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1491 ConstructedInterpolants, 0 QuantifiedInterpolants, 7094 SizeOfPredicates, 18 NumberOfNonLiveVariables, 637 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 25 InterpolantComputations, 21 PerfectInterpolantSequences, 463/550 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: 7.6s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 78, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 352, TOOLS_POST_TIME: 6.4s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 351, TOOLS_QUANTIFIERELIM_TIME: 6.3s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 426, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 34, DOMAIN_JOIN_TIME: 0.6s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 5, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 9, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 78, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 4, LOOP_SUMMARIZER_CACHE_MISSES: 4, LOOP_SUMMARIZER_OVERALL_TIME: 6.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 6.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 9, 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.2s, DAG_COMPRESSION_PROCESSED_NODES: 13258, DAG_COMPRESSION_RETAINED_NODES: 224, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && mode2 == 1) && st3 <= 0) && nomsg == node2__m2) && 0 <= id1) && 0 <= __return_1470) && p1_new + 1 <= 0) && p3_new == nomsg) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && st1 <= 1) && 0 <= p2_new + 1) && st2 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && nomsg == node2__m2) && 0 <= id1) && 0 <= __return_1470) && 256 * (mode2 / 256) == mode2) && 0 <= mode3) && st3 + st2 + st1 <= 0) && mode2 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || ((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && nomsg == node2__m2) && 0 <= id1) && 0 <= __return_1470) && 256 * (mode2 / 256) == mode2) && p2 == 0) && st3 + st2 + st1 <= 0) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && st2 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && r1 <= r1 / 256 * 256) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= st2 + st1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0) - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 181]: Loop Invariant Derived loop invariant: ((((((((((((((nomsg + 1 <= id3 && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 256 * (mode2 / 256) == mode2) && check__tmp == 0) && st2 + st1 <= 2147483647) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && mode1 == 0) && !(2147483649 + st3 + st2 + st1 <= 0)) && !(2147483649 + st2 + st1 <= 0)) && st3 + st2 + st1 <= 2147483647) || ((((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && mode2 == 1) && 0 <= id1) && 0 <= __return_1470) && p1_new + 1 <= 0) && r1 % 256 < 3) && check__tmp == 1) && p3_new == nomsg) && st3 + st2 + st1 == 0) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && __return_1394 <= 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || ((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= id1) && 0 <= __return_1470) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && r1 % 256 < 3) && 0 <= mode3) && check__tmp == 1) && p3_new == nomsg) && st3 + st2 + st1 == 0) && mode2 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && nomsg == p1_new) && st3 <= 0) && st2 <= 1) && 0 <= id1) && 0 <= __return_1470) && 256 * (mode2 / 256) == mode2) && p3_new == nomsg) && mode2 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && nomsg == p2_new) && st1 <= 1) && __return_1394 <= 1) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || (((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && mode2 == 1) && 0 <= id1) && 0 <= __return_1470) && 0 <= mode3) && st3 + st2 + st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && nomsg + 1 <= 0) && __return_1394 <= 1) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || ((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && mode2 == 1) && 0 <= id1) && 0 <= __return_1470) && st3 + st2 + st1 <= 0) && 0 <= main__i2) && #NULL <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && main__i2 <= 0) && nomsg + 1 <= 0) && __return_1394 <= 1) && r1 <= r1 / 256 * 256) && 0 <= __return_main) && id3 <= 127) && 0 <= id2) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= #NULL) && p3 == 0) && 0 <= send3) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && 1 <= init__tmp) && #NULL == 0) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && mode2 == 1) && 0 <= id1) && 0 <= __return_1470) && p2 == 0) && st3 + st2 + st1 <= 0) && 0 <= st1) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && nomsg + 1 <= 0) && __return_1394 <= 1) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && init__tmp <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || (((((((((((((((((((((((((((((((((((((((0 <= id3 && nomsg == p1_new) && st2 <= 1) && 0 <= id1) && 0 <= __return_1470) && 256 * (mode2 / 256) == mode2) && p2 == 0) && 0 <= mode3) && p3_new == nomsg) && mode2 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= send2) && id1 <= 127) && nomsg == p2_new) && st1 <= 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && mode1 == 0) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && init__tmp <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= id1) && 0 <= __return_1470) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && main__c1 <= 1) && st3 + st2 + st1 <= 0) && mode1 % 256 == 0) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && st2 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && r1 <= r1 / 256 * 256) && 0 <= __return_main) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= st2 + st1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && nomsg == node1__m1) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || (((((((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= mode1) && check__tmp == __return_1470) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && main__c1 == __return_1470) && r1 % 256 < 3) && 0 <= mode3) && check__tmp == 1) && p3_new == nomsg) && st3 + st2 + st1 == 0) && mode1 % 256 == 0) && mode2 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && mode1 <= 1) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && nomsg == node1__m1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((0 <= id3 && mode2 == 1) && 0 <= id1) && 0 <= __return_1470) && 0 <= mode3) && p3_new == nomsg) && st3 + st2 + st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && __return_1394 <= 1) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && nomsg == node3__m3) && p2 <= 0) && node3____CPAchecker_TMP_0 == send3) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || (((((((((((((((((((((((((((((((((((((((0 <= id3 && mode2 == 1) && 0 <= id1) && 0 <= __return_1470) && p3_new == nomsg) && st3 + st2 + st1 <= 0) && 0 <= main__i2) && #NULL <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && main__i2 <= 0) && __return_1394 <= 1) && r1 <= r1 / 256 * 256) && 0 <= __return_main) && id3 <= 127) && 0 <= id2) && 0 <= nomsg + 1) && nomsg == node3__m3) && p2 <= 0) && node3____CPAchecker_TMP_0 == send3) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= #NULL) && p3 == 0) && 0 <= send3) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && 1 <= init__tmp) && #NULL == 0) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && mode2 == 1) && check__tmp == __return_1470) && 0 <= id1) && p1_new + 1 <= 0) && main__c1 == __return_1470) && r1 % 256 < 3) && check__tmp == 1) && p3_new == nomsg) && st3 + st2 + st1 == 0) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && nomsg == node1__m1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0 - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && mode2 == 1) && check__tmp == __return_1470) && 0 <= id1) && p1_new + 1 <= 0) && main__c1 == __return_1470) && r1 % 256 < 3) && check__tmp == 1) && p3_new == nomsg) && st3 + st2 + st1 == 0) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && nomsg == node1__m1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0 - InvariantResult [Line: 58]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 312]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= id1) && 0 <= __return_1470) && mode2 % 256 == 0) && 0 <= mode3) && st3 + st2 + st1 <= 0) && send2 == node2____CPAchecker_TMP_0) && mode2 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= node2__m2 + 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && node2__m2 + 1 <= 0) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || (((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= id1) && 0 <= __return_1470) && mode2 % 256 == 0) && p2 == 0) && st3 + st2 + st1 <= 0) && send2 == node2____CPAchecker_TMP_0) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && st2 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && r1 <= r1 / 256 * 256) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= st2 + st1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= node2__m2 + 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && node2__m2 + 1 <= 0) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && nomsg == p1_new) && st3 <= 0) && st2 <= 1) && 0 <= id1) && 0 <= __return_1470) && 256 * (mode2 / 256) == mode2) && p3_new == nomsg) && mode2 <= 1) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && nomsg == p2_new) && st1 <= 1) && __return_1394 <= 1) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && nomsg == node3__m3) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && mode2 == 1) && 0 <= id1) && 0 <= __return_1470) && 0 <= mode3) && st3 + st2 + st1 <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && nomsg + 1 <= 0) && __return_1394 <= 1) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && nomsg == node3__m3) && p2 <= 0) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && mode2 == 1) && 0 <= id1) && 0 <= __return_1470) && st3 + st2 + st1 <= 0) && 0 <= main__i2) && #NULL <= 0) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && main__i2 <= 0) && nomsg + 1 <= 0) && __return_1394 <= 1) && r1 <= r1 / 256 * 256) && 0 <= __return_main) && id3 <= 127) && 0 <= id2) && 0 <= nomsg + 1) && nomsg == node3__m3) && p2 <= 0) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && 0 <= #NULL) && p3 == 0) && 0 <= send3) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && 1 <= init__tmp) && #NULL == 0) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= id1) && 0 <= __return_1470) && 256 * (mode2 / 256) == mode2) && p2 == 0) && st3 + st2 + st1 <= 0) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && init__tmp == 1) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && st2 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && r1 <= r1 / 256 * 256) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= st2 + st1) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && mode2 == 1) && st3 <= 0) && 0 <= id1) && 0 <= __return_1470) && p1_new + 1 <= 0) && p3_new == nomsg) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && id1 <= 127) && st1 <= 1) && 0 <= p2_new + 1) && st2 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= id1) && 0 <= __return_1470) && 256 * (mode2 / 256) == mode2) && 0 <= mode3) && st3 + st2 + st1 <= 0) && mode2 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && mode2 == 1) && 0 <= id1) && 0 <= __return_1470) && p1_new + 1 <= 0) && p3_new == nomsg) && st3 + st2 + st1 == 0) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && __return_1394 <= 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= id1) && 0 <= __return_1470) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && 0 <= mode3) && p3_new == nomsg) && st3 + st2 + st1 == 0) && mode2 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && __return_1394 <= 1) && p2_new + 1 <= 0) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || ((((((((((((((nomsg + 1 <= id3 && !(r1 <= r1 / 256 * 256 + 2)) && nomsg + 1 <= send3) && mode3 == 1) && mode2 == 1) && nomsg + 1 <= send2) && st2 + st1 <= 2147483647) && 0 <= st1) && mode1 == 1) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && !(2147483649 + st2 + st1 <= 0)) && st3 + st2 + st1 <= 2147483647) || ((((((((((((nomsg + 1 <= id3 && !(r1 <= r1 / 256 * 256 + 2)) && nomsg + 1 <= send3) && nomsg + 1 <= send2) && 256 * (mode2 / 256) == mode2) && 256 * (mode1 / 256) == mode1) && st2 + st1 <= 2147483647) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && nomsg + 1 <= id2) && nomsg + 1 <= 0) && !(2147483649 + st2 + st1 <= 0)) && st3 + st2 + st1 <= 2147483647)) && !(2147483649 + st3 + st2 + st1 <= 0)) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((mode3 == 1 && 0 <= id3) && mode2 == 1) && check__tmp == __return_1470) && 0 <= id1) && p1_new + 1 <= 0) && main__c1 == __return_1470) && r1 % 256 < 3) && check__tmp == 1) && p3_new == nomsg) && st3 + st2 + st1 == 0) && 0 <= st1) && 0 <= st2) && 0 <= p2) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || ((((((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= mode1) && check__tmp == __return_1470) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && main__c1 == __return_1470) && r1 % 256 < 3) && 0 <= mode3) && check__tmp == 1) && 256 * (mode1 / 256) == mode1) && p3_new == nomsg) && st3 + st2 + st1 == 0) && mode2 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && mode1 <= 1) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0)) || (((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= id1) && 0 <= __return_1470) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && main__c1 <= 1) && 256 * (mode1 / 256) == mode1) && st3 + st2 + st1 <= 0) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && st2 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && r1 <= r1 / 256 * 256) && 0 <= __return_main) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= st2 + st1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= p3_new + 1) && 0 <= id1) && 0 <= __return_1470) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && main__c1 <= 1) && st3 + st2 + st1 <= 0) && mode1 % 256 == 0) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && p1 <= 0) && __return_main <= 0) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && st2 <= 0) && __return_1394 <= 1) && p2_new + 1 <= 0) && r1 <= r1 / 256 * 256) && 0 <= __return_main) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && 0 <= st2 + st1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && __return_1470 <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && 0 <= p1) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= main__c1) && nomsg == node1__m1) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) || (((((((((((((((((((((((((((((((((((((((((((((((0 <= id3 && 0 <= mode1) && check__tmp == __return_1470) && 0 <= id1) && 256 * (mode2 / 256) == mode2) && p1_new + 1 <= 0) && main__c1 == __return_1470) && r1 % 256 < 3) && 0 <= mode3) && check__tmp == 1) && p3_new == nomsg) && st3 + st2 + st1 == 0) && mode1 % 256 == 0) && mode2 <= 1) && 0 <= st1) && 256 * (mode3 / 256) == mode3) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && 0 <= send2) && id1 <= 127) && 0 <= p2_new + 1) && mode1 <= 1) && assert__arg == __tmp_1) && __return_1394 <= 1) && p2_new + 1 <= 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && 0 <= mode2) && id2 <= 127) && 0 <= st3) && 1 <= __return_1394) && p3_new + 1 <= 0) && init__tmp <= 1) && p3 == 0) && 0 <= p1_new + 1) && (if main__c1 == 0 then 0 else 1) == __tmp_1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && nomsg == node1__m1) && __return_main == 0) && 1 <= init__tmp) && #NULL == 0) && main__i2 == 0) RESULT: Ultimate proved your program to be correct! [2022-12-14 13:12:30,272 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5438cf8d-93fd-42b2-ad72-5ed43f7e3c81/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE