./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 6b4ec56b 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_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e5878b7d2af5fd4b66050c0dbed52215fb6ea8477622dc26391a98be7bc7f1ca --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 21:06:54,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 21:06:54,245 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 21:06:54,273 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 21:06:54,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 21:06:54,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 21:06:54,279 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 21:06:54,284 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 21:06:54,285 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 21:06:54,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 21:06:54,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 21:06:54,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 21:06:54,289 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 21:06:54,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 21:06:54,291 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 21:06:54,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 21:06:54,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 21:06:54,294 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 21:06:54,300 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 21:06:54,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 21:06:54,312 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 21:06:54,318 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 21:06:54,320 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 21:06:54,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 21:06:54,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 21:06:54,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 21:06:54,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 21:06:54,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 21:06:54,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 21:06:54,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 21:06:54,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 21:06:54,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 21:06:54,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 21:06:54,337 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 21:06:54,338 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 21:06:54,338 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 21:06:54,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 21:06:54,342 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 21:06:54,343 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 21:06:54,343 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 21:06:54,344 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 21:06:54,345 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-20 21:06:54,390 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 21:06:54,390 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 21:06:54,391 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 21:06:54,391 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 21:06:54,392 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 21:06:54,392 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 21:06:54,392 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 21:06:54,392 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 21:06:54,393 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 21:06:54,393 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 21:06:54,394 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 21:06:54,394 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 21:06:54,394 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 21:06:54,394 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 21:06:54,395 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 21:06:54,395 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 21:06:54,395 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 21:06:54,395 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 21:06:54,396 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 21:06:54,396 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 21:06:54,396 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 21:06:54,397 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 21:06:54,397 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 21:06:54,397 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 21:06:54,397 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 21:06:54,397 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 21:06:54,398 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 21:06:54,398 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-20 21:06:54,399 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 21:06:54,399 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 21:06:54,399 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 21:06:54,399 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 21:06:54,400 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 21:06:54,400 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 21:06:54,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 21:06:54,400 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 21:06:54,400 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 21:06:54,401 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 21:06:54,401 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 21:06:54,401 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 21:06:54,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 21:06:54,401 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 21:06:54,402 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 21:06:54,402 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_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/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_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e5878b7d2af5fd4b66050c0dbed52215fb6ea8477622dc26391a98be7bc7f1ca [2022-11-20 21:06:54,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 21:06:54,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 21:06:54,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 21:06:54,734 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 21:06:54,734 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 21:06:54,736 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2022-11-20 21:06:57,835 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 21:06:58,050 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 21:06:58,053 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2022-11-20 21:06:58,065 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/data/d493a7fee/bac3b7b0e2764aa1988ceb384bea2ac5/FLAG725cbc62a [2022-11-20 21:06:58,080 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/data/d493a7fee/bac3b7b0e2764aa1988ceb384bea2ac5 [2022-11-20 21:06:58,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 21:06:58,084 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 21:06:58,086 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 21:06:58,086 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 21:06:58,090 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 21:06:58,091 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:06:58" (1/1) ... [2022-11-20 21:06:58,092 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db4a19c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:58, skipping insertion in model container [2022-11-20 21:06:58,092 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:06:58" (1/1) ... [2022-11-20 21:06:58,100 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 21:06:58,124 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 21:06:58,400 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_88b2d55d-7700-4bab-bc44-fcdaceee2545/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c[6117,6130] [2022-11-20 21:06:58,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 21:06:58,413 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 21:06:58,485 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_88b2d55d-7700-4bab-bc44-fcdaceee2545/sv-benchmarks/c/seq-mthreaded/pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c[6117,6130] [2022-11-20 21:06:58,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 21:06:58,504 INFO L208 MainTranslator]: Completed translation [2022-11-20 21:06:58,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:58 WrapperNode [2022-11-20 21:06:58,505 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 21:06:58,507 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 21:06:58,507 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 21:06:58,507 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 21:06:58,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:58" (1/1) ... [2022-11-20 21:06:58,535 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:58" (1/1) ... [2022-11-20 21:06:58,580 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 219 [2022-11-20 21:06:58,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 21:06:58,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 21:06:58,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 21:06:58,583 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 21:06:58,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:58" (1/1) ... [2022-11-20 21:06:58,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:58" (1/1) ... [2022-11-20 21:06:58,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:58" (1/1) ... [2022-11-20 21:06:58,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:58" (1/1) ... [2022-11-20 21:06:58,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:58" (1/1) ... [2022-11-20 21:06:58,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:58" (1/1) ... [2022-11-20 21:06:58,632 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:58" (1/1) ... [2022-11-20 21:06:58,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:58" (1/1) ... [2022-11-20 21:06:58,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 21:06:58,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 21:06:58,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 21:06:58,643 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 21:06:58,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:58" (1/1) ... [2022-11-20 21:06:58,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 21:06:58,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:06:58,675 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 21:06:58,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 21:06:58,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 21:06:58,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 21:06:58,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 21:06:58,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 21:06:58,813 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 21:06:58,816 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 21:06:59,251 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 21:06:59,634 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 21:06:59,635 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 21:06:59,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:06:59 BoogieIcfgContainer [2022-11-20 21:06:59,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 21:06:59,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 21:06:59,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 21:06:59,643 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 21:06:59,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:06:58" (1/3) ... [2022-11-20 21:06:59,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156ed80c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:06:59, skipping insertion in model container [2022-11-20 21:06:59,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:58" (2/3) ... [2022-11-20 21:06:59,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156ed80c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:06:59, skipping insertion in model container [2022-11-20 21:06:59,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:06:59" (3/3) ... [2022-11-20 21:06:59,649 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals.c [2022-11-20 21:06:59,668 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 21:06:59,668 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-11-20 21:06:59,727 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 21:06:59,734 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;@2146bf37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 21:06:59,735 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-11-20 21:06:59,740 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:06:59,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-20 21:06:59,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:06:59,747 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-20 21:06:59,748 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 21:06:59,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:06:59,753 INFO L85 PathProgramCache]: Analyzing trace with hash 11377276, now seen corresponding path program 1 times [2022-11-20 21:06:59,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:06:59,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215134491] [2022-11-20 21:06:59,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:06:59,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:06:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:07:00,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:07:00,366 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:07:00,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215134491] [2022-11-20 21:07:00,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215134491] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:07:00,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:07:00,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 21:07:00,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098540072] [2022-11-20 21:07:00,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:07:00,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 21:07:00,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:07:00,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 21:07:00,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 21:07:00,426 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:07:00,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:07:00,527 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2022-11-20 21:07:00,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 21:07:00,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-20 21:07:00,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:07:00,539 INFO L225 Difference]: With dead ends: 104 [2022-11-20 21:07:00,539 INFO L226 Difference]: Without dead ends: 67 [2022-11-20 21:07:00,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 21:07:00,545 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 34 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:07:00,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 98 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 21:07:00,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-20 21:07:00,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2022-11-20 21:07:00,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.7674418604651163) internal successors, (76), 54 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:07:00,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 76 transitions. [2022-11-20 21:07:00,583 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 76 transitions. Word has length 4 [2022-11-20 21:07:00,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:07:00,583 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 76 transitions. [2022-11-20 21:07:00,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:07:00,584 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 76 transitions. [2022-11-20 21:07:00,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-20 21:07:00,584 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:07:00,584 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-20 21:07:00,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 21:07:00,585 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 21:07:00,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:07:00,586 INFO L85 PathProgramCache]: Analyzing trace with hash 352724648, now seen corresponding path program 1 times [2022-11-20 21:07:00,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:07:00,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200407532] [2022-11-20 21:07:00,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:07:00,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:07:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:07:01,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:07:01,024 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:07:01,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200407532] [2022-11-20 21:07:01,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200407532] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:07:01,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:07:01,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 21:07:01,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519043989] [2022-11-20 21:07:01,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:07:01,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 21:07:01,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:07:01,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 21:07:01,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 21:07:01,031 INFO L87 Difference]: Start difference. First operand 55 states and 76 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:07:01,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:07:01,209 INFO L93 Difference]: Finished difference Result 92 states and 118 transitions. [2022-11-20 21:07:01,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 21:07:01,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-20 21:07:01,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:07:01,215 INFO L225 Difference]: With dead ends: 92 [2022-11-20 21:07:01,216 INFO L226 Difference]: Without dead ends: 89 [2022-11-20 21:07:01,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 21:07:01,218 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 36 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:07:01,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 27 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 21:07:01,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-20 21:07:01,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2022-11-20 21:07:01,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.728813559322034) internal successors, (102), 70 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:07:01,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 102 transitions. [2022-11-20 21:07:01,233 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 102 transitions. Word has length 5 [2022-11-20 21:07:01,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:07:01,234 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 102 transitions. [2022-11-20 21:07:01,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:07:01,234 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 102 transitions. [2022-11-20 21:07:01,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 21:07:01,235 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:07:01,235 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 21:07:01,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 21:07:01,235 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 21:07:01,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:07:01,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1950437567, now seen corresponding path program 1 times [2022-11-20 21:07:01,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:07:01,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322907970] [2022-11-20 21:07:01,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:07:01,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:07:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:07:01,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:07:01,519 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:07:01,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322907970] [2022-11-20 21:07:01,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322907970] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:07:01,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:07:01,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 21:07:01,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472067297] [2022-11-20 21:07:01,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:07:01,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 21:07:01,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:07:01,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 21:07:01,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 21:07:01,525 INFO L87 Difference]: Start difference. First operand 71 states and 102 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:07:01,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:07:01,665 INFO L93 Difference]: Finished difference Result 90 states and 116 transitions. [2022-11-20 21:07:01,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 21:07:01,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-20 21:07:01,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:07:01,672 INFO L225 Difference]: With dead ends: 90 [2022-11-20 21:07:01,673 INFO L226 Difference]: Without dead ends: 87 [2022-11-20 21:07:01,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 21:07:01,680 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 32 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:07:01,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 30 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 21:07:01,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-20 21:07:01,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 72. [2022-11-20 21:07:01,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 71 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:07:01,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2022-11-20 21:07:01,693 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 101 transitions. Word has length 6 [2022-11-20 21:07:01,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:07:01,693 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 101 transitions. [2022-11-20 21:07:01,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:07:01,694 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 101 transitions. [2022-11-20 21:07:01,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 21:07:01,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:07:01,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:07:01,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 21:07:01,695 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 21:07:01,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:07:01,696 INFO L85 PathProgramCache]: Analyzing trace with hash -334022198, now seen corresponding path program 1 times [2022-11-20 21:07:01,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:07:01,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156977054] [2022-11-20 21:07:01,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:07:01,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:07:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:07:02,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:07:02,055 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:07:02,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156977054] [2022-11-20 21:07:02,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156977054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:07:02,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:07:02,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 21:07:02,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660285202] [2022-11-20 21:07:02,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:07:02,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 21:07:02,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:07:02,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 21:07:02,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 21:07:02,058 INFO L87 Difference]: Start difference. First operand 72 states and 101 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:07:02,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:07:02,187 INFO L93 Difference]: Finished difference Result 137 states and 187 transitions. [2022-11-20 21:07:02,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 21:07:02,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-20 21:07:02,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:07:02,189 INFO L225 Difference]: With dead ends: 137 [2022-11-20 21:07:02,189 INFO L226 Difference]: Without dead ends: 83 [2022-11-20 21:07:02,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 21:07:02,190 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 27 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:07:02,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 34 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 21:07:02,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-20 21:07:02,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 73. [2022-11-20 21:07:02,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.6229508196721312) internal successors, (99), 72 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:07:02,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 99 transitions. [2022-11-20 21:07:02,200 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 99 transitions. Word has length 7 [2022-11-20 21:07:02,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:07:02,201 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 99 transitions. [2022-11-20 21:07:02,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:07:02,201 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 99 transitions. [2022-11-20 21:07:02,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 21:07:02,202 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:07:02,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:07:02,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 21:07:02,202 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 21:07:02,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:07:02,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1764753309, now seen corresponding path program 1 times [2022-11-20 21:07:02,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:07:02,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101663943] [2022-11-20 21:07:02,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:07:02,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:07:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:07:02,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:07:02,602 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:07:02,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101663943] [2022-11-20 21:07:02,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101663943] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:07:02,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:07:02,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 21:07:02,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840582414] [2022-11-20 21:07:02,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:07:02,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 21:07:02,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:07:02,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 21:07:02,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 21:07:02,605 INFO L87 Difference]: Start difference. First operand 73 states and 99 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:07:02,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:07:02,708 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2022-11-20 21:07:02,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 21:07:02,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-20 21:07:02,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:07:02,710 INFO L225 Difference]: With dead ends: 83 [2022-11-20 21:07:02,710 INFO L226 Difference]: Without dead ends: 80 [2022-11-20 21:07:02,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 21:07:02,712 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:07:02,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 37 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 21:07:02,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-20 21:07:02,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2022-11-20 21:07:02,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 62 states have (on average 1.5806451612903225) internal successors, (98), 73 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:07:02,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 98 transitions. [2022-11-20 21:07:02,722 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 98 transitions. Word has length 8 [2022-11-20 21:07:02,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:07:02,722 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 98 transitions. [2022-11-20 21:07:02,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:07:02,723 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2022-11-20 21:07:02,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-20 21:07:02,724 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:07:02,724 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:07:02,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 21:07:02,724 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 21:07:02,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:07:02,725 INFO L85 PathProgramCache]: Analyzing trace with hash -2077909877, now seen corresponding path program 1 times [2022-11-20 21:07:02,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:07:02,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095166701] [2022-11-20 21:07:02,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:07:02,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:07:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:07:02,866 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:07:02,866 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:07:02,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095166701] [2022-11-20 21:07:02,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095166701] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:07:02,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:07:02,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 21:07:02,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445997847] [2022-11-20 21:07:02,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:07:02,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 21:07:02,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:07:02,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 21:07:02,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 21:07:02,869 INFO L87 Difference]: Start difference. First operand 74 states and 98 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:07:02,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:07:02,904 INFO L93 Difference]: Finished difference Result 155 states and 206 transitions. [2022-11-20 21:07:02,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 21:07:02,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-20 21:07:02,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:07:02,905 INFO L225 Difference]: With dead ends: 155 [2022-11-20 21:07:02,905 INFO L226 Difference]: Without dead ends: 96 [2022-11-20 21:07:02,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 21:07:02,907 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 20 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 21:07:02,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 64 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 21:07:02,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-20 21:07:02,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2022-11-20 21:07:02,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 72 states have (on average 1.6111111111111112) internal successors, (116), 83 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:07:02,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2022-11-20 21:07:02,917 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 16 [2022-11-20 21:07:02,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:07:02,917 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2022-11-20 21:07:02,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:07:02,918 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2022-11-20 21:07:02,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-20 21:07:02,918 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:07:02,919 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:07:02,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 21:07:02,919 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 21:07:02,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:07:02,920 INFO L85 PathProgramCache]: Analyzing trace with hash -946674433, now seen corresponding path program 1 times [2022-11-20 21:07:02,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:07:02,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198939732] [2022-11-20 21:07:02,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:07:02,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:07:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:07:03,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:07:03,036 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:07:03,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198939732] [2022-11-20 21:07:03,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198939732] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:07:03,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:07:03,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 21:07:03,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808193608] [2022-11-20 21:07:03,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:07:03,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 21:07:03,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:07:03,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 21:07:03,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 21:07:03,039 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:07:03,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:07:03,084 INFO L93 Difference]: Finished difference Result 155 states and 198 transitions. [2022-11-20 21:07:03,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 21:07:03,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-20 21:07:03,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:07:03,086 INFO L225 Difference]: With dead ends: 155 [2022-11-20 21:07:03,086 INFO L226 Difference]: Without dead ends: 85 [2022-11-20 21:07:03,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 21:07:03,091 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 23 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 21:07:03,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 85 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 21:07:03,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-20 21:07:03,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 70. [2022-11-20 21:07:03,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 69 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:07:03,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2022-11-20 21:07:03,108 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 20 [2022-11-20 21:07:03,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:07:03,108 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2022-11-20 21:07:03,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:07:03,109 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2022-11-20 21:07:03,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-20 21:07:03,110 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:07:03,110 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:07:03,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 21:07:03,110 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 21:07:03,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:07:03,111 INFO L85 PathProgramCache]: Analyzing trace with hash 751304214, now seen corresponding path program 1 times [2022-11-20 21:07:03,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:07:03,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862023750] [2022-11-20 21:07:03,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:07:03,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:07:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:07:03,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:07:03,796 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:07:03,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862023750] [2022-11-20 21:07:03,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862023750] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:07:03,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619991016] [2022-11-20 21:07:03,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:07:03,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:07:03,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:07:03,803 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:07:03,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 21:07:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:07:03,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-20 21:07:03,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:07:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:07:05,304 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 21:07:05,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619991016] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:07:05,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 21:07:05,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2022-11-20 21:07:05,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132598172] [2022-11-20 21:07:05,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:07:05,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 21:07:05,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:07:05,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 21:07:05,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2022-11-20 21:07:05,307 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:07:05,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:07:05,418 INFO L93 Difference]: Finished difference Result 129 states and 170 transitions. [2022-11-20 21:07:05,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 21:07:05,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-20 21:07:05,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:07:05,420 INFO L225 Difference]: With dead ends: 129 [2022-11-20 21:07:05,420 INFO L226 Difference]: Without dead ends: 75 [2022-11-20 21:07:05,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=37, Unknown=0, NotChecked=0, Total=72 [2022-11-20 21:07:05,421 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:07:05,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 40 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 21:07:05,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-20 21:07:05,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2022-11-20 21:07:05,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 58 states have (on average 1.5517241379310345) internal successors, (90), 69 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:07:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2022-11-20 21:07:05,431 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 22 [2022-11-20 21:07:05,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:07:05,431 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2022-11-20 21:07:05,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:07:05,432 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2022-11-20 21:07:05,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 21:07:05,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:07:05,433 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:07:05,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 21:07:05,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:07:05,639 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 21:07:05,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:07:05,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1098712592, now seen corresponding path program 1 times [2022-11-20 21:07:05,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:07:05,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332428261] [2022-11-20 21:07:05,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:07:05,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:07:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:07:06,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:07:06,248 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:07:06,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332428261] [2022-11-20 21:07:06,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332428261] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:07:06,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890987127] [2022-11-20 21:07:06,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:07:06,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:07:06,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:07:06,250 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:07:06,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 21:07:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:07:06,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 21:07:06,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:07:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:07:07,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:07:08,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:07:08,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890987127] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:07:08,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1217496250] [2022-11-20 21:07:08,605 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-20 21:07:08,605 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:07:08,608 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 21:07:08,614 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 21:07:08,615 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 21:07:17,375 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 21:07:22,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1217496250] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:07:22,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:07:22,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4, 6, 6] total 27 [2022-11-20 21:07:22,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456375141] [2022-11-20 21:07:22,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:07:22,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 21:07:22,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:07:22,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 21:07:22,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=556, Unknown=0, NotChecked=0, Total=812 [2022-11-20 21:07:22,755 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:07:27,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:07:27,003 INFO L93 Difference]: Finished difference Result 172 states and 246 transitions. [2022-11-20 21:07:27,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 21:07:27,004 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-20 21:07:27,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:07:27,005 INFO L225 Difference]: With dead ends: 172 [2022-11-20 21:07:27,005 INFO L226 Difference]: Without dead ends: 118 [2022-11-20 21:07:27,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 37 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=386, Invalid=804, Unknown=0, NotChecked=0, Total=1190 [2022-11-20 21:07:27,009 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 42 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 21:07:27,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 52 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 199 Invalid, 0 Unknown, 53 Unchecked, 0.5s Time] [2022-11-20 21:07:27,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-20 21:07:27,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 113. [2022-11-20 21:07:27,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 112 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:07:27,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 145 transitions. [2022-11-20 21:07:27,037 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 145 transitions. Word has length 23 [2022-11-20 21:07:27,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:07:27,037 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 145 transitions. [2022-11-20 21:07:27,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:07:27,038 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 145 transitions. [2022-11-20 21:07:27,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-20 21:07:27,038 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:07:27,039 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:07:27,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 21:07:27,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:07:27,245 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 21:07:27,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:07:27,245 INFO L85 PathProgramCache]: Analyzing trace with hash -299647783, now seen corresponding path program 1 times [2022-11-20 21:07:27,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:07:27,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806179552] [2022-11-20 21:07:27,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:07:27,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:07:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:07:27,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:07:27,765 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:07:27,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806179552] [2022-11-20 21:07:27,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806179552] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:07:27,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216354657] [2022-11-20 21:07:27,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:07:27,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:07:27,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:07:27,767 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:07:27,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 21:07:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:07:27,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-20 21:07:27,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:07:28,981 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:07:28,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:07:30,753 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:07:30,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216354657] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:07:30,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1808299830] [2022-11-20 21:07:30,756 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-20 21:07:30,756 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:07:30,756 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 21:07:30,757 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 21:07:30,757 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 21:07:37,935 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 21:07:43,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1808299830] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:07:43,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:07:43,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [3, 7, 8] total 29 [2022-11-20 21:07:43,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632595662] [2022-11-20 21:07:43,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:07:43,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 21:07:43,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:07:43,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 21:07:43,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=624, Unknown=0, NotChecked=0, Total=930 [2022-11-20 21:07:43,247 INFO L87 Difference]: Start difference. First operand 113 states and 145 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:07:47,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:07:47,555 INFO L93 Difference]: Finished difference Result 120 states and 151 transitions. [2022-11-20 21:07:47,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 21:07:47,556 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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 24 [2022-11-20 21:07:47,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:07:47,557 INFO L225 Difference]: With dead ends: 120 [2022-11-20 21:07:47,558 INFO L226 Difference]: Without dead ends: 119 [2022-11-20 21:07:47,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 37 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=443, Invalid=889, Unknown=0, NotChecked=0, Total=1332 [2022-11-20 21:07:47,559 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 42 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 21:07:47,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 53 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 289 Invalid, 0 Unknown, 55 Unchecked, 0.6s Time] [2022-11-20 21:07:47,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-20 21:07:47,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2022-11-20 21:07:47,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 112 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:07:47,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 143 transitions. [2022-11-20 21:07:47,578 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 143 transitions. Word has length 24 [2022-11-20 21:07:47,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:07:47,578 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 143 transitions. [2022-11-20 21:07:47,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:07:47,579 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 143 transitions. [2022-11-20 21:07:47,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 21:07:47,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:07:47,580 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] [2022-11-20 21:07:47,591 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-20 21:07:47,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-20 21:07:47,785 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 21:07:47,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:07:47,786 INFO L85 PathProgramCache]: Analyzing trace with hash -699146446, now seen corresponding path program 1 times [2022-11-20 21:07:47,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:07:47,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431410615] [2022-11-20 21:07:47,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:07:47,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:07:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:07:48,464 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:07:48,465 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:07:48,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431410615] [2022-11-20 21:07:48,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431410615] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:07:48,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770543750] [2022-11-20 21:07:48,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:07:48,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:07:48,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:07:48,467 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:07:48,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 21:07:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:07:48,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-20 21:07:48,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:07:51,199 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:07:51,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:08:00,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:08:00,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770543750] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:08:00,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1652294621] [2022-11-20 21:08:00,528 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-20 21:08:00,528 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:08:00,529 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 21:08:00,529 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 21:08:00,529 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 21:08:07,188 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 21:08:12,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1652294621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:08:12,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:08:12,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5, 6, 7] total 28 [2022-11-20 21:08:12,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268154113] [2022-11-20 21:08:12,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:08:12,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-20 21:08:12,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:08:12,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-20 21:08:12,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=616, Unknown=0, NotChecked=0, Total=870 [2022-11-20 21:08:12,783 INFO L87 Difference]: Start difference. First operand 113 states and 143 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:08:17,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:08:17,172 INFO L93 Difference]: Finished difference Result 120 states and 149 transitions. [2022-11-20 21:08:17,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 21:08:17,173 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 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 25 [2022-11-20 21:08:17,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:08:17,176 INFO L225 Difference]: With dead ends: 120 [2022-11-20 21:08:17,176 INFO L226 Difference]: Without dead ends: 119 [2022-11-20 21:08:17,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 9 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=379, Invalid=881, Unknown=0, NotChecked=0, Total=1260 [2022-11-20 21:08:17,179 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 58 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-20 21:08:17,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 54 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 318 Invalid, 0 Unknown, 55 Unchecked, 0.7s Time] [2022-11-20 21:08:17,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-20 21:08:17,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2022-11-20 21:08:17,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 101 states have (on average 1.396039603960396) internal successors, (141), 112 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:08:17,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 141 transitions. [2022-11-20 21:08:17,196 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 141 transitions. Word has length 25 [2022-11-20 21:08:17,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:08:17,196 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 141 transitions. [2022-11-20 21:08:17,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:08:17,197 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 141 transitions. [2022-11-20 21:08:17,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-20 21:08:17,197 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:08:17,198 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:08:17,209 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-20 21:08:17,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:08:17,403 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 21:08:17,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:08:17,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1351812139, now seen corresponding path program 1 times [2022-11-20 21:08:17,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:08:17,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275546636] [2022-11-20 21:08:17,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:08:17,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:08:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:08:17,571 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:08:17,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:08:17,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275546636] [2022-11-20 21:08:17,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275546636] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:08:17,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518874785] [2022-11-20 21:08:17,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:08:17,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:08:17,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:08:17,573 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:08:17,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 21:08:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:08:17,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-20 21:08:17,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:08:17,698 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 21:08:17,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 21:08:17,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518874785] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:08:17,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 21:08:17,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-20 21:08:17,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070264353] [2022-11-20 21:08:17,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:08:17,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 21:08:17,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:08:17,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 21:08:17,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 21:08:17,704 INFO L87 Difference]: Start difference. First operand 113 states and 141 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:08:17,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:08:17,762 INFO L93 Difference]: Finished difference Result 180 states and 216 transitions. [2022-11-20 21:08:17,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 21:08:17,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-20 21:08:17,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:08:17,764 INFO L225 Difference]: With dead ends: 180 [2022-11-20 21:08:17,764 INFO L226 Difference]: Without dead ends: 125 [2022-11-20 21:08:17,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-20 21:08:17,768 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 29 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 21:08:17,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 147 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 21:08:17,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-20 21:08:17,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 113. [2022-11-20 21:08:17,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 101 states have (on average 1.3564356435643565) internal successors, (137), 112 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:08:17,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 137 transitions. [2022-11-20 21:08:17,785 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 137 transitions. Word has length 32 [2022-11-20 21:08:17,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:08:17,786 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 137 transitions. [2022-11-20 21:08:17,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:08:17,786 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 137 transitions. [2022-11-20 21:08:17,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-20 21:08:17,793 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:08:17,793 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:08:17,802 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-20 21:08:18,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 21:08:18,000 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 21:08:18,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:08:18,001 INFO L85 PathProgramCache]: Analyzing trace with hash -249000925, now seen corresponding path program 1 times [2022-11-20 21:08:18,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:08:18,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956859823] [2022-11-20 21:08:18,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:08:18,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:08:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:08:18,048 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-20 21:08:18,048 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:08:18,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956859823] [2022-11-20 21:08:18,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956859823] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:08:18,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 21:08:18,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 21:08:18,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921886944] [2022-11-20 21:08:18,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:08:18,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 21:08:18,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:08:18,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 21:08:18,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 21:08:18,051 INFO L87 Difference]: Start difference. First operand 113 states and 137 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:08:18,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:08:18,102 INFO L93 Difference]: Finished difference Result 188 states and 234 transitions. [2022-11-20 21:08:18,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 21:08:18,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-20 21:08:18,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:08:18,106 INFO L225 Difference]: With dead ends: 188 [2022-11-20 21:08:18,106 INFO L226 Difference]: Without dead ends: 134 [2022-11-20 21:08:18,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 21:08:18,107 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 25 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 21:08:18,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 67 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 21:08:18,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-20 21:08:18,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 125. [2022-11-20 21:08:18,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 113 states have (on average 1.345132743362832) internal successors, (152), 124 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:08:18,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2022-11-20 21:08:18,127 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 34 [2022-11-20 21:08:18,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:08:18,128 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2022-11-20 21:08:18,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:08:18,128 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2022-11-20 21:08:18,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-20 21:08:18,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:08:18,131 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:08:18,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 21:08:18,132 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 21:08:18,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:08:18,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2053411338, now seen corresponding path program 1 times [2022-11-20 21:08:18,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:08:18,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565405430] [2022-11-20 21:08:18,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:08:18,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:08:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:08:18,316 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:08:18,316 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:08:18,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565405430] [2022-11-20 21:08:18,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565405430] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:08:18,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159684416] [2022-11-20 21:08:18,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:08:18,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:08:18,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:08:18,318 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:08:18,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 21:08:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:08:18,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-20 21:08:18,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:08:19,599 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:08:19,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:08:20,497 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:08:20,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159684416] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:08:20,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [928463498] [2022-11-20 21:08:20,499 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-20 21:08:20,499 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:08:20,499 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 21:08:20,500 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 21:08:20,500 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 21:08:34,298 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 21:08:41,981 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4413#(and (<= 0 |ULTIMATE.start_main_~c1~0#1|) (or (and (= ~mode2~0 0) (<= 0 (+ ~p2_old~0 1)) (<= (+ ~p2_old~0 1) 0) (or (and (= ~send2~0 |ULTIMATE.start_node2_~m2~0#1|) (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|)) (and (not (= |ULTIMATE.start_node2_~m2~0#1| ~id2~0)) (<= 0 ~send2~0) (not (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|))))) (and (= ~mode2~0 1) (<= 0 ~send2~0) (exists ((v_~p2_new~0_68 Int)) (and (<= 0 (+ v_~p2_new~0_68 1)) (<= (+ v_~p2_new~0_68 1) 0) (= (ite (<= (mod (ite (and (not (= ~send2~0 ~nomsg~0)) (= v_~p2_new~0_68 ~nomsg~0)) ~send2~0 v_~p2_new~0_68) 256) 127) (mod (ite (and (not (= ~send2~0 ~nomsg~0)) (= v_~p2_new~0_68 ~nomsg~0)) ~send2~0 v_~p2_new~0_68) 256) (+ (- 256) (mod (ite (and (not (= ~send2~0 ~nomsg~0)) (= v_~p2_new~0_68 ~nomsg~0)) ~send2~0 v_~p2_new~0_68) 256))) ~p2_old~0))) (= ~nomsg~0 |ULTIMATE.start_node2_~m2~0#1|))) (<= 0 ~id3~0) (= ~nomsg~0 ~p1_new~0) (<= 0 ~mode1~0) (<= 1 |ULTIMATE.start_init_~tmp~0#1|) (<= 0 ~id1~0) (= ~p2~0 0) (<= |ULTIMATE.start_init_~tmp~0#1| 1) (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= ~p3_new~0 ~nomsg~0) (<= |ULTIMATE.start_init_#res#1| 1) (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (= |ULTIMATE.start_main_~i2~0#1| 0) (<= |ULTIMATE.start_main_~c1~0#1| 1) (<= ~id1~0 127) (= ~nomsg~0 ~p2_new~0) (<= ~st1~0 1) (<= (+ ~nomsg~0 1) 0) (<= ~mode1~0 1) (<= 1 |ULTIMATE.start_init_#res#1|) (not (<= (+ ~st2~0 ~st1~0) 2147483647)) (<= ~id3~0 127) (<= 0 ~id2~0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 127) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= ~p3~0 0) (or (and (= ~mode3~0 1) (exists ((v_~p3_new~0_60 Int)) (and (<= 0 (+ v_~p3_new~0_60 1)) (<= (+ v_~p3_new~0_60 1) 0) (= ~p3_old~0 (ite (<= (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_60 ~nomsg~0)) ~send3~0 v_~p3_new~0_60) 256) 127) (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_60 ~nomsg~0)) ~send3~0 v_~p3_new~0_60) 256) (+ (- 256) (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_60 ~nomsg~0)) ~send3~0 v_~p3_new~0_60) 256)))))) (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|) (<= 0 ~st3~0) (<= 0 ~send3~0)) (and (<= 0 (+ ~p3_old~0 1)) (or (and (not (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|)) (or (= ~st3~0 1) (and (<= 0 ~st3~0) (not (= ~id3~0 |ULTIMATE.start_node3_~m3~0#1|)))) (<= 0 ~send3~0)) (and (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|) (= ~send3~0 |ULTIMATE.start_node3_~m3~0#1|) (<= 0 ~st3~0))) (<= (+ ~p3_old~0 1) 0) (= ~mode3~0 0))) (= ~p1~0 0) (<= 0 |#StackHeapBarrier|) (<= 0 ~send1~0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-20 21:08:41,981 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 21:08:41,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:08:41,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 22 [2022-11-20 21:08:41,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508844836] [2022-11-20 21:08:41,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:08:41,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 21:08:41,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:08:41,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 21:08:41,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1541, Unknown=0, NotChecked=0, Total=1806 [2022-11-20 21:08:41,984 INFO L87 Difference]: Start difference. First operand 125 states and 152 transitions. Second operand has 23 states, 22 states have (on average 5.136363636363637) internal successors, (113), 23 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:08:43,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:08:43,585 INFO L93 Difference]: Finished difference Result 269 states and 298 transitions. [2022-11-20 21:08:43,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 21:08:43,585 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.136363636363637) internal successors, (113), 23 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-20 21:08:43,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:08:43,587 INFO L225 Difference]: With dead ends: 269 [2022-11-20 21:08:43,587 INFO L226 Difference]: Without dead ends: 266 [2022-11-20 21:08:43,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1329 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=500, Invalid=3406, Unknown=0, NotChecked=0, Total=3906 [2022-11-20 21:08:43,589 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 813 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-20 21:08:43,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 93 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-20 21:08:43,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-11-20 21:08:43,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 123. [2022-11-20 21:08:43,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 122 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:08:43,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 146 transitions. [2022-11-20 21:08:43,612 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 146 transitions. Word has length 38 [2022-11-20 21:08:43,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:08:43,613 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 146 transitions. [2022-11-20 21:08:43,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.136363636363637) internal successors, (113), 23 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:08:43,613 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 146 transitions. [2022-11-20 21:08:43,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-20 21:08:43,614 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:08:43,614 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:08:43,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 21:08:43,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:08:43,820 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 21:08:43,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:08:43,821 INFO L85 PathProgramCache]: Analyzing trace with hash 768758195, now seen corresponding path program 1 times [2022-11-20 21:08:43,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:08:43,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834537286] [2022-11-20 21:08:43,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:08:43,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:08:43,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:08:43,985 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:08:43,986 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:08:43,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834537286] [2022-11-20 21:08:43,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834537286] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:08:43,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211520557] [2022-11-20 21:08:43,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:08:43,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:08:43,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:08:43,991 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:08:44,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 21:08:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:08:44,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-20 21:08:44,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:08:45,326 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:08:45,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:08:46,305 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:08:46,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211520557] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:08:46,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1177843216] [2022-11-20 21:08:46,307 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-20 21:08:46,307 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:08:46,308 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 21:08:46,308 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 21:08:46,308 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 21:09:03,848 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 21:09:10,853 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5208#(and (<= 0 |ULTIMATE.start_main_~c1~0#1|) (<= 0 ~id3~0) (<= 0 (+ ~p3_new~0 1)) (<= 0 ~mode1~0) (<= 1 |ULTIMATE.start_init_~tmp~0#1|) (<= 0 ~id1~0) (= ~p2~0 0) (<= (+ ~p1_new~0 1) 0) (<= |ULTIMATE.start_init_~tmp~0#1| 1) (<= 0 ~mode3~0) (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (<= |ULTIMATE.start_init_#res#1| 1) (<= ~mode2~0 1) (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (= |ULTIMATE.start_main_~i2~0#1| 0) (<= 0 ~st2~0) (<= ~mode3~0 1) (<= |ULTIMATE.start_main_~c1~0#1| 1) (<= 0 ~send2~0) (<= ~id1~0 127) (<= 0 (+ ~p2_new~0 1)) (<= (+ ~nomsg~0 1) 0) (<= ~mode1~0 1) (<= (+ ~p2_new~0 1) 0) (<= 1 |ULTIMATE.start_init_#res#1|) (not (<= 0 (+ ~st2~0 ~st1~0 2147483648))) (<= ~id3~0 127) (<= 0 ~id2~0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= 0 ~mode2~0) (<= ~id2~0 127) (<= 0 ~st3~0) (<= (+ ~p3_new~0 1) 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= ~p3~0 0) (<= 0 (+ ~p1_new~0 1)) (<= 0 ~send3~0) (= ~p1~0 0) (<= 0 |#StackHeapBarrier|) (<= 0 ~send1~0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-20 21:09:10,853 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 21:09:10,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:09:10,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 22 [2022-11-20 21:09:10,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109331257] [2022-11-20 21:09:10,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:09:10,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 21:09:10,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:09:10,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 21:09:10,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1540, Unknown=0, NotChecked=0, Total=1806 [2022-11-20 21:09:10,855 INFO L87 Difference]: Start difference. First operand 123 states and 146 transitions. Second operand has 23 states, 22 states have (on average 5.2272727272727275) internal successors, (115), 23 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:09:11,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:09:11,532 INFO L93 Difference]: Finished difference Result 161 states and 179 transitions. [2022-11-20 21:09:11,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 21:09:11,533 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.2272727272727275) internal successors, (115), 23 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-20 21:09:11,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:09:11,534 INFO L225 Difference]: With dead ends: 161 [2022-11-20 21:09:11,534 INFO L226 Difference]: Without dead ends: 158 [2022-11-20 21:09:11,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=415, Invalid=2237, Unknown=0, NotChecked=0, Total=2652 [2022-11-20 21:09:11,536 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 484 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 21:09:11,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 53 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-20 21:09:11,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-11-20 21:09:11,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 120. [2022-11-20 21:09:11,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 113 states have (on average 1.2300884955752212) internal successors, (139), 119 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:09:11,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 139 transitions. [2022-11-20 21:09:11,564 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 139 transitions. Word has length 39 [2022-11-20 21:09:11,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:09:11,565 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 139 transitions. [2022-11-20 21:09:11,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.2272727272727275) internal successors, (115), 23 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:09:11,565 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 139 transitions. [2022-11-20 21:09:11,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-20 21:09:11,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:09:11,566 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:09:11,577 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-20 21:09:11,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:09:11,772 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 21:09:11,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:09:11,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1938299496, now seen corresponding path program 1 times [2022-11-20 21:09:11,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:09:11,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943500261] [2022-11-20 21:09:11,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:09:11,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:09:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:09:12,324 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:09:12,324 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:09:12,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943500261] [2022-11-20 21:09:12,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943500261] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:09:12,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802519476] [2022-11-20 21:09:12,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:09:12,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:09:12,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:09:12,327 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:09:12,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 21:09:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:09:12,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-20 21:09:12,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:09:17,149 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:09:17,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:09:23,350 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:09:23,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802519476] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:09:23,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1716034165] [2022-11-20 21:09:23,352 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-20 21:09:23,353 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:09:23,353 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 21:09:23,353 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 21:09:23,353 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 21:09:36,380 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 21:09:44,300 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5854#(and (<= 0 |ULTIMATE.start_main_~c1~0#1|) (or (and (<= 0 (+ ~p3_old~0 1)) (or (and (or (= ~st3~0 1) (not (= ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (not (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|)) (<= 0 ~send3~0)) (and (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|) (= ~send3~0 |ULTIMATE.start_node3_~m3~0#1|))) (<= (+ ~p3_old~0 1) 0) (= ~mode3~0 0)) (and (= ~mode3~0 1) (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|) (exists ((v_~p3_new~0_89 Int)) (and (<= (+ v_~p3_new~0_89 1) 0) (= (ite (<= (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_89 ~nomsg~0)) ~send3~0 v_~p3_new~0_89) 256) 127) (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_89 ~nomsg~0)) ~send3~0 v_~p3_new~0_89) 256) (+ (mod (ite (and (not (= ~send3~0 ~nomsg~0)) (= v_~p3_new~0_89 ~nomsg~0)) ~send3~0 v_~p3_new~0_89) 256) (- 256))) ~p3_old~0) (<= 0 (+ v_~p3_new~0_89 1)))) (<= 0 ~send3~0))) (<= 0 ~id3~0) (= ~nomsg~0 ~p1_new~0) (<= 0 (+ ~st2~0 ~st1~0 2147483648)) (<= 0 ~mode1~0) (<= 1 |ULTIMATE.start_init_~tmp~0#1|) (<= 0 ~id1~0) (= ~p2~0 0) (<= |ULTIMATE.start_init_~tmp~0#1| 1) (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= ~p3_new~0 ~nomsg~0) (<= |ULTIMATE.start_init_#res#1| 1) (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= (+ ~st2~0 ~st1~0) 2147483647) (= |ULTIMATE.start_main_~i2~0#1| 0) (<= |ULTIMATE.start_main_~c1~0#1| 1) (<= ~id1~0 127) (= ~nomsg~0 ~p2_new~0) (<= ~st1~0 1) (not (<= (+ ~st3~0 ~st2~0 ~st1~0) 2147483647)) (<= (+ ~nomsg~0 1) 0) (<= ~mode1~0 1) (<= 1 |ULTIMATE.start_init_#res#1|) (<= ~id3~0 127) (<= 0 ~id2~0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 127) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= ~p3~0 0) (= ~p1~0 0) (<= 0 |#StackHeapBarrier|) (<= 0 ~send1~0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0) (or (and (= ~mode2~0 1) (<= 0 ~st2~0) (<= 0 ~send2~0) (= ~nomsg~0 |ULTIMATE.start_node2_~m2~0#1|) (exists ((v_~p2_new~0_97 Int)) (and (<= (+ v_~p2_new~0_97 1) 0) (= ~p2_old~0 (ite (<= (mod (ite (and (= v_~p2_new~0_97 ~nomsg~0) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_97) 256) 127) (mod (ite (and (= v_~p2_new~0_97 ~nomsg~0) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_97) 256) (+ (- 256) (mod (ite (and (= v_~p2_new~0_97 ~nomsg~0) (not (= ~send2~0 ~nomsg~0))) ~send2~0 v_~p2_new~0_97) 256)))) (<= 0 (+ v_~p2_new~0_97 1))))) (and (= ~mode2~0 0) (<= 0 (+ ~p2_old~0 1)) (or (and (<= 0 ~st2~0) (= ~send2~0 |ULTIMATE.start_node2_~m2~0#1|) (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|)) (and (<= 0 ~send2~0) (or (= ~st2~0 1) (and (not (= |ULTIMATE.start_node2_~m2~0#1| ~id2~0)) (<= 0 ~st2~0))) (not (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|)))) (<= (+ ~p2_old~0 1) 0))))' at error location [2022-11-20 21:09:44,300 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 21:09:44,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:09:44,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 23 [2022-11-20 21:09:44,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466968996] [2022-11-20 21:09:44,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:09:44,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-20 21:09:44,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:09:44,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-20 21:09:44,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1583, Unknown=0, NotChecked=0, Total=1980 [2022-11-20 21:09:44,303 INFO L87 Difference]: Start difference. First operand 120 states and 139 transitions. Second operand has 25 states, 24 states have (on average 5.0) internal successors, (120), 24 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:09:48,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:09:48,597 INFO L93 Difference]: Finished difference Result 359 states and 418 transitions. [2022-11-20 21:09:48,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 21:09:48,597 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.0) internal successors, (120), 24 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-20 21:09:48,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:09:48,599 INFO L225 Difference]: With dead ends: 359 [2022-11-20 21:09:48,599 INFO L226 Difference]: Without dead ends: 298 [2022-11-20 21:09:48,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1552 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=712, Invalid=3578, Unknown=0, NotChecked=0, Total=4290 [2022-11-20 21:09:48,601 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 862 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 21:09:48,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 115 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-20 21:09:48,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-11-20 21:09:48,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 186. [2022-11-20 21:09:48,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 181 states have (on average 1.12707182320442) internal successors, (204), 185 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:09:48,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 204 transitions. [2022-11-20 21:09:48,647 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 204 transitions. Word has length 40 [2022-11-20 21:09:48,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:09:48,648 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 204 transitions. [2022-11-20 21:09:48,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.0) internal successors, (120), 24 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:09:48,648 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 204 transitions. [2022-11-20 21:09:48,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-20 21:09:48,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:09:48,649 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:09:48,654 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 21:09:48,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 21:09:48,853 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 21:09:48,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:09:48,853 INFO L85 PathProgramCache]: Analyzing trace with hash 42258005, now seen corresponding path program 1 times [2022-11-20 21:09:48,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:09:48,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81769978] [2022-11-20 21:09:48,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:09:48,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:09:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:09:49,116 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:09:49,116 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:09:49,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81769978] [2022-11-20 21:09:49,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81769978] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:09:49,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526373906] [2022-11-20 21:09:49,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:09:49,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:09:49,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:09:49,118 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:09:49,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 21:09:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:09:49,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-20 21:09:49,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:09:53,714 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:09:53,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:09:59,098 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:09:59,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526373906] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:09:59,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [162279005] [2022-11-20 21:09:59,103 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-20 21:09:59,103 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:09:59,103 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 21:09:59,104 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 21:09:59,104 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 21:10:12,049 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 21:10:19,141 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6849#(and (<= 0 |ULTIMATE.start_main_~c1~0#1|) (<= 0 ~id3~0) (<= 0 (+ ~p3_new~0 1)) (not (<= 0 (+ ~st3~0 ~st2~0 ~st1~0 2147483648))) (<= 0 ~mode1~0) (<= 1 |ULTIMATE.start_init_~tmp~0#1|) (<= 0 ~id1~0) (= ~p2~0 0) (<= (+ ~p1_new~0 1) 0) (<= |ULTIMATE.start_init_~tmp~0#1| 1) (<= 0 ~mode3~0) (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (<= |ULTIMATE.start_init_#res#1| 1) (<= ~mode2~0 1) (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (= |ULTIMATE.start_main_~i2~0#1| 0) (<= 0 ~st2~0) (<= ~mode3~0 1) (<= |ULTIMATE.start_main_~c1~0#1| 1) (<= 0 ~send2~0) (<= ~id1~0 127) (<= 0 (+ ~p2_new~0 1)) (<= (+ ~nomsg~0 1) 0) (<= ~mode1~0 1) (<= (+ ~p2_new~0 1) 0) (<= 1 |ULTIMATE.start_init_#res#1|) (<= ~id3~0 127) (<= 0 ~id2~0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= 0 ~mode2~0) (<= ~id2~0 127) (<= 0 ~st3~0) (<= (+ ~p3_new~0 1) 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= ~p3~0 0) (<= 0 (+ ~p1_new~0 1)) (<= 0 ~send3~0) (= ~p1~0 0) (<= 0 |#StackHeapBarrier|) (<= 0 ~send1~0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-20 21:10:19,141 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 21:10:19,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:10:19,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 23 [2022-11-20 21:10:19,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758089005] [2022-11-20 21:10:19,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:10:19,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-20 21:10:19,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:10:19,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-20 21:10:19,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=1609, Unknown=0, NotChecked=0, Total=1892 [2022-11-20 21:10:19,143 INFO L87 Difference]: Start difference. First operand 186 states and 204 transitions. Second operand has 24 states, 23 states have (on average 5.260869565217392) internal successors, (121), 24 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:10:20,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:10:20,351 INFO L93 Difference]: Finished difference Result 186 states and 204 transitions. [2022-11-20 21:10:20,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 21:10:20,352 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.260869565217392) internal successors, (121), 24 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-11-20 21:10:20,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:10:20,353 INFO L225 Difference]: With dead ends: 186 [2022-11-20 21:10:20,353 INFO L226 Difference]: Without dead ends: 183 [2022-11-20 21:10:20,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=441, Invalid=2315, Unknown=0, NotChecked=0, Total=2756 [2022-11-20 21:10:20,355 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 429 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-20 21:10:20,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 67 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-20 21:10:20,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-20 21:10:20,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 168. [2022-11-20 21:10:20,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 166 states have (on average 1.0843373493975903) internal successors, (180), 167 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:10:20,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 180 transitions. [2022-11-20 21:10:20,403 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 180 transitions. Word has length 41 [2022-11-20 21:10:20,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:10:20,404 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 180 transitions. [2022-11-20 21:10:20,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.260869565217392) internal successors, (121), 24 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:10:20,404 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 180 transitions. [2022-11-20 21:10:20,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 21:10:20,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:10:20,405 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:10:20,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 21:10:20,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 21:10:20,611 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 21:10:20,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:10:20,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1820342745, now seen corresponding path program 2 times [2022-11-20 21:10:20,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:10:20,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064978214] [2022-11-20 21:10:20,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:10:20,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:10:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:10:22,126 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:10:22,127 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:10:22,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064978214] [2022-11-20 21:10:22,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064978214] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:10:22,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15208733] [2022-11-20 21:10:22,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 21:10:22,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:10:22,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:10:22,128 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:10:22,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 21:10:22,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-20 21:10:22,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:10:22,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-20 21:10:22,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:10:29,580 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:10:29,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:10:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:10:46,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15208733] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:10:46,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [729725775] [2022-11-20 21:10:46,721 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-20 21:10:46,721 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:10:46,722 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 21:10:46,722 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 21:10:46,722 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 21:11:04,061 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 21:11:11,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [729725775] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 21:11:11,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:11:11,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [11, 11, 13] total 50 [2022-11-20 21:11:11,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014474783] [2022-11-20 21:11:11,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 21:11:11,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 21:11:11,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:11:11,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 21:11:11,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=691, Invalid=1961, Unknown=0, NotChecked=0, Total=2652 [2022-11-20 21:11:11,452 INFO L87 Difference]: Start difference. First operand 168 states and 180 transitions. Second operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:11:17,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:11:17,149 INFO L93 Difference]: Finished difference Result 237 states and 257 transitions. [2022-11-20 21:11:17,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 21:11:17,150 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-11-20 21:11:17,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:11:17,151 INFO L225 Difference]: With dead ends: 237 [2022-11-20 21:11:17,151 INFO L226 Difference]: Without dead ends: 181 [2022-11-20 21:11:17,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 114 SyntacticMatches, 11 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2092 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=1064, Invalid=2968, Unknown=0, NotChecked=0, Total=4032 [2022-11-20 21:11:17,153 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 85 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-20 21:11:17,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 22 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 175 Invalid, 0 Unknown, 50 Unchecked, 0.3s Time] [2022-11-20 21:11:17,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-20 21:11:17,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 167. [2022-11-20 21:11:17,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 1.0602409638554218) internal successors, (176), 166 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:11:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 176 transitions. [2022-11-20 21:11:17,209 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 176 transitions. Word has length 55 [2022-11-20 21:11:17,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:11:17,209 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 176 transitions. [2022-11-20 21:11:17,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:11:17,209 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 176 transitions. [2022-11-20 21:11:17,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-20 21:11:17,210 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 21:11:17,210 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:11:17,217 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 21:11:17,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 21:11:17,417 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2022-11-20 21:11:17,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 21:11:17,417 INFO L85 PathProgramCache]: Analyzing trace with hash -780996640, now seen corresponding path program 2 times [2022-11-20 21:11:17,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 21:11:17,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651075357] [2022-11-20 21:11:17,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 21:11:17,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 21:11:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 21:11:21,373 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:11:21,373 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 21:11:21,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651075357] [2022-11-20 21:11:21,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651075357] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 21:11:21,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503692920] [2022-11-20 21:11:21,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 21:11:21,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:11:21,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 21:11:21,375 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 21:11:21,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 21:11:21,613 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-20 21:11:21,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 21:11:21,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-20 21:11:21,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 21:12:15,285 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:12:15,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 21:13:36,412 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 4 proven. 166 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 21:13:36,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503692920] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 21:13:36,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [33308751] [2022-11-20 21:13:36,414 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2022-11-20 21:13:36,414 INFO L166 IcfgInterpreter]: Building call graph [2022-11-20 21:13:36,414 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-20 21:13:36,414 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-20 21:13:36,414 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-20 21:13:49,704 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-20 21:13:58,854 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8811#(and (or (and (<= 0 (+ ~p3_old~0 1)) (or (and (or (= ~st3~0 1) (not (= ~id3~0 |ULTIMATE.start_node3_~m3~0#1|))) (not (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|)) (<= 0 ~send3~0)) (and (< ~id3~0 |ULTIMATE.start_node3_~m3~0#1|) (= ~send3~0 |ULTIMATE.start_node3_~m3~0#1|))) (<= (+ ~p3_old~0 1) 0) (= ~mode3~0 0)) (and (= ~mode3~0 1) (= ~nomsg~0 |ULTIMATE.start_node3_~m3~0#1|) (<= 0 ~send3~0) (exists ((v_~p3_new~0_134 Int)) (and (= ~p3_old~0 (ite (<= (mod (ite (and (= ~nomsg~0 v_~p3_new~0_134) (not (= ~send3~0 ~nomsg~0))) ~send3~0 v_~p3_new~0_134) 256) 127) (mod (ite (and (= ~nomsg~0 v_~p3_new~0_134) (not (= ~send3~0 ~nomsg~0))) ~send3~0 v_~p3_new~0_134) 256) (+ (mod (ite (and (= ~nomsg~0 v_~p3_new~0_134) (not (= ~send3~0 ~nomsg~0))) ~send3~0 v_~p3_new~0_134) 256) (- 256)))) (<= (+ v_~p3_new~0_134 1) 0) (<= 0 (+ v_~p3_new~0_134 1)))))) (<= 0 |ULTIMATE.start_main_~c1~0#1|) (<= 0 ~id3~0) (= ~nomsg~0 ~p1_new~0) (<= 0 (+ ~st2~0 ~st1~0 2147483648)) (<= 0 ~mode1~0) (<= 1 |ULTIMATE.start_init_~tmp~0#1|) (<= 0 ~id1~0) (= ~p2~0 0) (<= |ULTIMATE.start_init_~tmp~0#1| 1) (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|) (= ~p3_new~0 ~nomsg~0) (<= |ULTIMATE.start_init_#res#1| 1) (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= (+ ~st2~0 ~st1~0) 2147483647) (= |ULTIMATE.start_main_~i2~0#1| 0) (<= |ULTIMATE.start_main_~c1~0#1| 1) (<= ~id1~0 127) (= ~nomsg~0 ~p2_new~0) (<= ~st1~0 1) (not (<= (+ ~st3~0 ~st2~0 ~st1~0) 2147483647)) (<= (+ ~nomsg~0 1) 0) (<= ~mode1~0 1) (<= 1 |ULTIMATE.start_init_#res#1|) (<= ~id3~0 127) (<= 0 ~id2~0) (= |#NULL.offset| 0) (<= 0 (+ ~nomsg~0 1)) (<= ~id2~0 127) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= ~p3~0 0) (or (and (= ~mode2~0 1) (<= 0 ~st2~0) (<= 0 ~send2~0) (= ~nomsg~0 |ULTIMATE.start_node2_~m2~0#1|) (exists ((v_~p2_new~0_142 Int)) (and (<= (+ v_~p2_new~0_142 1) 0) (<= 0 (+ v_~p2_new~0_142 1)) (= (ite (<= (mod (ite (and (not (= ~send2~0 ~nomsg~0)) (= ~nomsg~0 v_~p2_new~0_142)) ~send2~0 v_~p2_new~0_142) 256) 127) (mod (ite (and (not (= ~send2~0 ~nomsg~0)) (= ~nomsg~0 v_~p2_new~0_142)) ~send2~0 v_~p2_new~0_142) 256) (+ (- 256) (mod (ite (and (not (= ~send2~0 ~nomsg~0)) (= ~nomsg~0 v_~p2_new~0_142)) ~send2~0 v_~p2_new~0_142) 256))) ~p2_old~0)))) (and (= ~mode2~0 0) (<= 0 (+ ~p2_old~0 1)) (or (and (<= 0 ~st2~0) (= ~send2~0 |ULTIMATE.start_node2_~m2~0#1|) (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|)) (and (<= 0 ~send2~0) (or (= ~st2~0 1) (and (not (= |ULTIMATE.start_node2_~m2~0#1| ~id2~0)) (<= 0 ~st2~0))) (not (< ~id2~0 |ULTIMATE.start_node2_~m2~0#1|)))) (<= (+ ~p2_old~0 1) 0))) (= ~p1~0 0) (<= 0 |#StackHeapBarrier|) (<= 0 ~send1~0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |#NULL.base| 0))' at error location [2022-11-20 21:13:58,854 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-20 21:13:58,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 21:13:58,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19, 21] total 49 [2022-11-20 21:13:58,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834623567] [2022-11-20 21:13:58,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 21:13:58,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-20 21:13:58,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 21:13:58,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-20 21:13:58,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=876, Invalid=4094, Unknown=0, NotChecked=0, Total=4970 [2022-11-20 21:13:58,858 INFO L87 Difference]: Start difference. First operand 167 states and 176 transitions. Second operand has 51 states, 50 states have (on average 5.3) internal successors, (265), 50 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:14:09,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 21:14:09,225 INFO L93 Difference]: Finished difference Result 313 states and 329 transitions. [2022-11-20 21:14:09,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-20 21:14:09,226 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 5.3) internal successors, (265), 50 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2022-11-20 21:14:09,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 21:14:09,226 INFO L225 Difference]: With dead ends: 313 [2022-11-20 21:14:09,226 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 21:14:09,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 176 SyntacticMatches, 31 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5088 ImplicationChecksByTransitivity, 35.2s TimeCoverageRelationStatistics Valid=1726, Invalid=7204, Unknown=0, NotChecked=0, Total=8930 [2022-11-20 21:14:09,231 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1450 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1450 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-20 21:14:09,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1450 Valid, 178 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-20 21:14:09,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 21:14:09,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 21:14:09,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:14:09,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 21:14:09,232 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2022-11-20 21:14:09,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 21:14:09,233 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 21:14:09,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 5.3) internal successors, (265), 50 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 21:14:09,233 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 21:14:09,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 21:14:09,236 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 14 remaining) [2022-11-20 21:14:09,236 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 14 remaining) [2022-11-20 21:14:09,236 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 14 remaining) [2022-11-20 21:14:09,237 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 14 remaining) [2022-11-20 21:14:09,237 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 14 remaining) [2022-11-20 21:14:09,237 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 14 remaining) [2022-11-20 21:14:09,237 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 14 remaining) [2022-11-20 21:14:09,237 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 14 remaining) [2022-11-20 21:14:09,238 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 14 remaining) [2022-11-20 21:14:09,238 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 14 remaining) [2022-11-20 21:14:09,238 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 14 remaining) [2022-11-20 21:14:09,238 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 14 remaining) [2022-11-20 21:14:09,238 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 14 remaining) [2022-11-20 21:14:09,239 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 14 remaining) [2022-11-20 21:14:09,250 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 21:14:09,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 21:14:09,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-20 21:14:23,234 WARN L233 SmtUtils]: Spent 11.96s on a formula simplification. DAG size of input: 497 DAG size of output: 467 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-20 21:14:34,876 WARN L233 SmtUtils]: Spent 6.90s on a formula simplification. DAG size of input: 513 DAG size of output: 175 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-20 21:14:45,001 WARN L233 SmtUtils]: Spent 5.22s on a formula simplification. DAG size of input: 482 DAG size of output: 115 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-20 21:14:48,751 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 207) no Hoare annotation was computed. [2022-11-20 21:14:48,751 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-11-20 21:14:48,751 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 211) no Hoare annotation was computed. [2022-11-20 21:14:48,752 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 211) no Hoare annotation was computed. [2022-11-20 21:14:48,752 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 216) no Hoare annotation was computed. [2022-11-20 21:14:48,752 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-20 21:14:48,752 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 216) no Hoare annotation was computed. [2022-11-20 21:14:48,752 INFO L899 garLoopResultBuilder]: For program point L207(line 207) no Hoare annotation was computed. [2022-11-20 21:14:48,752 INFO L899 garLoopResultBuilder]: For program point L207-1(line 207) no Hoare annotation was computed. [2022-11-20 21:14:48,752 INFO L899 garLoopResultBuilder]: For program point L207-2(line 207) no Hoare annotation was computed. [2022-11-20 21:14:48,752 INFO L899 garLoopResultBuilder]: For program point L207-3(line 207) no Hoare annotation was computed. [2022-11-20 21:14:48,753 INFO L899 garLoopResultBuilder]: For program point L207-4(lines 207 226) no Hoare annotation was computed. [2022-11-20 21:14:48,753 INFO L895 garLoopResultBuilder]: At program point L207-5(lines 207 226) the Hoare annotation is: (let ((.cse53 (+ ~p3_new~0 1)) (.cse5 (= ~st2~0 1)) (.cse54 (+ ~p2_new~0 1))) (let ((.cse1 (= ~mode2~0 0)) (.cse13 (= ~nomsg~0 ~p2_old~0)) (.cse22 (= ~nomsg~0 ~p1_old~0)) (.cse23 (<= 0 .cse54)) (.cse24 (<= (+ ~nomsg~0 1) 0)) (.cse27 (= ~mode1~0 0)) (.cse33 (<= 0 (+ 2147483645 ~st1~0))) (.cse48 (<= 0 ~st1~0)) (.cse0 (<= 0 |ULTIMATE.start_main_~c1~0#1|)) (.cse47 (or .cse5 (= ~st2~0 0))) (.cse2 (<= 0 ~id3~0)) (.cse3 (= ~nomsg~0 ~p1_new~0)) (.cse4 (<= 0 .cse53)) (.cse6 (<= 1 |ULTIMATE.start_init_~tmp~0#1|)) (.cse7 (<= |ULTIMATE.start_check_~tmp~1#1| 1)) (.cse8 (<= 0 ~id1~0)) (.cse9 (<= |ULTIMATE.start_init_~tmp~0#1| 1)) (.cse10 (<= 0 ~mode3~0)) (.cse11 (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse12 (<= |ULTIMATE.start_init_#res#1| 1)) (.cse14 (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse15 (<= (+ ~st3~0 ~st2~0 ~st1~0) 1)) (.cse16 (= |ULTIMATE.start_main_~i2~0#1| 0)) (.cse17 (<= ~mode3~0 1)) (.cse18 (<= 0 ~p2~0)) (.cse19 (<= |ULTIMATE.start_main_~c1~0#1| 1)) (.cse20 (<= 0 ~send2~0)) (.cse21 (<= ~id1~0 127)) (.cse25 (<= .cse54 0)) (.cse26 (<= 1 |ULTIMATE.start_init_#res#1|)) (.cse28 (<= 0 |ULTIMATE.start_check_~tmp~1#1|)) (.cse29 (<= ~id3~0 127)) (.cse30 (<= ~st3~0 1)) (.cse31 (<= 0 ~id2~0)) (.cse32 (= |#NULL.offset| 0)) (.cse34 (<= ~p2~0 0)) (.cse35 (<= ~id2~0 127)) (.cse36 (<= 0 ~st3~0)) (.cse37 (<= .cse53 0)) (.cse38 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse39 (= ~p3~0 0)) (.cse40 (<= 0 (+ ~p1_new~0 1))) (.cse41 (<= 0 ~send3~0)) (.cse42 (= ~p1~0 0)) (.cse43 (<= 0 |#StackHeapBarrier|)) (.cse44 (<= 0 ~send1~0)) (.cse45 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse46 (= |#NULL.base| 0))) (or (and .cse0 (not (<= ~r1~0 (+ (* (div ~r1~0 256) 256) 2))) .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 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse0 .cse1 .cse47 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse48 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (and (= |ULTIMATE.start_check_~tmp~1#1| 0) .cse27) (and (or .cse5 .cse48) .cse33 (let ((.cse49 (= ~mode2~0 1)) (.cse50 (<= 0 (+ ~st2~0 ~st1~0 2147483648))) (.cse51 (= ~mode1~0 1)) (.cse52 (= ~nomsg~0 ~p2_new~0))) (or (and .cse0 .cse47 .cse2 .cse3 .cse4 .cse49 .cse50 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse48 .cse16 .cse17 .cse18 .cse19 .cse20 .cse51 .cse21 .cse52 .cse25 .cse26 .cse28 .cse29 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46) (and .cse0 .cse47 .cse2 .cse3 .cse4 .cse49 .cse50 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse51 .cse21 .cse52 .cse25 .cse26 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36 (not (< (mod ~r1~0 256) 3)) .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46))))))) [2022-11-20 21:14:48,753 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 207) no Hoare annotation was computed. [2022-11-20 21:14:48,753 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 75) no Hoare annotation was computed. [2022-11-20 21:14:48,754 INFO L895 garLoopResultBuilder]: At program point L59-2(lines 53 78) the Hoare annotation is: (let ((.cse42 (+ ~nomsg~0 1)) (.cse43 (+ ~p2_new~0 1)) (.cse40 (= ~st2~0 0)) (.cse41 (+ ~p3_new~0 1))) (let ((.cse0 (<= 0 |ULTIMATE.start_main_~c1~0#1|)) (.cse1 (<= 0 ~id3~0)) (.cse2 (<= 0 .cse41)) (.cse3 (<= 1 |ULTIMATE.start_init_~tmp~0#1|)) (.cse4 (<= 0 ~id1~0)) (.cse36 (= ~p2~0 0)) (.cse6 (<= |ULTIMATE.start_init_~tmp~0#1| 1)) (.cse7 (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse8 (<= |ULTIMATE.start_init_#res#1| 1)) (.cse9 (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse10 (or (= ~st2~0 1) (and (<= 0 ~st1~0) .cse40))) (.cse11 (= |ULTIMATE.start_main_~i2~0#1| 0)) (.cse12 (<= |ULTIMATE.start_main_~c1~0#1| 1)) (.cse13 (<= 0 ~send2~0)) (.cse38 (= ~mode1~0 1)) (.cse14 (<= ~id1~0 127)) (.cse39 (= ~nomsg~0 ~p1_old~0)) (.cse15 (<= 0 .cse43)) (.cse16 (<= .cse42 0)) (.cse17 (<= .cse43 0)) (.cse18 (<= 1 |ULTIMATE.start_init_#res#1|)) (.cse19 (<= ~id3~0 127)) (.cse20 (<= ~st3~0 1)) (.cse21 (<= 0 ~id2~0)) (.cse22 (= |#NULL.offset| 0)) (.cse23 (<= 0 (+ 2147483645 ~st1~0))) (.cse24 (<= 0 .cse42)) (.cse25 (<= ~id2~0 127)) (.cse26 (<= 0 ~st3~0)) (.cse27 (<= .cse41 0)) (.cse28 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse29 (= ~p3~0 0)) (.cse30 (<= 0 ~send3~0)) (.cse31 (= ~p1~0 0)) (.cse32 (<= 0 |#StackHeapBarrier|)) (.cse33 (<= 0 ~send1~0)) (.cse34 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse35 (= |#NULL.base| 0))) (or (let ((.cse5 (+ ~p1_new~0 1))) (and .cse0 .cse1 .cse2 (= ~mode2~0 1) .cse3 (<= |ULTIMATE.start_check_~tmp~1#1| 1) .cse4 (<= .cse5 0) .cse6 (<= 0 ~mode3~0) .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~mode3~0 1) (<= 0 ~p2~0) .cse12 .cse13 .cse14 (<= ~st1~0 1) .cse15 .cse16 .cse17 .cse18 (= ~mode1~0 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (<= ~p2~0 0) .cse25 .cse26 .cse27 .cse28 .cse29 (<= 0 .cse5) .cse30 .cse31 .cse32 .cse33 .cse34 .cse35)) (let ((.cse37 (+ ~st3~0 ~st1~0))) (and .cse0 .cse2 .cse3 (= (mod ~mode2~0 256) 0) .cse36 .cse6 .cse7 (= ~send3~0 ~id3~0) .cse8 (not (= ~id3~0 ~id2~0)) (<= 0 .cse37) .cse9 (not (= ~id1~0 ~id3~0)) .cse11 (= (* 256 (div ~mode3~0 256)) ~mode3~0) .cse12 .cse38 .cse14 (= ~st1~0 0) (not (= ~id1~0 ~id2~0)) .cse39 .cse15 .cse16 .cse17 .cse18 (= ~send1~0 ~id1~0) (<= .cse37 0) (<= ~r1~0 (* (div ~r1~0 256) 256)) .cse19 .cse21 .cse22 .cse40 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 (= ~send2~0 ~id2~0) .cse35)) (and .cse0 (= ~mode2~0 0) .cse1 .cse2 .cse3 .cse4 .cse36 .cse6 .cse7 .cse8 (= ~nomsg~0 ~p2_old~0) .cse9 (<= (+ ~st3~0 ~st2~0 ~st1~0) 1) .cse10 .cse11 .cse12 .cse13 .cse38 .cse14 .cse39 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35)))) [2022-11-20 21:14:48,754 INFO L899 garLoopResultBuilder]: For program point L208(lines 208 223) no Hoare annotation was computed. [2022-11-20 21:14:48,754 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 211) no Hoare annotation was computed. [2022-11-20 21:14:48,755 INFO L899 garLoopResultBuilder]: For program point L60(line 60) no Hoare annotation was computed. [2022-11-20 21:14:48,755 INFO L899 garLoopResultBuilder]: For program point L60-1(line 60) no Hoare annotation was computed. [2022-11-20 21:14:48,755 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 211) no Hoare annotation was computed. [2022-11-20 21:14:48,756 INFO L895 garLoopResultBuilder]: At program point L259-2(lines 259 273) the Hoare annotation is: (let ((.cse57 (+ ~p1_new~0 1)) (.cse64 (+ ~p3_new~0 1)) (.cse6 (= ~st2~0 1)) (.cse58 (= ~st2~0 0)) (.cse65 (+ ~p2_new~0 1)) (.cse59 (+ ~nomsg~0 1))) (let ((.cse2 (= ~mode2~0 0)) (.cse14 (= ~nomsg~0 ~p2_old~0)) (.cse28 (= ~mode1~0 0)) (.cse23 (= ~nomsg~0 ~p1_old~0)) (.cse25 (<= .cse59 0)) (.cse24 (<= 0 .cse65)) (.cse1 (* (div ~r1~0 256) 256)) (.cse34 (<= 0 (+ 2147483645 ~st1~0))) (.cse49 (<= 0 ~st1~0)) (.cse0 (<= 0 |ULTIMATE.start_main_~c1~0#1|)) (.cse48 (or .cse6 .cse58)) (.cse3 (<= 0 ~id3~0)) (.cse4 (= ~nomsg~0 ~p1_new~0)) (.cse5 (<= 0 .cse64)) (.cse7 (<= 1 |ULTIMATE.start_init_~tmp~0#1|)) (.cse8 (<= |ULTIMATE.start_check_~tmp~1#1| 1)) (.cse9 (<= 0 ~id1~0)) (.cse10 (<= |ULTIMATE.start_init_~tmp~0#1| 1)) (.cse11 (<= 0 ~mode3~0)) (.cse12 (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse13 (<= |ULTIMATE.start_init_#res#1| 1)) (.cse15 (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse16 (<= (+ ~st3~0 ~st2~0 ~st1~0) 1)) (.cse17 (= |ULTIMATE.start_main_~i2~0#1| 0)) (.cse18 (<= ~mode3~0 1)) (.cse19 (<= 0 ~p2~0)) (.cse20 (<= |ULTIMATE.start_main_~c1~0#1| 1)) (.cse21 (<= 0 ~send2~0)) (.cse22 (<= ~id1~0 127)) (.cse26 (<= .cse65 0)) (.cse27 (<= 1 |ULTIMATE.start_init_#res#1|)) (.cse29 (<= 0 |ULTIMATE.start_check_~tmp~1#1|)) (.cse30 (<= ~id3~0 127)) (.cse31 (<= ~st3~0 1)) (.cse32 (<= 0 ~id2~0)) (.cse33 (= |#NULL.offset| 0)) (.cse35 (<= ~p2~0 0)) (.cse36 (<= ~id2~0 127)) (.cse37 (<= 0 ~st3~0)) (.cse38 (<= .cse64 0)) (.cse39 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse40 (= ~p3~0 0)) (.cse41 (<= 0 .cse57)) (.cse42 (<= 0 ~send3~0)) (.cse43 (= ~p1~0 0)) (.cse44 (<= 0 |#StackHeapBarrier|)) (.cse45 (<= 0 ~send1~0)) (.cse46 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse47 (= |#NULL.base| 0))) (or (and .cse0 (not (<= ~r1~0 (+ .cse1 2))) .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 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse0 .cse2 .cse48 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse49 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and (= (mod ~mode2~0 256) 0) (= ~send3~0 ~id3~0) (not (= ~id3~0 ~id2~0)) (= (mod ~mode1~0 256) 0) (not (= ~id1~0 ~id3~0)) (= (* 256 (div ~mode3~0 256)) ~mode3~0) (not (= ~id1~0 ~id2~0)) .cse23 (let ((.cse50 (<= ~st3~0 0)) (.cse51 (<= |ULTIMATE.start_main_~i2~0#1| 0)) (.cse52 (<= 0 |ULTIMATE.start_main_~i2~0#1|)) (.cse53 (<= .cse57 0)) (.cse54 (<= ~st1~0 0))) (or (and .cse5 .cse50 .cse51 (<= |ULTIMATE.start_assert_#in~arg#1| 1) .cse7 .cse8 (<= 1 |ULTIMATE.start_check_#res#1|) .cse52 .cse53 .cse10 .cse11 .cse12 .cse54 .cse13 (<= 0 |ULTIMATE.start_assert_~arg#1|) (<= ~mode2~0 1) .cse15 .cse49 .cse18 .cse19 .cse20 (<= 1 |ULTIMATE.start_check_~tmp~1#1|) (<= 1 |ULTIMATE.start_main_~c1~0#1|) .cse22 .cse24 (<= |ULTIMATE.start_assert_~arg#1| 1) .cse25 (<= ~mode1~0 1) .cse26 .cse27 .cse30 .cse35 (<= 0 ~mode2~0) .cse37 (<= |ULTIMATE.start_check_#res#1| 1) (<= 0 |ULTIMATE.start_assert_#in~arg#1|)) (let ((.cse55 (+ ~p3_old~0 1)) (.cse56 (+ ~p2_old~0 1))) (and .cse0 .cse5 .cse50 .cse51 .cse7 .cse52 .cse53 .cse10 .cse12 .cse54 .cse13 (<= 0 .cse55) .cse15 .cse49 .cse19 (<= 0 .cse56) .cse22 (<= .cse55 0) .cse24 .cse26 .cse27 .cse30 .cse35 .cse37 (<= |ULTIMATE.start_main_~c1~0#1| 0) (<= .cse56 0) (<= (+ ~p1_old~0 1) 0))))) (= ~send1~0 ~id1~0) (<= ~r1~0 .cse1) .cse32 .cse33 .cse58 (<= 0 .cse59) .cse36 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 (= ~send2~0 ~id2~0) .cse47) (and (or .cse6 .cse49) .cse34 (let ((.cse60 (= ~mode2~0 1)) (.cse61 (<= 0 (+ ~st2~0 ~st1~0 2147483648))) (.cse62 (= ~mode1~0 1)) (.cse63 (= ~nomsg~0 ~p2_new~0))) (or (and .cse0 .cse48 .cse3 .cse4 .cse5 .cse60 .cse61 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse49 .cse17 .cse18 .cse19 .cse20 .cse21 .cse62 .cse22 .cse63 .cse26 .cse27 .cse29 .cse30 .cse32 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse0 .cse48 .cse3 .cse4 .cse5 .cse60 .cse61 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse62 .cse22 .cse63 .cse26 .cse27 .cse29 .cse30 .cse31 .cse32 .cse33 .cse35 .cse36 .cse37 (not (< (mod ~r1~0 256) 3)) .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47))))))) [2022-11-20 21:14:48,756 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 60) no Hoare annotation was computed. [2022-11-20 21:14:48,756 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 60) no Hoare annotation was computed. [2022-11-20 21:14:48,756 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-11-20 21:14:48,757 INFO L899 garLoopResultBuilder]: For program point L211-1(line 211) no Hoare annotation was computed. [2022-11-20 21:14:48,757 INFO L899 garLoopResultBuilder]: For program point L211-2(line 211) no Hoare annotation was computed. [2022-11-20 21:14:48,757 INFO L899 garLoopResultBuilder]: For program point L211-3(line 211) no Hoare annotation was computed. [2022-11-20 21:14:48,757 INFO L899 garLoopResultBuilder]: For program point L211-4(lines 211 223) no Hoare annotation was computed. [2022-11-20 21:14:48,757 INFO L895 garLoopResultBuilder]: At program point L212(lines 208 223) the Hoare annotation is: (let ((.cse54 (+ ~p2_new~0 1)) (.cse53 (+ ~p3_new~0 1)) (.cse55 (+ ~nomsg~0 1)) (.cse52 (+ ~p1_new~0 1))) (let ((.cse6 (= ~mode2~0 1)) (.cse20 (= ~mode1~0 1)) (.cse1 (not (<= ~r1~0 (+ (* (div ~r1~0 256) 256) 2)))) (.cse9 (= ~p2~0 0)) (.cse43 (<= .cse52 0)) (.cse27 (<= ~st3~0 1)) (.cse30 (<= 0 (+ 2147483645 ~st1~0))) (.cse46 (<= 0 .cse55)) (.cse0 (<= 0 |ULTIMATE.start_main_~c1~0#1|)) (.cse48 (= ~mode2~0 0)) (.cse5 (= ~st2~0 1)) (.cse2 (<= 0 ~id3~0)) (.cse3 (= ~nomsg~0 ~p1_new~0)) (.cse4 (<= 0 .cse53)) (.cse7 (<= 1 |ULTIMATE.start_init_~tmp~0#1|)) (.cse8 (<= 0 ~id1~0)) (.cse10 (<= |ULTIMATE.start_init_~tmp~0#1| 1)) (.cse11 (<= 0 ~mode3~0)) (.cse12 (<= 1 |ULTIMATE.start_assume_abort_if_not_~cond#1|)) (.cse13 (<= |ULTIMATE.start_init_#res#1| 1)) (.cse49 (= ~nomsg~0 ~p2_old~0)) (.cse14 (<= 1 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|)) (.cse15 (<= (+ ~st3~0 ~st2~0 ~st1~0) 1)) (.cse44 (<= 0 ~st1~0)) (.cse16 (= |ULTIMATE.start_main_~i2~0#1| 0)) (.cse17 (<= ~mode3~0 1)) (.cse45 (<= 0 ~p2~0)) (.cse18 (<= |ULTIMATE.start_main_~c1~0#1| 1)) (.cse19 (<= 0 ~send2~0)) (.cse21 (<= ~id1~0 127)) (.cse50 (= ~nomsg~0 ~p1_old~0)) (.cse22 (<= 0 .cse54)) (.cse23 (<= .cse55 0)) (.cse24 (<= .cse54 0)) (.cse25 (<= 1 |ULTIMATE.start_init_#res#1|)) (.cse51 (= ~mode1~0 0)) (.cse26 (<= ~id3~0 127)) (.cse28 (<= 0 ~id2~0)) (.cse29 (= |#NULL.offset| 0)) (.cse47 (<= ~p2~0 0)) (.cse31 (<= ~id2~0 127)) (.cse32 (<= 0 ~st3~0)) (.cse33 (<= .cse53 0)) (.cse34 (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1)) (.cse35 (= ~p3~0 0)) (.cse36 (<= 0 .cse52)) (.cse37 (<= 0 ~send3~0)) (.cse38 (= ~p1~0 0)) (.cse39 (<= 0 |#StackHeapBarrier|)) (.cse40 (<= 0 ~send1~0)) (.cse41 (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (.cse42 (= |#NULL.base| 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 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42) (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse8 .cse43 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse44 .cse16 (<= 0 ~st2~0) .cse17 .cse45 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse29 .cse46 .cse47 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42) (and .cse0 .cse1 .cse48 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse43 .cse10 .cse11 .cse12 .cse13 .cse49 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse50 .cse22 .cse23 .cse24 .cse25 .cse51 .cse26 .cse27 .cse28 .cse29 .cse30 .cse46 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42) (and .cse0 .cse48 (or .cse5 (= ~st2~0 0)) .cse2 .cse3 .cse4 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse49 .cse14 .cse15 .cse44 .cse16 .cse17 .cse45 .cse18 .cse19 .cse21 .cse50 .cse22 .cse23 .cse24 .cse25 .cse51 .cse26 .cse28 .cse29 .cse47 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42)))) [2022-11-20 21:14:48,758 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 216) no Hoare annotation was computed. [2022-11-20 21:14:48,758 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 216) no Hoare annotation was computed. [2022-11-20 21:14:48,758 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 207) no Hoare annotation was computed. [2022-11-20 21:14:48,758 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 207) no Hoare annotation was computed. [2022-11-20 21:14:48,758 INFO L899 garLoopResultBuilder]: For program point L216(line 216) no Hoare annotation was computed. [2022-11-20 21:14:48,758 INFO L899 garLoopResultBuilder]: For program point L216-1(line 216) no Hoare annotation was computed. [2022-11-20 21:14:48,759 INFO L899 garLoopResultBuilder]: For program point L216-2(line 216) no Hoare annotation was computed. [2022-11-20 21:14:48,759 INFO L899 garLoopResultBuilder]: For program point L216-3(line 216) no Hoare annotation was computed. [2022-11-20 21:14:48,762 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 21:14:48,764 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 21:14:48,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:14:48 BoogieIcfgContainer [2022-11-20 21:14:48,814 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 21:14:48,815 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 21:14:48,815 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 21:14:48,815 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 21:14:48,816 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:06:59" (3/4) ... [2022-11-20 21:14:48,818 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 21:14:48,830 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2022-11-20 21:14:48,831 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-11-20 21:14:48,832 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-20 21:14:48,832 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-20 21:14:48,859 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((((((((0 <= c1 && !(r1 <= r1 / 256 * 256 + 2)) && mode2 == 0) && 0 <= id3) && nomsg == p1_new) && 0 <= p3_new + 1) && st2 == 1) && 1 <= tmp) && tmp <= 1) && 0 <= id1) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && \result <= 1) && nomsg == p2_\old) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && i2 == 0) && mode3 <= 1) && 0 <= p2) && c1 <= 1) && 0 <= send2) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && 0 <= tmp) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && 0 <= 2147483645 + st1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((((((((((0 <= c1 && mode2 == 0) && (st2 == 1 || st2 == 0)) && 0 <= id3) && nomsg == p1_new) && 0 <= p3_new + 1) && 1 <= tmp) && tmp <= 1) && 0 <= id1) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && \result <= 1) && nomsg == p2_\old) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && i2 == 0) && mode3 <= 1) && 0 <= p2) && c1 <= 1) && 0 <= send2) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && 0 <= tmp) && id3 <= 127) && 0 <= id2) && #NULL == 0) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0)) || ((((((((((((((((((((((((((mode2 % 256 == 0 && send3 == id3) && !(id3 == id2)) && mode1 % 256 == 0) && !(id1 == id3)) && 256 * (mode3 / 256) == mode3) && !(id1 == id2)) && nomsg == p1_\old) && ((((((((((((((((((((((((((((((((((((0 <= p3_new + 1 && st3 <= 0) && i2 <= 0) && \old(arg) <= 1) && 1 <= tmp) && tmp <= 1) && 1 <= \result) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && st1 <= 0) && \result <= 1) && 0 <= arg) && mode2 <= 1) && 1 <= \old(cond)) && 0 <= st1) && mode3 <= 1) && 0 <= p2) && c1 <= 1) && 1 <= tmp) && 1 <= c1) && id1 <= 127) && 0 <= p2_new + 1) && arg <= 1) && nomsg + 1 <= 0) && mode1 <= 1) && p2_new + 1 <= 0) && 1 <= \result) && id3 <= 127) && p2 <= 0) && 0 <= mode2) && 0 <= st3) && \result <= 1) && 0 <= \old(arg)) || ((((((((((((((((((((((((((0 <= c1 && 0 <= p3_new + 1) && st3 <= 0) && i2 <= 0) && 1 <= tmp) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && st1 <= 0) && \result <= 1) && 0 <= p3_\old + 1) && 1 <= \old(cond)) && 0 <= st1) && 0 <= p2) && 0 <= p2_\old + 1) && id1 <= 127) && p3_\old + 1 <= 0) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && id3 <= 127) && p2 <= 0) && 0 <= st3) && c1 <= 0) && p2_\old + 1 <= 0) && p1_\old + 1 <= 0))) && send1 == id1) && r1 <= r1 / 256 * 256) && 0 <= id2) && #NULL == 0) && st2 == 0) && 0 <= nomsg + 1) && id2 <= 127) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && send2 == id2) && #NULL == 0)) || (((st2 == 1 || 0 <= st1) && 0 <= 2147483645 + st1) && ((((((((((((((((((((((((((((((((((((((((((((0 <= c1 && (st2 == 1 || st2 == 0)) && 0 <= id3) && nomsg == p1_new) && 0 <= p3_new + 1) && mode2 == 1) && 0 <= st2 + st1 + 2147483648) && 1 <= tmp) && tmp <= 1) && 0 <= id1) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && \result <= 1) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && i2 == 0) && mode3 <= 1) && 0 <= p2) && c1 <= 1) && 0 <= send2) && mode1 == 1) && id1 <= 127) && nomsg == p2_new) && p2_new + 1 <= 0) && 1 <= \result) && 0 <= tmp) && id3 <= 127) && 0 <= id2) && #NULL == 0) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((((((((((0 <= c1 && (st2 == 1 || st2 == 0)) && 0 <= id3) && nomsg == p1_new) && 0 <= p3_new + 1) && mode2 == 1) && 0 <= st2 + st1 + 2147483648) && 1 <= tmp) && tmp <= 1) && 0 <= id1) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && \result <= 1) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && i2 == 0) && mode3 <= 1) && 0 <= p2) && c1 <= 1) && 0 <= send2) && mode1 == 1) && id1 <= 127) && nomsg == p2_new) && p2_new + 1 <= 0) && 1 <= \result) && 0 <= tmp) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && p2 <= 0) && id2 <= 127) && 0 <= st3) && !(r1 % 256 < 3)) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0))) [2022-11-20 21:14:48,860 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && 0 <= p3_new + 1) && mode2 == 1) && 1 <= tmp) && tmp <= 1) && 0 <= id1) && p1_new + 1 <= 0) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && \result <= 1) && 1 <= \old(cond)) && (st2 == 1 || (0 <= st1 && st2 == 0))) && i2 == 0) && mode3 <= 1) && 0 <= p2) && c1 <= 1) && 0 <= send2) && id1 <= 127) && st1 <= 1) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && 0 <= tmp) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && 0 <= 2147483645 + st1) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= p3_new + 1) && 1 <= tmp) && mode2 % 256 == 0) && p2 == 0) && tmp <= 1) && 1 <= cond) && send3 == id3) && \result <= 1) && !(id3 == id2)) && 0 <= st3 + st1) && 1 <= \old(cond)) && !(id1 == id3)) && i2 == 0) && 256 * (mode3 / 256) == mode3) && c1 <= 1) && mode1 == 1) && id1 <= 127) && st1 == 0) && !(id1 == id2)) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && send1 == id1) && st3 + st1 <= 0) && r1 <= r1 / 256 * 256) && id3 <= 127) && 0 <= id2) && #NULL == 0) && st2 == 0) && 0 <= nomsg + 1) && id2 <= 127) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && send2 == id2) && #NULL == 0)) || ((((((((((((((((((((((((((((((((((((((((0 <= c1 && mode2 == 0) && 0 <= id3) && 0 <= p3_new + 1) && 1 <= tmp) && 0 <= id1) && p2 == 0) && tmp <= 1) && 1 <= cond) && \result <= 1) && nomsg == p2_\old) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && (st2 == 1 || (0 <= st1 && st2 == 0))) && i2 == 0) && c1 <= 1) && 0 <= send2) && mode1 == 1) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && 0 <= 2147483645 + st1) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) [2022-11-20 21:14:48,861 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((((0 <= c1 && !(r1 <= r1 / 256 * 256 + 2)) && 0 <= id3) && nomsg == p1_new) && 0 <= p3_new + 1) && st2 == 1) && mode2 == 1) && 1 <= tmp) && 0 <= id1) && p2 == 0) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && \result <= 1) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && i2 == 0) && mode3 <= 1) && c1 <= 1) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && 0 <= 2147483645 + st1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && 0 <= p3_new + 1) && mode2 == 1) && 1 <= tmp) && 0 <= id1) && p1_new + 1 <= 0) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && \result <= 1) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && i2 == 0) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && c1 <= 1) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0)) || (((((((((((((((((((((((((((((((((((((((((((((0 <= c1 && !(r1 <= r1 / 256 * 256 + 2)) && mode2 == 0) && 0 <= id3) && 0 <= p3_new + 1) && st2 == 1) && 1 <= tmp) && 0 <= id1) && p2 == 0) && p1_new + 1 <= 0) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && \result <= 1) && nomsg == p2_\old) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && i2 == 0) && mode3 <= 1) && c1 <= 1) && 0 <= send2) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && 0 <= 2147483645 + st1) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0)) || (((((((((((((((((((((((((((((((((((((((((((0 <= c1 && mode2 == 0) && (st2 == 1 || st2 == 0)) && 0 <= id3) && nomsg == p1_new) && 0 <= p3_new + 1) && 1 <= tmp) && 0 <= id1) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && \result <= 1) && nomsg == p2_\old) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && i2 == 0) && mode3 <= 1) && 0 <= p2) && c1 <= 1) && 0 <= send2) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) [2022-11-20 21:14:48,861 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((((((((0 <= c1 && !(r1 <= r1 / 256 * 256 + 2)) && mode2 == 0) && 0 <= id3) && nomsg == p1_new) && 0 <= p3_new + 1) && st2 == 1) && 1 <= tmp) && tmp <= 1) && 0 <= id1) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && \result <= 1) && nomsg == p2_\old) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && i2 == 0) && mode3 <= 1) && 0 <= p2) && c1 <= 1) && 0 <= send2) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && 0 <= tmp) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && 0 <= 2147483645 + st1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((((((((((0 <= c1 && mode2 == 0) && (st2 == 1 || st2 == 0)) && 0 <= id3) && nomsg == p1_new) && 0 <= p3_new + 1) && 1 <= tmp) && tmp <= 1) && 0 <= id1) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && \result <= 1) && nomsg == p2_\old) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && i2 == 0) && mode3 <= 1) && 0 <= p2) && c1 <= 1) && 0 <= send2) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && 0 <= tmp) && id3 <= 127) && 0 <= id2) && #NULL == 0) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0)) || (tmp == 0 && mode1 == 0)) || (((st2 == 1 || 0 <= st1) && 0 <= 2147483645 + st1) && ((((((((((((((((((((((((((((((((((((((((((((0 <= c1 && (st2 == 1 || st2 == 0)) && 0 <= id3) && nomsg == p1_new) && 0 <= p3_new + 1) && mode2 == 1) && 0 <= st2 + st1 + 2147483648) && 1 <= tmp) && tmp <= 1) && 0 <= id1) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && \result <= 1) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && i2 == 0) && mode3 <= 1) && 0 <= p2) && c1 <= 1) && 0 <= send2) && mode1 == 1) && id1 <= 127) && nomsg == p2_new) && p2_new + 1 <= 0) && 1 <= \result) && 0 <= tmp) && id3 <= 127) && 0 <= id2) && #NULL == 0) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((((((((((0 <= c1 && (st2 == 1 || st2 == 0)) && 0 <= id3) && nomsg == p1_new) && 0 <= p3_new + 1) && mode2 == 1) && 0 <= st2 + st1 + 2147483648) && 1 <= tmp) && tmp <= 1) && 0 <= id1) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && \result <= 1) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && i2 == 0) && mode3 <= 1) && 0 <= p2) && c1 <= 1) && 0 <= send2) && mode1 == 1) && id1 <= 127) && nomsg == p2_new) && p2_new + 1 <= 0) && 1 <= \result) && 0 <= tmp) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && p2 <= 0) && id2 <= 127) && 0 <= st3) && !(r1 % 256 < 3)) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0))) [2022-11-20 21:14:48,884 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/witness.graphml [2022-11-20 21:14:48,884 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 21:14:48,885 INFO L158 Benchmark]: Toolchain (without parser) took 470800.27ms. Allocated memory was 197.1MB in the beginning and 815.8MB in the end (delta: 618.7MB). Free memory was 151.6MB in the beginning and 633.0MB in the end (delta: -481.4MB). Peak memory consumption was 139.0MB. Max. memory is 16.1GB. [2022-11-20 21:14:48,885 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 82.2MB in the end (delta: 134.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 21:14:48,885 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.97ms. Allocated memory is still 197.1MB. Free memory was 151.6MB in the beginning and 138.1MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-20 21:14:48,886 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.60ms. Allocated memory is still 197.1MB. Free memory was 138.1MB in the beginning and 136.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 21:14:48,886 INFO L158 Benchmark]: Boogie Preprocessor took 59.55ms. Allocated memory is still 197.1MB. Free memory was 136.0MB in the beginning and 134.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 21:14:48,886 INFO L158 Benchmark]: RCFGBuilder took 995.45ms. Allocated memory is still 197.1MB. Free memory was 134.5MB in the beginning and 140.7MB in the end (delta: -6.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-20 21:14:48,886 INFO L158 Benchmark]: TraceAbstraction took 469174.39ms. Allocated memory was 197.1MB in the beginning and 815.8MB in the end (delta: 618.7MB). Free memory was 139.7MB in the beginning and 638.2MB in the end (delta: -498.5MB). Peak memory consumption was 491.4MB. Max. memory is 16.1GB. [2022-11-20 21:14:48,887 INFO L158 Benchmark]: Witness Printer took 69.55ms. Allocated memory is still 815.8MB. Free memory was 638.2MB in the beginning and 633.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 21:14:48,888 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.25ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 82.2MB in the end (delta: 134.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.97ms. Allocated memory is still 197.1MB. Free memory was 151.6MB in the beginning and 138.1MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.60ms. Allocated memory is still 197.1MB. Free memory was 138.1MB in the beginning and 136.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.55ms. Allocated memory is still 197.1MB. Free memory was 136.0MB in the beginning and 134.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 995.45ms. Allocated memory is still 197.1MB. Free memory was 134.5MB in the beginning and 140.7MB in the end (delta: -6.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 469174.39ms. Allocated memory was 197.1MB in the beginning and 815.8MB in the end (delta: 618.7MB). Free memory was 139.7MB in the beginning and 638.2MB in the end (delta: -498.5MB). Peak memory consumption was 491.4MB. Max. memory is 16.1GB. * Witness Printer took 69.55ms. Allocated memory is still 815.8MB. Free memory was 638.2MB in the beginning and 633.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 207]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 207]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 207]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 207]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 211]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 211]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 211]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 211]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 216]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 216]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 216]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 216]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 469.1s, OverallIterations: 19, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 38.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 39.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4522 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4522 mSDsluCounter, 1316 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 213 IncrementalHoareTripleChecker+Unchecked, 876 mSDsCounter, 507 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4192 IncrementalHoareTripleChecker+Invalid, 4912 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 507 mSolverCounterUnsat, 440 mSDtfsCounter, 4192 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1367 GetRequests, 789 SyntacticMatches, 70 SemanticMatches, 508 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14012 ImplicationChecksByTransitivity, 119.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=16, InterpolantAutomatonStates: 207, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 453 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 69 NumberOfFragments, 2728 HoareAnnotationTreeSize, 5 FomulaSimplifications, 961706 FormulaSimplificationTreeSizeReduction, 18.5s HoareSimplificationTime, 5 FomulaSimplificationsInter, 130088 FormulaSimplificationTreeSizeReductionInter, 20.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 213.8s InterpolantComputationTime, 956 NumberOfCodeBlocks, 956 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1291 ConstructedInterpolants, 0 QuantifiedInterpolants, 118170 SizeOfPredicates, 350 NumberOfNonLiveVariables, 2065 ConjunctsInSsa, 262 ConjunctsInUnsatCore, 39 InterpolantComputations, 10 PerfectInterpolantSequences, 81/1041 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: 40.0s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 4, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 124, DAG_INTERPRETER_EARLY_EXITS: 2, TOOLS_POST_APPLICATIONS: 467, TOOLS_POST_TIME: 36.5s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 463, TOOLS_QUANTIFIERELIM_TIME: 36.2s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.8s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 594, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 64, DOMAIN_JOIN_TIME: 2.5s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 8, DOMAIN_WIDEN_TIME: 0.5s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 16, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 124, DOMAIN_ISBOTTOM_TIME: 0.3s, LOOP_SUMMARIZER_APPLICATIONS: 8, LOOP_SUMMARIZER_CACHE_MISSES: 8, LOOP_SUMMARIZER_OVERALL_TIME: 25.4s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 25.4s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 16, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.1s, DAG_COMPRESSION_PROCESSED_NODES: 5860, DAG_COMPRESSION_RETAINED_NODES: 373, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((0 <= c1 && !(r1 <= r1 / 256 * 256 + 2)) && mode2 == 0) && 0 <= id3) && nomsg == p1_new) && 0 <= p3_new + 1) && st2 == 1) && 1 <= tmp) && tmp <= 1) && 0 <= id1) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && \result <= 1) && nomsg == p2_\old) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && i2 == 0) && mode3 <= 1) && 0 <= p2) && c1 <= 1) && 0 <= send2) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && 0 <= tmp) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && 0 <= 2147483645 + st1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((((((((((0 <= c1 && mode2 == 0) && (st2 == 1 || st2 == 0)) && 0 <= id3) && nomsg == p1_new) && 0 <= p3_new + 1) && 1 <= tmp) && tmp <= 1) && 0 <= id1) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && \result <= 1) && nomsg == p2_\old) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && i2 == 0) && mode3 <= 1) && 0 <= p2) && c1 <= 1) && 0 <= send2) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && 0 <= tmp) && id3 <= 127) && 0 <= id2) && #NULL == 0) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0)) || ((((((((((((((((((((((((((mode2 % 256 == 0 && send3 == id3) && !(id3 == id2)) && mode1 % 256 == 0) && !(id1 == id3)) && 256 * (mode3 / 256) == mode3) && !(id1 == id2)) && nomsg == p1_\old) && ((((((((((((((((((((((((((((((((((((0 <= p3_new + 1 && st3 <= 0) && i2 <= 0) && \old(arg) <= 1) && 1 <= tmp) && tmp <= 1) && 1 <= \result) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && st1 <= 0) && \result <= 1) && 0 <= arg) && mode2 <= 1) && 1 <= \old(cond)) && 0 <= st1) && mode3 <= 1) && 0 <= p2) && c1 <= 1) && 1 <= tmp) && 1 <= c1) && id1 <= 127) && 0 <= p2_new + 1) && arg <= 1) && nomsg + 1 <= 0) && mode1 <= 1) && p2_new + 1 <= 0) && 1 <= \result) && id3 <= 127) && p2 <= 0) && 0 <= mode2) && 0 <= st3) && \result <= 1) && 0 <= \old(arg)) || ((((((((((((((((((((((((((0 <= c1 && 0 <= p3_new + 1) && st3 <= 0) && i2 <= 0) && 1 <= tmp) && 0 <= i2) && p1_new + 1 <= 0) && tmp <= 1) && 1 <= cond) && st1 <= 0) && \result <= 1) && 0 <= p3_\old + 1) && 1 <= \old(cond)) && 0 <= st1) && 0 <= p2) && 0 <= p2_\old + 1) && id1 <= 127) && p3_\old + 1 <= 0) && 0 <= p2_new + 1) && p2_new + 1 <= 0) && 1 <= \result) && id3 <= 127) && p2 <= 0) && 0 <= st3) && c1 <= 0) && p2_\old + 1 <= 0) && p1_\old + 1 <= 0))) && send1 == id1) && r1 <= r1 / 256 * 256) && 0 <= id2) && #NULL == 0) && st2 == 0) && 0 <= nomsg + 1) && id2 <= 127) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && send2 == id2) && #NULL == 0)) || (((st2 == 1 || 0 <= st1) && 0 <= 2147483645 + st1) && ((((((((((((((((((((((((((((((((((((((((((((0 <= c1 && (st2 == 1 || st2 == 0)) && 0 <= id3) && nomsg == p1_new) && 0 <= p3_new + 1) && mode2 == 1) && 0 <= st2 + st1 + 2147483648) && 1 <= tmp) && tmp <= 1) && 0 <= id1) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && \result <= 1) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && i2 == 0) && mode3 <= 1) && 0 <= p2) && c1 <= 1) && 0 <= send2) && mode1 == 1) && id1 <= 127) && nomsg == p2_new) && p2_new + 1 <= 0) && 1 <= \result) && 0 <= tmp) && id3 <= 127) && 0 <= id2) && #NULL == 0) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((((((((((0 <= c1 && (st2 == 1 || st2 == 0)) && 0 <= id3) && nomsg == p1_new) && 0 <= p3_new + 1) && mode2 == 1) && 0 <= st2 + st1 + 2147483648) && 1 <= tmp) && tmp <= 1) && 0 <= id1) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && \result <= 1) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && i2 == 0) && mode3 <= 1) && 0 <= p2) && c1 <= 1) && 0 <= send2) && mode1 == 1) && id1 <= 127) && nomsg == p2_new) && p2_new + 1 <= 0) && 1 <= \result) && 0 <= tmp) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && p2 <= 0) && id2 <= 127) && 0 <= st3) && !(r1 % 256 < 3)) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0))) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((0 <= c1 && !(r1 <= r1 / 256 * 256 + 2)) && mode2 == 0) && 0 <= id3) && nomsg == p1_new) && 0 <= p3_new + 1) && st2 == 1) && 1 <= tmp) && tmp <= 1) && 0 <= id1) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && \result <= 1) && nomsg == p2_\old) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && i2 == 0) && mode3 <= 1) && 0 <= p2) && c1 <= 1) && 0 <= send2) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && 0 <= tmp) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && 0 <= 2147483645 + st1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((((((((((0 <= c1 && mode2 == 0) && (st2 == 1 || st2 == 0)) && 0 <= id3) && nomsg == p1_new) && 0 <= p3_new + 1) && 1 <= tmp) && tmp <= 1) && 0 <= id1) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && \result <= 1) && nomsg == p2_\old) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && i2 == 0) && mode3 <= 1) && 0 <= p2) && c1 <= 1) && 0 <= send2) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && 0 <= tmp) && id3 <= 127) && 0 <= id2) && #NULL == 0) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0)) || (tmp == 0 && mode1 == 0)) || (((st2 == 1 || 0 <= st1) && 0 <= 2147483645 + st1) && ((((((((((((((((((((((((((((((((((((((((((((0 <= c1 && (st2 == 1 || st2 == 0)) && 0 <= id3) && nomsg == p1_new) && 0 <= p3_new + 1) && mode2 == 1) && 0 <= st2 + st1 + 2147483648) && 1 <= tmp) && tmp <= 1) && 0 <= id1) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && \result <= 1) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && i2 == 0) && mode3 <= 1) && 0 <= p2) && c1 <= 1) && 0 <= send2) && mode1 == 1) && id1 <= 127) && nomsg == p2_new) && p2_new + 1 <= 0) && 1 <= \result) && 0 <= tmp) && id3 <= 127) && 0 <= id2) && #NULL == 0) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((((((((((0 <= c1 && (st2 == 1 || st2 == 0)) && 0 <= id3) && nomsg == p1_new) && 0 <= p3_new + 1) && mode2 == 1) && 0 <= st2 + st1 + 2147483648) && 1 <= tmp) && tmp <= 1) && 0 <= id1) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && \result <= 1) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && i2 == 0) && mode3 <= 1) && 0 <= p2) && c1 <= 1) && 0 <= send2) && mode1 == 1) && id1 <= 127) && nomsg == p2_new) && p2_new + 1 <= 0) && 1 <= \result) && 0 <= tmp) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && p2 <= 0) && id2 <= 127) && 0 <= st3) && !(r1 % 256 < 3)) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0))) - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && 0 <= p3_new + 1) && mode2 == 1) && 1 <= tmp) && tmp <= 1) && 0 <= id1) && p1_new + 1 <= 0) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && \result <= 1) && 1 <= \old(cond)) && (st2 == 1 || (0 <= st1 && st2 == 0))) && i2 == 0) && mode3 <= 1) && 0 <= p2) && c1 <= 1) && 0 <= send2) && id1 <= 127) && st1 <= 1) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && 0 <= tmp) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && 0 <= 2147483645 + st1) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= p3_new + 1) && 1 <= tmp) && mode2 % 256 == 0) && p2 == 0) && tmp <= 1) && 1 <= cond) && send3 == id3) && \result <= 1) && !(id3 == id2)) && 0 <= st3 + st1) && 1 <= \old(cond)) && !(id1 == id3)) && i2 == 0) && 256 * (mode3 / 256) == mode3) && c1 <= 1) && mode1 == 1) && id1 <= 127) && st1 == 0) && !(id1 == id2)) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && send1 == id1) && st3 + st1 <= 0) && r1 <= r1 / 256 * 256) && id3 <= 127) && 0 <= id2) && #NULL == 0) && st2 == 0) && 0 <= nomsg + 1) && id2 <= 127) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && send2 == id2) && #NULL == 0)) || ((((((((((((((((((((((((((((((((((((((((0 <= c1 && mode2 == 0) && 0 <= id3) && 0 <= p3_new + 1) && 1 <= tmp) && 0 <= id1) && p2 == 0) && tmp <= 1) && 1 <= cond) && \result <= 1) && nomsg == p2_\old) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && (st2 == 1 || (0 <= st1 && st2 == 0))) && i2 == 0) && c1 <= 1) && 0 <= send2) && mode1 == 1) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && 0 <= 2147483645 + st1) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((0 <= c1 && !(r1 <= r1 / 256 * 256 + 2)) && 0 <= id3) && nomsg == p1_new) && 0 <= p3_new + 1) && st2 == 1) && mode2 == 1) && 1 <= tmp) && 0 <= id1) && p2 == 0) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && \result <= 1) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && i2 == 0) && mode3 <= 1) && c1 <= 1) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && 0 <= 2147483645 + st1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((((((((0 <= c1 && 0 <= id3) && 0 <= p3_new + 1) && mode2 == 1) && 1 <= tmp) && 0 <= id1) && p1_new + 1 <= 0) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && \result <= 1) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && i2 == 0) && 0 <= st2) && mode3 <= 1) && 0 <= p2) && c1 <= 1) && 0 <= send2) && mode1 == 1) && id1 <= 127) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && id3 <= 127) && 0 <= id2) && #NULL == 0) && 0 <= nomsg + 1) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0)) || (((((((((((((((((((((((((((((((((((((((((((((0 <= c1 && !(r1 <= r1 / 256 * 256 + 2)) && mode2 == 0) && 0 <= id3) && 0 <= p3_new + 1) && st2 == 1) && 1 <= tmp) && 0 <= id1) && p2 == 0) && p1_new + 1 <= 0) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && \result <= 1) && nomsg == p2_\old) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && i2 == 0) && mode3 <= 1) && c1 <= 1) && 0 <= send2) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && id3 <= 127) && st3 <= 1) && 0 <= id2) && #NULL == 0) && 0 <= 2147483645 + st1) && 0 <= nomsg + 1) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0)) || (((((((((((((((((((((((((((((((((((((((((((0 <= c1 && mode2 == 0) && (st2 == 1 || st2 == 0)) && 0 <= id3) && nomsg == p1_new) && 0 <= p3_new + 1) && 1 <= tmp) && 0 <= id1) && tmp <= 1) && 0 <= mode3) && 1 <= cond) && \result <= 1) && nomsg == p2_\old) && 1 <= \old(cond)) && st3 + st2 + st1 <= 1) && 0 <= st1) && i2 == 0) && mode3 <= 1) && 0 <= p2) && c1 <= 1) && 0 <= send2) && id1 <= 127) && nomsg == p1_\old) && 0 <= p2_new + 1) && nomsg + 1 <= 0) && p2_new + 1 <= 0) && 1 <= \result) && mode1 == 0) && id3 <= 127) && 0 <= id2) && #NULL == 0) && p2 <= 0) && id2 <= 127) && 0 <= st3) && p3_new + 1 <= 0) && \old(cond) <= 1) && p3 == 0) && 0 <= p1_new + 1) && 0 <= send3) && p1 == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= send1) && cond <= 1) && #NULL == 0) RESULT: Ultimate proved your program to be correct! [2022-11-20 21:14:48,946 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88b2d55d-7700-4bab-bc44-fcdaceee2545/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE