./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 23:50:08,441 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:50:08,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:50:08,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:50:08,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:50:08,489 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:50:08,491 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:50:08,494 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:50:08,496 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:50:08,501 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:50:08,503 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:50:08,505 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:50:08,506 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:50:08,508 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:50:08,510 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:50:08,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:50:08,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:50:08,515 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:50:08,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:50:08,523 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:50:08,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:50:08,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:50:08,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:50:08,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:50:08,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:50:08,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:50:08,540 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:50:08,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:50:08,542 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:50:08,543 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:50:08,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:50:08,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:50:08,547 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:50:08,548 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:50:08,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:50:08,550 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:50:08,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:50:08,551 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:50:08,551 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:50:08,552 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:50:08,553 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:50:08,554 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-25 23:50:08,595 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:50:08,595 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:50:08,596 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:50:08,596 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:50:08,597 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:50:08,597 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:50:08,597 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:50:08,598 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:50:08,598 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:50:08,598 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:50:08,599 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:50:08,599 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:50:08,600 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:50:08,600 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:50:08,600 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:50:08,600 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:50:08,601 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:50:08,601 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:50:08,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:50:08,602 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:50:08,602 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:50:08,602 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:50:08,603 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:50:08,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:50:08,603 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:50:08,603 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:50:08,604 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:50:08,604 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 23:50:08,604 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:50:08,604 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:50:08,604 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:50:08,605 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:50:08,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:50:08,605 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:50:08,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:50:08,606 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:50:08,606 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:50:08,606 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:50:08,607 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:50:08,607 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:50:08,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:50:08,607 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:50:08,608 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:50:08,608 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_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2022-11-25 23:50:08,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:50:08,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:50:08,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:50:08,945 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:50:08,946 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:50:08,947 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-25 23:50:12,153 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:50:12,478 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:50:12,479 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-25 23:50:12,500 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/data/6995ad37d/d4b4b4aea5f646029219ff2f5bb2ff9f/FLAGe620c083d [2022-11-25 23:50:12,532 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/data/6995ad37d/d4b4b4aea5f646029219ff2f5bb2ff9f [2022-11-25 23:50:12,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:50:12,537 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:50:12,538 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:50:12,539 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:50:12,555 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:50:12,556 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:50:12" (1/1) ... [2022-11-25 23:50:12,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aa447ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:12, skipping insertion in model container [2022-11-25 23:50:12,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:50:12" (1/1) ... [2022-11-25 23:50:12,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:50:12,635 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:50:13,277 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_c03d8921-e523-4861-91ff-3b9d9dc8a048/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-25 23:50:13,285 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_c03d8921-e523-4861-91ff-3b9d9dc8a048/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-25 23:50:13,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:50:13,308 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:50:13,405 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_c03d8921-e523-4861-91ff-3b9d9dc8a048/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-25 23:50:13,410 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_c03d8921-e523-4861-91ff-3b9d9dc8a048/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-25 23:50:13,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:50:13,511 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:50:13,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:13 WrapperNode [2022-11-25 23:50:13,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:50:13,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:50:13,515 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:50:13,515 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:50:13,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:13" (1/1) ... [2022-11-25 23:50:13,556 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:13" (1/1) ... [2022-11-25 23:50:13,614 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 214 [2022-11-25 23:50:13,616 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:50:13,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:50:13,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:50:13,618 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:50:13,628 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:13" (1/1) ... [2022-11-25 23:50:13,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:13" (1/1) ... [2022-11-25 23:50:13,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:13" (1/1) ... [2022-11-25 23:50:13,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:13" (1/1) ... [2022-11-25 23:50:13,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:13" (1/1) ... [2022-11-25 23:50:13,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:13" (1/1) ... [2022-11-25 23:50:13,684 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:13" (1/1) ... [2022-11-25 23:50:13,686 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:13" (1/1) ... [2022-11-25 23:50:13,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:50:13,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:50:13,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:50:13,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:50:13,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:13" (1/1) ... [2022-11-25 23:50:13,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:50:13,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:50:13,745 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:50:13,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:50:13,797 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-25 23:50:13,797 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-25 23:50:13,797 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-25 23:50:13,797 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-25 23:50:13,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 23:50:13,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:50:13,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 23:50:13,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 23:50:13,798 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-25 23:50:13,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:50:13,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:50:13,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:50:13,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:50:13,801 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 23:50:13,988 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:50:13,990 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:50:14,570 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:50:14,582 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:50:14,590 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 23:50:14,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:50:14 BoogieIcfgContainer [2022-11-25 23:50:14,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:50:14,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:50:14,598 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:50:14,602 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:50:14,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:50:12" (1/3) ... [2022-11-25 23:50:14,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6217606a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:50:14, skipping insertion in model container [2022-11-25 23:50:14,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:50:13" (2/3) ... [2022-11-25 23:50:14,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6217606a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:50:14, skipping insertion in model container [2022-11-25 23:50:14,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:50:14" (3/3) ... [2022-11-25 23:50:14,606 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-11-25 23:50:14,616 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 23:50:14,629 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:50:14,630 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-25 23:50:14,630 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 23:50:14,747 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-25 23:50:14,789 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 23:50:14,824 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 245 places, 251 transitions, 518 flow [2022-11-25 23:50:14,830 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 245 places, 251 transitions, 518 flow [2022-11-25 23:50:14,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 251 transitions, 518 flow [2022-11-25 23:50:15,009 INFO L130 PetriNetUnfolder]: 13/249 cut-off events. [2022-11-25 23:50:15,010 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-25 23:50:15,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 249 events. 13/249 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 458 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2022-11-25 23:50:15,030 INFO L119 LiptonReduction]: Number of co-enabled transitions 14376 [2022-11-25 23:50:25,397 INFO L134 LiptonReduction]: Checked pairs total: 29976 [2022-11-25 23:50:25,397 INFO L136 LiptonReduction]: Total number of compositions: 235 [2022-11-25 23:50:25,406 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 63 places, 63 transitions, 142 flow [2022-11-25 23:50:25,506 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1160 states, 1112 states have (on average 2.7697841726618706) internal successors, (3080), 1159 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:25,533 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:50:25,543 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;@4c51b3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:50:25,551 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-11-25 23:50:25,557 INFO L276 IsEmpty]: Start isEmpty. Operand has 1160 states, 1112 states have (on average 2.7697841726618706) internal successors, (3080), 1159 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:25,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 23:50:25,573 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:25,575 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:25,576 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 23:50:25,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:25,581 INFO L85 PathProgramCache]: Analyzing trace with hash -261748653, now seen corresponding path program 1 times [2022-11-25 23:50:25,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:25,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935392151] [2022-11-25 23:50:25,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:25,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:26,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:26,998 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:26,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935392151] [2022-11-25 23:50:26,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935392151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:26,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:27,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:50:27,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212213507] [2022-11-25 23:50:27,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:27,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:50:27,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:27,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:50:27,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:50:27,041 INFO L87 Difference]: Start difference. First operand has 1160 states, 1112 states have (on average 2.7697841726618706) internal successors, (3080), 1159 states have internal predecessors, (3080), 0 states have call successors, (0), 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 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:27,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:27,319 INFO L93 Difference]: Finished difference Result 1168 states and 3096 transitions. [2022-11-25 23:50:27,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:50:27,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 23:50:27,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:27,342 INFO L225 Difference]: With dead ends: 1168 [2022-11-25 23:50:27,342 INFO L226 Difference]: Without dead ends: 1168 [2022-11-25 23:50:27,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:50:27,346 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 7 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:27,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 24 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:50:27,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2022-11-25 23:50:27,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1163. [2022-11-25 23:50:27,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 1115 states have (on average 2.768609865470852) internal successors, (3087), 1162 states have internal predecessors, (3087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:27,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 3087 transitions. [2022-11-25 23:50:27,478 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 3087 transitions. Word has length 7 [2022-11-25 23:50:27,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:27,479 INFO L495 AbstractCegarLoop]: Abstraction has 1163 states and 3087 transitions. [2022-11-25 23:50:27,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:27,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 3087 transitions. [2022-11-25 23:50:27,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 23:50:27,481 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:27,481 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:27,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:50:27,483 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 23:50:27,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:27,484 INFO L85 PathProgramCache]: Analyzing trace with hash 2023131929, now seen corresponding path program 1 times [2022-11-25 23:50:27,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:27,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869525761] [2022-11-25 23:50:27,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:27,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:28,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:28,167 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:28,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869525761] [2022-11-25 23:50:28,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869525761] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:28,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:28,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:50:28,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681456478] [2022-11-25 23:50:28,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:28,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:50:28,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:28,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:50:28,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:50:28,184 INFO L87 Difference]: Start difference. First operand 1163 states and 3087 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:28,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:28,508 INFO L93 Difference]: Finished difference Result 1537 states and 4057 transitions. [2022-11-25 23:50:28,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:50:28,508 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-25 23:50:28,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:28,522 INFO L225 Difference]: With dead ends: 1537 [2022-11-25 23:50:28,522 INFO L226 Difference]: Without dead ends: 1537 [2022-11-25 23:50:28,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:50:28,525 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 71 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:28,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 36 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:50:28,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2022-11-25 23:50:28,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1328. [2022-11-25 23:50:28,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1280 states have (on average 2.78359375) internal successors, (3563), 1327 states have internal predecessors, (3563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:28,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 3563 transitions. [2022-11-25 23:50:28,592 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 3563 transitions. Word has length 8 [2022-11-25 23:50:28,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:28,592 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 3563 transitions. [2022-11-25 23:50:28,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:28,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 3563 transitions. [2022-11-25 23:50:28,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 23:50:28,596 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:28,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:28,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:50:28,597 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 23:50:28,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:28,598 INFO L85 PathProgramCache]: Analyzing trace with hash 475825829, now seen corresponding path program 2 times [2022-11-25 23:50:28,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:28,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127218831] [2022-11-25 23:50:28,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:28,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:29,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:29,999 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:29,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127218831] [2022-11-25 23:50:30,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127218831] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:30,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:30,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:50:30,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055966165] [2022-11-25 23:50:30,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:30,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:50:30,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:30,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:50:30,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:50:30,001 INFO L87 Difference]: Start difference. First operand 1328 states and 3563 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:30,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:30,618 INFO L93 Difference]: Finished difference Result 1438 states and 3845 transitions. [2022-11-25 23:50:30,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:50:30,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-25 23:50:30,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:30,627 INFO L225 Difference]: With dead ends: 1438 [2022-11-25 23:50:30,628 INFO L226 Difference]: Without dead ends: 1438 [2022-11-25 23:50:30,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:50:30,632 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 47 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:30,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 42 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 23:50:30,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2022-11-25 23:50:30,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1328. [2022-11-25 23:50:30,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1280 states have (on average 2.78359375) internal successors, (3563), 1327 states have internal predecessors, (3563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:30,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 3563 transitions. [2022-11-25 23:50:30,742 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 3563 transitions. Word has length 8 [2022-11-25 23:50:30,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:30,742 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 3563 transitions. [2022-11-25 23:50:30,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:30,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 3563 transitions. [2022-11-25 23:50:30,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 23:50:30,750 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:30,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:30,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:50:30,751 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 23:50:30,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:30,755 INFO L85 PathProgramCache]: Analyzing trace with hash 475729109, now seen corresponding path program 3 times [2022-11-25 23:50:30,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:30,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536817361] [2022-11-25 23:50:30,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:30,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:31,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:31,640 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:31,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536817361] [2022-11-25 23:50:31,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536817361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:31,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:31,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:50:31,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636679712] [2022-11-25 23:50:31,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:31,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:50:31,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:31,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:50:31,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:50:31,642 INFO L87 Difference]: Start difference. First operand 1328 states and 3563 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:32,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:32,150 INFO L93 Difference]: Finished difference Result 1537 states and 4057 transitions. [2022-11-25 23:50:32,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:50:32,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-25 23:50:32,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:32,159 INFO L225 Difference]: With dead ends: 1537 [2022-11-25 23:50:32,159 INFO L226 Difference]: Without dead ends: 1537 [2022-11-25 23:50:32,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:50:32,163 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 110 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:32,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 24 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 23:50:32,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2022-11-25 23:50:32,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1328. [2022-11-25 23:50:32,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1280 states have (on average 2.78359375) internal successors, (3563), 1327 states have internal predecessors, (3563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:32,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 3563 transitions. [2022-11-25 23:50:32,210 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 3563 transitions. Word has length 8 [2022-11-25 23:50:32,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:32,210 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 3563 transitions. [2022-11-25 23:50:32,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:32,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 3563 transitions. [2022-11-25 23:50:32,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 23:50:32,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:32,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:32,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:50:32,213 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 23:50:32,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:32,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1933921403, now seen corresponding path program 1 times [2022-11-25 23:50:32,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:32,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788113508] [2022-11-25 23:50:32,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:32,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:32,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:32,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:32,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788113508] [2022-11-25 23:50:32,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788113508] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:32,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:32,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:50:32,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148794251] [2022-11-25 23:50:32,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:32,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:50:32,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:32,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:50:32,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:50:32,274 INFO L87 Difference]: Start difference. First operand 1328 states and 3563 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:32,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:32,491 INFO L93 Difference]: Finished difference Result 2154 states and 5798 transitions. [2022-11-25 23:50:32,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:50:32,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-25 23:50:32,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:32,504 INFO L225 Difference]: With dead ends: 2154 [2022-11-25 23:50:32,504 INFO L226 Difference]: Without dead ends: 2154 [2022-11-25 23:50:32,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:50:32,505 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 72 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:32,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 26 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:50:32,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2022-11-25 23:50:32,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1950. [2022-11-25 23:50:32,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1950 states, 1902 states have (on average 2.879074658254469) internal successors, (5476), 1949 states have internal predecessors, (5476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:32,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 5476 transitions. [2022-11-25 23:50:32,606 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 5476 transitions. Word has length 9 [2022-11-25 23:50:32,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:32,607 INFO L495 AbstractCegarLoop]: Abstraction has 1950 states and 5476 transitions. [2022-11-25 23:50:32,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:32,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 5476 transitions. [2022-11-25 23:50:32,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 23:50:32,609 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:32,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:32,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 23:50:32,610 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 23:50:32,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:32,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1903415787, now seen corresponding path program 1 times [2022-11-25 23:50:32,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:32,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151129258] [2022-11-25 23:50:32,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:32,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:33,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:33,076 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:33,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151129258] [2022-11-25 23:50:33,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151129258] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:33,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:33,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:50:33,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050317881] [2022-11-25 23:50:33,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:33,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:50:33,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:33,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:50:33,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:50:33,078 INFO L87 Difference]: Start difference. First operand 1950 states and 5476 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:33,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:33,316 INFO L93 Difference]: Finished difference Result 2250 states and 6218 transitions. [2022-11-25 23:50:33,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:50:33,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-25 23:50:33,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:33,328 INFO L225 Difference]: With dead ends: 2250 [2022-11-25 23:50:33,328 INFO L226 Difference]: Without dead ends: 2250 [2022-11-25 23:50:33,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:50:33,330 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 35 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:33,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 27 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:50:33,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2022-11-25 23:50:33,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 1953. [2022-11-25 23:50:33,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1953 states, 1905 states have (on average 2.877690288713911) internal successors, (5482), 1952 states have internal predecessors, (5482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:33,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1953 states and 5482 transitions. [2022-11-25 23:50:33,395 INFO L78 Accepts]: Start accepts. Automaton has 1953 states and 5482 transitions. Word has length 10 [2022-11-25 23:50:33,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:33,396 INFO L495 AbstractCegarLoop]: Abstraction has 1953 states and 5482 transitions. [2022-11-25 23:50:33,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:33,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 5482 transitions. [2022-11-25 23:50:33,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 23:50:33,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:33,397 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:33,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 23:50:33,399 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 23:50:33,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:33,399 INFO L85 PathProgramCache]: Analyzing trace with hash -155840155, now seen corresponding path program 1 times [2022-11-25 23:50:33,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:33,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652706905] [2022-11-25 23:50:33,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:33,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:33,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:33,841 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:33,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652706905] [2022-11-25 23:50:33,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652706905] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:33,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:33,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:50:33,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900857336] [2022-11-25 23:50:33,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:33,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 23:50:33,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:33,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 23:50:33,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:50:33,843 INFO L87 Difference]: Start difference. First operand 1953 states and 5482 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:34,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:34,176 INFO L93 Difference]: Finished difference Result 2748 states and 7497 transitions. [2022-11-25 23:50:34,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:50:34,177 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-25 23:50:34,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:34,192 INFO L225 Difference]: With dead ends: 2748 [2022-11-25 23:50:34,192 INFO L226 Difference]: Without dead ends: 2748 [2022-11-25 23:50:34,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:50:34,194 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 118 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:34,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 39 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:50:34,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2748 states. [2022-11-25 23:50:34,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2748 to 2198. [2022-11-25 23:50:34,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2198 states, 2150 states have (on average 2.8567441860465115) internal successors, (6142), 2197 states have internal predecessors, (6142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:34,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 2198 states and 6142 transitions. [2022-11-25 23:50:34,271 INFO L78 Accepts]: Start accepts. Automaton has 2198 states and 6142 transitions. Word has length 11 [2022-11-25 23:50:34,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:34,271 INFO L495 AbstractCegarLoop]: Abstraction has 2198 states and 6142 transitions. [2022-11-25 23:50:34,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:34,271 INFO L276 IsEmpty]: Start isEmpty. Operand 2198 states and 6142 transitions. [2022-11-25 23:50:34,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 23:50:34,273 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:34,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:34,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 23:50:34,273 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 23:50:34,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:34,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1222541532, now seen corresponding path program 1 times [2022-11-25 23:50:34,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:34,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996719533] [2022-11-25 23:50:34,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:34,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:34,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:34,366 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:34,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996719533] [2022-11-25 23:50:34,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996719533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:34,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:34,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:50:34,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556342295] [2022-11-25 23:50:34,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:34,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:50:34,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:34,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:50:34,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:50:34,369 INFO L87 Difference]: Start difference. First operand 2198 states and 6142 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:34,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:34,451 INFO L93 Difference]: Finished difference Result 614 states and 1423 transitions. [2022-11-25 23:50:34,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:50:34,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-25 23:50:34,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:34,455 INFO L225 Difference]: With dead ends: 614 [2022-11-25 23:50:34,455 INFO L226 Difference]: Without dead ends: 592 [2022-11-25 23:50:34,455 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-25 23:50:34,457 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 30 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:34,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 7 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:50:34,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-11-25 23:50:34,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2022-11-25 23:50:34,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 574 states have (on average 2.4059233449477353) internal successors, (1381), 591 states have internal predecessors, (1381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:34,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 1381 transitions. [2022-11-25 23:50:34,475 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 1381 transitions. Word has length 11 [2022-11-25 23:50:34,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:34,475 INFO L495 AbstractCegarLoop]: Abstraction has 592 states and 1381 transitions. [2022-11-25 23:50:34,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:34,476 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 1381 transitions. [2022-11-25 23:50:34,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 23:50:34,476 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:34,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:34,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 23:50:34,477 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 23:50:34,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:34,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1932122713, now seen corresponding path program 2 times [2022-11-25 23:50:34,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:34,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424533867] [2022-11-25 23:50:34,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:34,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:35,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:35,100 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:35,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424533867] [2022-11-25 23:50:35,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424533867] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:35,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:35,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:50:35,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057020902] [2022-11-25 23:50:35,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:35,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 23:50:35,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:35,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 23:50:35,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:50:35,103 INFO L87 Difference]: Start difference. First operand 592 states and 1381 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:35,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:35,310 INFO L93 Difference]: Finished difference Result 832 states and 1929 transitions. [2022-11-25 23:50:35,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:50:35,310 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-25 23:50:35,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:35,314 INFO L225 Difference]: With dead ends: 832 [2022-11-25 23:50:35,314 INFO L226 Difference]: Without dead ends: 832 [2022-11-25 23:50:35,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:50:35,315 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 58 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:35,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 19 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:50:35,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2022-11-25 23:50:35,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 581. [2022-11-25 23:50:35,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 563 states have (on average 2.408525754884547) internal successors, (1356), 580 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:35,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 1356 transitions. [2022-11-25 23:50:35,335 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 1356 transitions. Word has length 11 [2022-11-25 23:50:35,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:35,336 INFO L495 AbstractCegarLoop]: Abstraction has 581 states and 1356 transitions. [2022-11-25 23:50:35,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:35,336 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 1356 transitions. [2022-11-25 23:50:35,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 23:50:35,337 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:35,337 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:35,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 23:50:35,338 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 23:50:35,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:35,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1121752697, now seen corresponding path program 3 times [2022-11-25 23:50:35,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:35,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700090921] [2022-11-25 23:50:35,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:35,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:35,974 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:35,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700090921] [2022-11-25 23:50:35,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700090921] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:35,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:35,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 23:50:35,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104551185] [2022-11-25 23:50:35,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:35,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 23:50:35,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:35,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 23:50:35,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:50:35,977 INFO L87 Difference]: Start difference. First operand 581 states and 1356 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:36,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:36,243 INFO L93 Difference]: Finished difference Result 810 states and 1879 transitions. [2022-11-25 23:50:36,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:50:36,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-25 23:50:36,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:36,247 INFO L225 Difference]: With dead ends: 810 [2022-11-25 23:50:36,248 INFO L226 Difference]: Without dead ends: 810 [2022-11-25 23:50:36,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:50:36,248 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 51 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:36,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 24 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:50:36,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2022-11-25 23:50:36,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 570. [2022-11-25 23:50:36,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 552 states have (on average 2.411231884057971) internal successors, (1331), 569 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:36,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1331 transitions. [2022-11-25 23:50:36,268 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1331 transitions. Word has length 11 [2022-11-25 23:50:36,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:36,269 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 1331 transitions. [2022-11-25 23:50:36,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:36,269 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1331 transitions. [2022-11-25 23:50:36,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 23:50:36,270 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:36,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:36,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 23:50:36,271 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 23:50:36,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:36,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1796091972, now seen corresponding path program 1 times [2022-11-25 23:50:36,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:36,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432804187] [2022-11-25 23:50:36,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:36,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:36,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:36,340 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:36,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432804187] [2022-11-25 23:50:36,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432804187] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:50:36,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:50:36,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:50:36,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621771233] [2022-11-25 23:50:36,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:50:36,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:50:36,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:36,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:50:36,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:50:36,342 INFO L87 Difference]: Start difference. First operand 570 states and 1331 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:36,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:36,482 INFO L93 Difference]: Finished difference Result 606 states and 1406 transitions. [2022-11-25 23:50:36,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:50:36,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-11-25 23:50:36,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:36,486 INFO L225 Difference]: With dead ends: 606 [2022-11-25 23:50:36,486 INFO L226 Difference]: Without dead ends: 606 [2022-11-25 23:50:36,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:50:36,487 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 15 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:36,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 17 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:50:36,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2022-11-25 23:50:36,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2022-11-25 23:50:36,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 588 states have (on average 2.391156462585034) internal successors, (1406), 605 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:36,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1406 transitions. [2022-11-25 23:50:36,504 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1406 transitions. Word has length 13 [2022-11-25 23:50:36,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:36,504 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 1406 transitions. [2022-11-25 23:50:36,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:36,505 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1406 transitions. [2022-11-25 23:50:36,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 23:50:36,505 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:36,505 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:36,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 23:50:36,506 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 23:50:36,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:36,506 INFO L85 PathProgramCache]: Analyzing trace with hash -664587904, now seen corresponding path program 1 times [2022-11-25 23:50:36,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:36,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782637525] [2022-11-25 23:50:36,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:36,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:37,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:37,725 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:37,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782637525] [2022-11-25 23:50:37,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782637525] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:50:37,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296501771] [2022-11-25 23:50:37,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:37,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:50:37,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:50:37,734 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:50:37,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:50:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:37,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-25 23:50:37,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:50:38,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:38,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:38,112 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:50:38,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 23:50:38,127 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 23:50:38,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 23:50:38,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 23:50:38,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-25 23:50:38,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-25 23:50:38,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:38,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-25 23:50:39,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-25 23:50:39,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:39,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:50:39,300 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| Int) (v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| 4) |c_~#queue~0.offset|) v_ArrVal_441) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-25 23:50:39,415 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| Int) (v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_438 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_438)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_438) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| 4) |c_~#queue~0.offset|) v_ArrVal_441) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| (select .cse2 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-25 23:50:39,632 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| Int) (v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_438 Int) (v_ArrVal_435 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_435) .cse3 v_ArrVal_438)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_435) (< (+ (select .cse1 .cse3) 1) v_ArrVal_438) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| 4) |c_~#queue~0.offset|) v_ArrVal_441) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-25 23:50:46,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-25 23:50:46,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296501771] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:50:46,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1224016218] [2022-11-25 23:50:46,706 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:50:46,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:50:46,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2022-11-25 23:50:46,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476709106] [2022-11-25 23:50:46,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:50:46,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-25 23:50:46,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:46,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-25 23:50:46,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=662, Unknown=15, NotChecked=174, Total=1056 [2022-11-25 23:50:46,712 INFO L87 Difference]: Start difference. First operand 606 states and 1406 transitions. Second operand has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:50,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:50:50,713 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse0 (+ (select .cse4 .cse5) 1)) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| Int) (v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_438 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_438)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (< .cse0 v_ArrVal_438) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| 4) |c_~#queue~0.offset|) v_ArrVal_441) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| (select .cse1 .cse3)))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| Int) (v_ArrVal_441 Int) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_438 Int) (v_ArrVal_435 Int)) (let ((.cse6 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_435) .cse5 v_ArrVal_438)) |c_~#stored_elements~0.base| v_ArrVal_439) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| (select .cse6 .cse3))) (< .cse0 v_ArrVal_438) (not (<= v_ArrVal_435 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| 4) |c_~#queue~0.offset|) v_ArrVal_441) .cse2) 2147483647))))))) is different from false [2022-11-25 23:50:51,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:50:51,613 INFO L93 Difference]: Finished difference Result 641 states and 1472 transitions. [2022-11-25 23:50:51,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 23:50:51,614 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 23:50:51,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:50:51,617 INFO L225 Difference]: With dead ends: 641 [2022-11-25 23:50:51,617 INFO L226 Difference]: Without dead ends: 641 [2022-11-25 23:50:51,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=379, Invalid=1181, Unknown=16, NotChecked=316, Total=1892 [2022-11-25 23:50:51,618 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 37 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 10 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 285 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:50:51,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 148 Invalid, 1399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1099 Invalid, 5 Unknown, 285 Unchecked, 3.7s Time] [2022-11-25 23:50:51,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2022-11-25 23:50:51,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 618. [2022-11-25 23:50:51,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 600 states have (on average 2.3983333333333334) internal successors, (1439), 617 states have internal predecessors, (1439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:51,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 1439 transitions. [2022-11-25 23:50:51,648 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 1439 transitions. Word has length 16 [2022-11-25 23:50:51,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:50:51,648 INFO L495 AbstractCegarLoop]: Abstraction has 618 states and 1439 transitions. [2022-11-25 23:50:51,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:50:51,650 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 1439 transitions. [2022-11-25 23:50:51,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 23:50:51,651 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:50:51,651 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:50:51,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:50:51,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:50:51,864 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 23:50:51,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:50:51,865 INFO L85 PathProgramCache]: Analyzing trace with hash -664587903, now seen corresponding path program 1 times [2022-11-25 23:50:51,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:50:51,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79561064] [2022-11-25 23:50:51,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:51,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:50:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:52,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:52,405 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:50:52,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79561064] [2022-11-25 23:50:52,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79561064] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:50:52,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660349317] [2022-11-25 23:50:52,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:50:52,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:50:52,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:50:52,410 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:50:52,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:50:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:50:52,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-25 23:50:52,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:50:52,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:52,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:52,599 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:50:52,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 23:50:52,612 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 23:50:52,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 23:50:52,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 23:50:52,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-25 23:50:53,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-25 23:50:53,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:50:53,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-25 23:50:53,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-25 23:50:53,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:50:53,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:50:53,627 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 Int) (v_ArrVal_535 (Array Int Int)) (v_ArrVal_537 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_533)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (not (<= v_ArrVal_533 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| 4) |c_~#queue~0.offset|) v_ArrVal_537) (+ 1608 |c_~#queue~0.offset|))))))) is different from false [2022-11-25 23:50:53,653 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 Int) (v_ArrVal_535 (Array Int Int)) (v_ArrVal_537 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_533)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_533) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< 0 (+ 2147483650 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| 4) |c_~#queue~0.offset|) v_ArrVal_537) (+ 1608 |c_~#queue~0.offset|)))))))) is different from false [2022-11-25 23:50:53,759 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_533 Int) (v_ArrVal_535 (Array Int Int)) (v_ArrVal_531 Int) (v_ArrVal_537 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_531) .cse1 v_ArrVal_533)) |c_~#stored_elements~0.base| v_ArrVal_535) |c_~#queue~0.base|))) (or (< (+ v_ArrVal_531 2147483648) 0) (< (+ (select .cse0 .cse1) 1) v_ArrVal_533) (< 0 (+ (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| 4) |c_~#queue~0.offset|) v_ArrVal_537) (+ 1608 |c_~#queue~0.offset|)) 2147483650)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| (select .cse2 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-25 23:50:54,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-25 23:50:54,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660349317] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:50:54,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1164000333] [2022-11-25 23:50:54,169 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:50:54,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:50:54,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 25 [2022-11-25 23:50:54,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329716947] [2022-11-25 23:50:54,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:50:54,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-25 23:50:54,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:50:54,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-25 23:50:54,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=417, Unknown=9, NotChecked=138, Total=702 [2022-11-25 23:50:54,177 INFO L87 Difference]: Start difference. First operand 618 states and 1439 transitions. Second operand has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:15,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:51:15,441 INFO L93 Difference]: Finished difference Result 1827 states and 4242 transitions. [2022-11-25 23:51:15,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-25 23:51:15,442 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 23:51:15,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:51:15,450 INFO L225 Difference]: With dead ends: 1827 [2022-11-25 23:51:15,450 INFO L226 Difference]: Without dead ends: 1827 [2022-11-25 23:51:15,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=531, Invalid=1448, Unknown=13, NotChecked=264, Total=2256 [2022-11-25 23:51:15,452 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 502 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 54 mSolverCounterUnsat, 56 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 1862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 56 IncrementalHoareTripleChecker+Unknown, 414 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:51:15,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 204 Invalid, 1862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1338 Invalid, 56 Unknown, 414 Unchecked, 3.3s Time] [2022-11-25 23:51:15,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2022-11-25 23:51:15,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 873. [2022-11-25 23:51:15,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 855 states have (on average 2.5298245614035086) internal successors, (2163), 872 states have internal predecessors, (2163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:15,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 2163 transitions. [2022-11-25 23:51:15,499 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 2163 transitions. Word has length 16 [2022-11-25 23:51:15,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:51:15,499 INFO L495 AbstractCegarLoop]: Abstraction has 873 states and 2163 transitions. [2022-11-25 23:51:15,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:15,500 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 2163 transitions. [2022-11-25 23:51:15,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:51:15,500 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:51:15,501 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:51:15,510 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:51:15,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-25 23:51:15,706 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 23:51:15,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:51:15,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1032688262, now seen corresponding path program 1 times [2022-11-25 23:51:15,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:51:15,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526745185] [2022-11-25 23:51:15,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:51:15,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:51:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:51:17,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:51:17,318 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:51:17,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526745185] [2022-11-25 23:51:17,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526745185] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:51:17,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171540260] [2022-11-25 23:51:17,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:51:17,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:51:17,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:51:17,320 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:51:17,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:51:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:51:17,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-25 23:51:17,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:51:17,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:17,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:17,509 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:51:17,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 23:51:17,533 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 23:51:17,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 23:51:17,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 23:51:17,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 23:51:17,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-25 23:51:18,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-25 23:51:18,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:18,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-25 23:51:18,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-25 23:51:18,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:51:18,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:51:18,745 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| Int) (v_ArrVal_640 Int) (v_ArrVal_638 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_638) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| 4) |c_~#queue~0.offset|) v_ArrVal_640) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-25 23:51:18,766 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| Int) (v_ArrVal_640 Int) (v_ArrVal_638 (Array Int Int)) (v_ArrVal_636 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_636)) |c_~#stored_elements~0.base| v_ArrVal_638) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_636 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| 4) |c_~#queue~0.offset|) v_ArrVal_640) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-25 23:51:19,262 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| Int) (v_ArrVal_640 Int) (v_ArrVal_638 (Array Int Int)) (v_ArrVal_636 Int) (v_ArrVal_634 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_634) .cse3 v_ArrVal_636)) |c_~#stored_elements~0.base| v_ArrVal_638) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_634) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| 4) |c_~#queue~0.offset|) v_ArrVal_640) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_636))))) is different from false [2022-11-25 23:51:19,298 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| Int) (v_ArrVal_640 Int) (v_ArrVal_638 (Array Int Int)) (v_ArrVal_636 Int) (v_ArrVal_634 Int) (v_ArrVal_633 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_633)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_634) .cse3 v_ArrVal_636)) |c_~#stored_elements~0.base| v_ArrVal_638) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_634) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| 4) |c_~#queue~0.offset|) v_ArrVal_640) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse3) 1) v_ArrVal_636))))) is different from false [2022-11-25 23:51:26,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-25 23:51:26,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171540260] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:51:26,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1453315973] [2022-11-25 23:51:26,867 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:51:26,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:51:26,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-25 23:51:26,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40075164] [2022-11-25 23:51:26,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:51:26,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-25 23:51:26,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:51:26,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-25 23:51:26,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=754, Unknown=19, NotChecked=252, Total=1260 [2022-11-25 23:51:26,869 INFO L87 Difference]: Start difference. First operand 873 states and 2163 transitions. Second operand has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:29,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:51:29,681 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (+ (select .cse4 .cse5) 1))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| Int) (v_ArrVal_640 Int) (v_ArrVal_638 (Array Int Int)) (v_ArrVal_636 Int) (v_ArrVal_634 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_634) .cse5 v_ArrVal_636)) |c_~#stored_elements~0.base| v_ArrVal_638) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| 4) |c_~#queue~0.offset|) v_ArrVal_640) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| (select .cse0 .cse2))) (not (<= v_ArrVal_634 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< .cse3 v_ArrVal_636)))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| Int) (v_ArrVal_640 Int)) (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| (select .cse6 .cse2))) (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| 4) |c_~#queue~0.offset|) v_ArrVal_640) .cse1) 2147483647)))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| Int) (v_ArrVal_640 Int) (v_ArrVal_638 (Array Int Int)) (v_ArrVal_636 Int)) (let ((.cse7 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_636)) |c_~#stored_elements~0.base| v_ArrVal_638) |c_~#queue~0.base|))) (or (< (select (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| 4) |c_~#queue~0.offset|) v_ArrVal_640) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| (select .cse7 .cse2))) (< .cse3 v_ArrVal_636))))))) is different from false [2022-11-25 23:51:32,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:51:32,367 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| Int) (v_ArrVal_640 Int) (v_ArrVal_638 (Array Int Int)) (v_ArrVal_636 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_636)) |c_~#stored_elements~0.base| v_ArrVal_638) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| 4) |c_~#queue~0.offset|) v_ArrVal_640) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| (select .cse0 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_636)))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| Int) (v_ArrVal_640 Int) (v_ArrVal_638 (Array Int Int)) (v_ArrVal_636 Int)) (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_636)) |c_~#stored_elements~0.base| v_ArrVal_638) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_636 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| 4) |c_~#queue~0.offset|) v_ArrVal_640) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| (select .cse5 .cse2)))))))) is different from false [2022-11-25 23:51:37,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:51:37,767 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (+ (select .cse4 .cse5) 1))) (and (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| Int) (v_ArrVal_640 Int) (v_ArrVal_638 (Array Int Int)) (v_ArrVal_636 Int) (v_ArrVal_634 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_634) .cse5 v_ArrVal_636)) |c_~#stored_elements~0.base| v_ArrVal_638) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| 4) |c_~#queue~0.offset|) v_ArrVal_640) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| (select .cse0 .cse2))) (not (<= v_ArrVal_634 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< .cse3 v_ArrVal_636)))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| Int) (v_ArrVal_640 Int) (v_ArrVal_638 (Array Int Int)) (v_ArrVal_636 Int)) (let ((.cse6 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_636)) |c_~#stored_elements~0.base| v_ArrVal_638) |c_~#queue~0.base|))) (or (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| 4) |c_~#queue~0.offset|) v_ArrVal_640) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| (select .cse6 .cse2))) (< .cse3 v_ArrVal_636))))))) is different from false [2022-11-25 23:51:38,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:51:38,819 INFO L93 Difference]: Finished difference Result 1570 states and 3772 transitions. [2022-11-25 23:51:38,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-25 23:51:38,820 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 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 17 [2022-11-25 23:51:38,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:51:38,825 INFO L225 Difference]: With dead ends: 1570 [2022-11-25 23:51:38,825 INFO L226 Difference]: Without dead ends: 1570 [2022-11-25 23:51:38,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=524, Invalid=1640, Unknown=26, NotChecked=672, Total=2862 [2022-11-25 23:51:38,827 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 439 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 25 mSolverCounterUnsat, 54 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 2388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 54 IncrementalHoareTripleChecker+Unknown, 961 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:51:38,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 209 Invalid, 2388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1348 Invalid, 54 Unknown, 961 Unchecked, 8.3s Time] [2022-11-25 23:51:38,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2022-11-25 23:51:38,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1148. [2022-11-25 23:51:38,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1130 states have (on average 2.5247787610619468) internal successors, (2853), 1147 states have internal predecessors, (2853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:38,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 2853 transitions. [2022-11-25 23:51:38,862 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 2853 transitions. Word has length 17 [2022-11-25 23:51:38,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:51:38,863 INFO L495 AbstractCegarLoop]: Abstraction has 1148 states and 2853 transitions. [2022-11-25 23:51:38,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:38,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 2853 transitions. [2022-11-25 23:51:38,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:51:38,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:51:38,865 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:51:38,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 23:51:39,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-25 23:51:39,075 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 23:51:39,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:51:39,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1846649884, now seen corresponding path program 2 times [2022-11-25 23:51:39,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:51:39,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779216548] [2022-11-25 23:51:39,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:51:39,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:51:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:51:40,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:51:40,468 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:51:40,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779216548] [2022-11-25 23:51:40,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779216548] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:51:40,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894578910] [2022-11-25 23:51:40,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:51:40,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:51:40,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:51:40,469 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:51:40,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 23:51:40,659 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 23:51:40,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:51:40,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-25 23:51:40,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:51:40,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:40,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:40,699 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:51:40,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 23:51:40,724 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 23:51:40,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 23:51:40,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 23:51:41,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 44 [2022-11-25 23:51:41,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-25 23:51:41,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-25 23:51:41,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:51:41,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-25 23:51:41,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-25 23:51:41,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:51:41,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:51:41,983 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| Int) (v_ArrVal_741 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_741) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| 4) |c_~#queue~0.offset|) v_ArrVal_742) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-25 23:51:43,034 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 Int) (v_ArrVal_740 Int) (v_ArrVal_738 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| Int) (v_ArrVal_741 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_738) .cse2 v_ArrVal_740)) |c_~#stored_elements~0.base| v_ArrVal_741) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_740) (not (<= v_ArrVal_738 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| 4) |c_~#queue~0.offset|) v_ArrVal_742) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-25 23:51:43,091 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 Int) (v_ArrVal_740 Int) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_738 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| Int) (v_ArrVal_741 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_736))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_738) .cse1 v_ArrVal_740)) |c_~#stored_elements~0.base| v_ArrVal_741) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_738 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse0 .cse1) 1) v_ArrVal_740) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| 4) |c_~#queue~0.offset|) v_ArrVal_742) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-25 23:51:43,315 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 Int) (v_ArrVal_740 Int) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_738 Int) (v_ArrVal_734 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| Int) (v_ArrVal_741 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_734))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| .cse2) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_736))) (let ((.cse0 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse3 v_ArrVal_738) .cse1 v_ArrVal_740)) |c_~#stored_elements~0.base| v_ArrVal_741) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_740) (< (+ (select .cse2 .cse3) 1) v_ArrVal_738) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| (select .cse4 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| 4) |c_~#queue~0.offset|) v_ArrVal_742) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2022-11-25 23:51:43,354 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 Int) (v_ArrVal_740 Int) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_738 Int) (v_ArrVal_734 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_151| Int) (v_ArrVal_741 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_151| 4) |c_~#queue~0.offset|) v_ArrVal_734))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| .cse4) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_736))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse3 v_ArrVal_738) .cse1 v_ArrVal_740)) |c_~#stored_elements~0.base| v_ArrVal_741) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_151| (select .cse0 .cse1))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| 4) |c_~#queue~0.offset|) v_ArrVal_742) .cse3) 2147483647) (< (+ (select .cse4 .cse3) 1) v_ArrVal_738) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| (select .cse2 .cse1))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_740)))))))) is different from false [2022-11-25 23:51:43,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-25 23:51:43,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894578910] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:51:43,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [441465603] [2022-11-25 23:51:43,458 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:51:43,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:51:43,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-25 23:51:43,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175418179] [2022-11-25 23:51:43,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:51:43,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-25 23:51:43,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:51:43,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-25 23:51:43,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=708, Unknown=20, NotChecked=310, Total=1260 [2022-11-25 23:51:43,463 INFO L87 Difference]: Start difference. First operand 1148 states and 2853 transitions. Second operand has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:51:48,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:51:50,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:51:52,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:51:54,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:51:56,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:51:59,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:52:01,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:52:03,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:52:03,070 INFO L93 Difference]: Finished difference Result 1408 states and 3446 transitions. [2022-11-25 23:52:03,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 23:52:03,070 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 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 17 [2022-11-25 23:52:03,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:52:03,076 INFO L225 Difference]: With dead ends: 1408 [2022-11-25 23:52:03,076 INFO L226 Difference]: Without dead ends: 1408 [2022-11-25 23:52:03,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 5 IntricatePredicates, 2 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=467, Invalid=1335, Unknown=24, NotChecked=430, Total=2256 [2022-11-25 23:52:03,078 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 474 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 32 mSolverCounterUnsat, 52 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 52 IncrementalHoareTripleChecker+Unknown, 569 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:52:03,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 131 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 935 Invalid, 52 Unknown, 569 Unchecked, 16.0s Time] [2022-11-25 23:52:03,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2022-11-25 23:52:03,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1082. [2022-11-25 23:52:03,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 1064 states have (on average 2.5404135338345863) internal successors, (2703), 1081 states have internal predecessors, (2703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:52:03,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 2703 transitions. [2022-11-25 23:52:03,112 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 2703 transitions. Word has length 17 [2022-11-25 23:52:03,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:52:03,113 INFO L495 AbstractCegarLoop]: Abstraction has 1082 states and 2703 transitions. [2022-11-25 23:52:03,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:52:03,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 2703 transitions. [2022-11-25 23:52:03,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:52:03,115 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:52:03,115 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:52:03,126 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 23:52:03,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:52:03,322 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 23:52:03,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:52:03,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1825643676, now seen corresponding path program 3 times [2022-11-25 23:52:03,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:52:03,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978880150] [2022-11-25 23:52:03,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:52:03,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:52:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:52:04,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:52:04,597 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:52:04,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978880150] [2022-11-25 23:52:04,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978880150] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:52:04,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403964011] [2022-11-25 23:52:04,598 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:52:04,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:52:04,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:52:04,600 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:52:04,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 23:52:04,818 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:52:04,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:52:04,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-25 23:52:04,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:52:04,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:52:04,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:52:04,899 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:52:04,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 23:52:04,931 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 23:52:04,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 23:52:05,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 23:52:05,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-25 23:52:05,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-25 23:52:05,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-25 23:52:05,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:52:05,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-25 23:52:06,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-25 23:52:06,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:52:06,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:52:06,472 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_155| Int) (v_ArrVal_844 (Array Int Int)) (v_ArrVal_846 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_844) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_155| 4) |c_~#queue~0.offset|) v_ArrVal_846) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_155| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-25 23:52:06,611 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_155| Int) (v_ArrVal_844 (Array Int Int)) (v_ArrVal_846 Int) (v_ArrVal_842 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_842)) |c_~#stored_elements~0.base| v_ArrVal_844) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_842) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_155| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_155| 4) |c_~#queue~0.offset|) v_ArrVal_846) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-25 23:52:06,656 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_155| Int) (v_ArrVal_844 (Array Int Int)) (v_ArrVal_846 Int) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_842 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_841))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_842)) |c_~#stored_elements~0.base| v_ArrVal_844) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_842) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_155| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_155| 4) |c_~#queue~0.offset|) v_ArrVal_846) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-25 23:52:06,699 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_155| Int) (v_ArrVal_844 (Array Int Int)) (v_ArrVal_846 Int) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_842 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_840)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_841))) (let ((.cse1 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_842)) |c_~#stored_elements~0.base| v_ArrVal_844) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_155| 4) |c_~#queue~0.offset|) v_ArrVal_846) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_840 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_155| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_842)))))) is different from false [2022-11-25 23:52:06,743 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_155| Int) (v_ArrVal_844 (Array Int Int)) (v_ArrVal_846 Int) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_842 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_840)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_841))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_842)) |c_~#stored_elements~0.base| v_ArrVal_844) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_155| 4) |c_~#queue~0.offset|) v_ArrVal_846) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_840) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_155| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_842))))))) is different from false [2022-11-25 23:52:06,800 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_155| Int) (v_ArrVal_844 (Array Int Int)) (v_ArrVal_838 Int) (v_ArrVal_846 Int) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_842 Int)) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_838)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_840)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_841))) (let ((.cse3 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_842)) |c_~#stored_elements~0.base| v_ArrVal_844) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_155| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_155| 4) |c_~#queue~0.offset|) v_ArrVal_846) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_840) (< (+ (select .cse3 .cse4) 1) v_ArrVal_842))))))) is different from false [2022-11-25 23:52:06,848 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_155| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| Int) (v_ArrVal_844 (Array Int Int)) (v_ArrVal_838 Int) (v_ArrVal_846 Int) (v_ArrVal_841 (Array Int Int)) (v_ArrVal_842 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| 4) |c_~#queue~0.offset|) v_ArrVal_838)) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_840)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_841))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store .cse5 .cse3 v_ArrVal_842)) |c_~#stored_elements~0.base| v_ArrVal_844) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_840) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| (select .cse2 .cse3))) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_155| 4) |c_~#queue~0.offset|) v_ArrVal_846) .cse1) 2147483647) (< (+ (select .cse5 .cse3) 1) v_ArrVal_842) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_155| (select .cse4 .cse3)))))))))) is different from false [2022-11-25 23:52:06,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-25 23:52:06,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403964011] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:52:06,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [798650262] [2022-11-25 23:52:06,961 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:52:06,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:52:06,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-25 23:52:06,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416760069] [2022-11-25 23:52:06,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:52:06,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-25 23:52:06,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:52:06,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-25 23:52:06,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=604, Unknown=9, NotChecked=420, Total=1260 [2022-11-25 23:52:06,986 INFO L87 Difference]: Start difference. First operand 1082 states and 2703 transitions. Second operand has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:52:11,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:52:11,376 INFO L93 Difference]: Finished difference Result 1436 states and 3511 transitions. [2022-11-25 23:52:11,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 23:52:11,377 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 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 17 [2022-11-25 23:52:11,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:52:11,381 INFO L225 Difference]: With dead ends: 1436 [2022-11-25 23:52:11,381 INFO L226 Difference]: Without dead ends: 1436 [2022-11-25 23:52:11,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 7 IntricatePredicates, 3 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=435, Invalid=1066, Unknown=9, NotChecked=560, Total=2070 [2022-11-25 23:52:11,382 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 357 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 833 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:52:11,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 97 Invalid, 1616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 756 Invalid, 0 Unknown, 833 Unchecked, 1.1s Time] [2022-11-25 23:52:11,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2022-11-25 23:52:11,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1137. [2022-11-25 23:52:11,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 1119 states have (on average 2.5415549597855227) internal successors, (2844), 1136 states have internal predecessors, (2844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:52:11,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 2844 transitions. [2022-11-25 23:52:11,415 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 2844 transitions. Word has length 17 [2022-11-25 23:52:11,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:52:11,416 INFO L495 AbstractCegarLoop]: Abstraction has 1137 states and 2844 transitions. [2022-11-25 23:52:11,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:52:11,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 2844 transitions. [2022-11-25 23:52:11,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:52:11,418 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:52:11,418 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:52:11,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-25 23:52:11,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 23:52:11,624 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 23:52:11,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:52:11,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1825643677, now seen corresponding path program 1 times [2022-11-25 23:52:11,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:52:11,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323416390] [2022-11-25 23:52:11,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:52:11,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:52:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:52:12,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:52:12,819 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:52:12,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323416390] [2022-11-25 23:52:12,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323416390] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:52:12,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40927483] [2022-11-25 23:52:12,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:52:12,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:52:12,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:52:12,821 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:52:12,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 23:52:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:52:12,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-25 23:52:12,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:52:13,011 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 23:52:13,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-25 23:52:13,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:52:13,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:52:13,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 23:52:13,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-25 23:52:13,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:52:13,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 23:52:13,477 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-25 23:52:13,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-11-25 23:52:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:52:13,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:52:13,724 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_931 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_933 Int)) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_931) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_933) (+ 1608 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_933 2147483648) 0))) is different from false [2022-11-25 23:52:13,943 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:52:13,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 48 [2022-11-25 23:52:13,962 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:52:13,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2209 treesize of output 2187 [2022-11-25 23:52:13,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2650 treesize of output 2490 [2022-11-25 23:52:14,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4610 treesize of output 4442 [2022-11-25 23:52:14,364 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:52:14,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1021 treesize of output 993 [2022-11-25 23:52:16,005 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:52:16,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4511 treesize of output 4463 [2022-11-25 23:52:29,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:52:29,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40927483] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:52:29,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1771832258] [2022-11-25 23:52:29,209 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:52:29,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:52:29,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 26 [2022-11-25 23:52:29,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123665459] [2022-11-25 23:52:29,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:52:29,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-25 23:52:29,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:52:29,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 23:52:29,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=575, Unknown=8, NotChecked=50, Total=756 [2022-11-25 23:52:29,211 INFO L87 Difference]: Start difference. First operand 1137 states and 2844 transitions. Second operand has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:52:29,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:52:29,867 INFO L93 Difference]: Finished difference Result 1221 states and 3007 transitions. [2022-11-25 23:52:29,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:52:29,867 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 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 17 [2022-11-25 23:52:29,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:52:29,871 INFO L225 Difference]: With dead ends: 1221 [2022-11-25 23:52:29,872 INFO L226 Difference]: Without dead ends: 1221 [2022-11-25 23:52:29,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=172, Invalid=694, Unknown=8, NotChecked=56, Total=930 [2022-11-25 23:52:29,873 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 471 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:52:29,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 34 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 364 Invalid, 0 Unknown, 71 Unchecked, 0.5s Time] [2022-11-25 23:52:29,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2022-11-25 23:52:29,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 956. [2022-11-25 23:52:29,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 940 states have (on average 2.4925531914893617) internal successors, (2343), 955 states have internal predecessors, (2343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:52:29,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2343 transitions. [2022-11-25 23:52:29,904 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 2343 transitions. Word has length 17 [2022-11-25 23:52:29,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:52:29,905 INFO L495 AbstractCegarLoop]: Abstraction has 956 states and 2343 transitions. [2022-11-25 23:52:29,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:52:29,905 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2343 transitions. [2022-11-25 23:52:29,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:52:29,906 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:52:29,907 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:52:29,913 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-25 23:52:30,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 23:52:30,113 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 23:52:30,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:52:30,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1166113846, now seen corresponding path program 4 times [2022-11-25 23:52:30,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:52:30,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498021358] [2022-11-25 23:52:30,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:52:30,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:52:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:52:31,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:52:31,918 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:52:31,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498021358] [2022-11-25 23:52:31,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498021358] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:52:31,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877465500] [2022-11-25 23:52:31,919 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 23:52:31,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:52:31,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:52:31,926 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:52:31,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 23:52:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:52:32,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-25 23:52:32,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:52:32,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:52:32,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:52:32,169 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:52:32,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 23:52:32,195 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 23:52:32,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 23:52:32,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 23:52:32,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-25 23:52:32,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-25 23:52:32,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-25 23:52:33,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:52:33,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-25 23:52:33,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-25 23:52:33,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:52:33,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:52:33,568 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| Int) (v_ArrVal_1035 Int) (v_ArrVal_1034 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1034) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| 4) |c_~#queue~0.offset|) v_ArrVal_1035) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-25 23:52:33,581 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| Int) (v_ArrVal_1035 Int) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1033 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1033) |c_~#stored_elements~0.base| v_ArrVal_1034) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| 4) |c_~#queue~0.offset|) v_ArrVal_1035) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-25 23:52:33,625 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| Int) (v_ArrVal_1032 Int) (v_ArrVal_1035 Int) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1033 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_1032)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1033) |c_~#stored_elements~0.base| v_ArrVal_1034) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| 4) |c_~#queue~0.offset|) v_ArrVal_1035) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_1032 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))))) is different from false [2022-11-25 23:52:33,652 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| Int) (v_ArrVal_1032 Int) (v_ArrVal_1035 Int) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1033 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1032)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1033) |c_~#stored_elements~0.base| v_ArrVal_1034) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1032) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| 4) |c_~#queue~0.offset|) v_ArrVal_1035) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-25 23:52:44,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:52:44,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877465500] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:52:44,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2086130915] [2022-11-25 23:52:44,138 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:52:44,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:52:44,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 35 [2022-11-25 23:52:44,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681705777] [2022-11-25 23:52:44,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:52:44,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-25 23:52:44,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:52:44,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-25 23:52:44,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=821, Unknown=22, NotChecked=260, Total=1332 [2022-11-25 23:52:44,141 INFO L87 Difference]: Start difference. First operand 956 states and 2343 transitions. Second operand has 37 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:52:48,295 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse16 (select .cse5 .cse6))) (let ((.cse0 (= 400 .cse16)) (.cse3 (+ .cse16 1)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse11 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse7 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (or .cse0 (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| Int) (v_ArrVal_1032 Int) (v_ArrVal_1035 Int) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1033 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_1032)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1033) |c_~#stored_elements~0.base| v_ArrVal_1034) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| (select .cse1 .cse2))) (< .cse3 v_ArrVal_1032) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| 4) |c_~#queue~0.offset|) v_ArrVal_1035) .cse4) 2147483647))))) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| 4)) (or .cse0 (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| Int) (v_ArrVal_1032 Int) (v_ArrVal_1035 Int) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1029 Int)) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse7 v_ArrVal_1029) .cse6 v_ArrVal_1032)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1033) |c_~#stored_elements~0.base| v_ArrVal_1034) |c_~#queue~0.base|))) (or (< .cse3 v_ArrVal_1032) (< (+ (select .cse5 .cse7) 1) v_ArrVal_1029) (< (select (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| 4) |c_~#queue~0.offset|) v_ArrVal_1035) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| (select .cse8 .cse2))))))) (= |c_~#queue~0.offset| 0) (= 5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_165| Int) (v_ArrVal_1032 Int) (v_ArrVal_1035 Int) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1027 Int) (v_ArrVal_1029 Int)) (let ((.cse12 (store .cse11 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_165| 4) |c_~#queue~0.offset|) v_ArrVal_1027))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse12 .cse4 v_ArrVal_1029) .cse2 v_ArrVal_1032)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1033) |c_~#stored_elements~0.base| v_ArrVal_1034) |c_~#queue~0.base|)) (.cse10 (select .cse12 .cse2))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| (select .cse9 .cse2))) (< (+ .cse10 1) v_ArrVal_1032) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_165| (select .cse11 .cse2))) (< (select (store .cse9 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| 4) |c_~#queue~0.offset|) v_ArrVal_1035) .cse4) 2147483647) (< (+ (select .cse12 .cse4) 1) v_ArrVal_1029) (= 400 .cse10))))) (let ((.cse14 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (or (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|))) (and (<= (* (select .cse13 1604) 4) 4) .cse14 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 1604)) (<= (select .cse13 1608) 1) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#stored_elements~0.base|)) (not (= 1608 |c_ULTIMATE.start_main_~#id2~0#1.offset|)))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse11 1608) 1) (not .cse14) (<= (select .cse11 1604) 1)))) (exists ((v_ArrVal_1032 Int) (v_ArrVal_1035 Int) (v_ArrVal_1027 Int) (v_ArrVal_1029 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_162| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_163| Int)) (let ((.cse15 (store (store (store (store ((as const (Array Int Int)) 0) (+ 1600 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) 0) .cse6 0) .cse7 0) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_162| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1027))) (and (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_163| v_ArrVal_1032) (<= v_ArrVal_1032 (+ (select .cse15 .cse6) 1)) (<= v_ArrVal_1029 (+ (select .cse15 .cse7) 1)) (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_162| 0) (= .cse5 (store (store (store .cse15 .cse7 v_ArrVal_1029) .cse6 v_ArrVal_1032) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_163| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1035))))))))) is different from false [2022-11-25 23:52:50,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:52:50,780 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse10 (select .cse4 .cse6))) (let ((.cse7 (= 400 .cse10)) (.cse0 (+ .cse10 1)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse5 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (or (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| Int) (v_ArrVal_1032 Int) (v_ArrVal_1035 Int) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1029 Int)) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 .cse5 v_ArrVal_1029) .cse6 v_ArrVal_1032)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1033) |c_~#stored_elements~0.base| v_ArrVal_1034) |c_~#queue~0.base|))) (or (< .cse0 v_ArrVal_1032) (not (<= v_ArrVal_1029 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| 4) |c_~#queue~0.offset|) v_ArrVal_1035) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| (select .cse1 .cse3)))))) .cse7) (or .cse7 (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| Int) (v_ArrVal_1032 Int) (v_ArrVal_1035 Int) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1033 (Array Int Int))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse6 v_ArrVal_1032)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1033) |c_~#stored_elements~0.base| v_ArrVal_1034) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| (select .cse8 .cse3))) (< .cse0 v_ArrVal_1032) (< (select (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| 4) |c_~#queue~0.offset|) v_ArrVal_1035) .cse2) 2147483647))))) (or .cse7 (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| Int) (v_ArrVal_1032 Int) (v_ArrVal_1035 Int) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1029 Int)) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 .cse5 v_ArrVal_1029) .cse6 v_ArrVal_1032)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1033) |c_~#stored_elements~0.base| v_ArrVal_1034) |c_~#queue~0.base|))) (or (< .cse0 v_ArrVal_1032) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1029) (< (select (store .cse9 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| 4) |c_~#queue~0.offset|) v_ArrVal_1035) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| (select .cse9 .cse3))))))))))) is different from false [2022-11-25 23:52:53,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:52:54,311 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (let ((.cse1 (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| Int) (v_ArrVal_1032 Int) (v_ArrVal_1035 Int) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1033 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1032)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1033) |c_~#stored_elements~0.base| v_ArrVal_1034) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (+ .cse0 1) v_ArrVal_1032) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| 4) |c_~#queue~0.offset|) v_ArrVal_1035) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) (and (or (= 400 .cse0) .cse1) .cse1)))) is different from false [2022-11-25 23:52:56,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:52:58,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:53:00,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:53:02,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:53:02,008 INFO L93 Difference]: Finished difference Result 2034 states and 4899 transitions. [2022-11-25 23:53:02,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-25 23:53:02,009 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 0 states have call successors, (0), 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 17 [2022-11-25 23:53:02,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:53:02,015 INFO L225 Difference]: With dead ends: 2034 [2022-11-25 23:53:02,015 INFO L226 Difference]: Without dead ends: 2034 [2022-11-25 23:53:02,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=605, Invalid=1747, Unknown=28, NotChecked=700, Total=3080 [2022-11-25 23:53:02,017 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 859 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 59 mSolverCounterUnsat, 41 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 2099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 41 IncrementalHoareTripleChecker+Unknown, 640 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:53:02,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 196 Invalid, 2099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1359 Invalid, 41 Unknown, 640 Unchecked, 15.0s Time] [2022-11-25 23:53:02,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2022-11-25 23:53:02,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 979. [2022-11-25 23:53:02,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 963 states have (on average 2.5046728971962615) internal successors, (2412), 978 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:53:02,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 2412 transitions. [2022-11-25 23:53:02,051 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 2412 transitions. Word has length 17 [2022-11-25 23:53:02,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:53:02,051 INFO L495 AbstractCegarLoop]: Abstraction has 979 states and 2412 transitions. [2022-11-25 23:53:02,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:53:02,052 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 2412 transitions. [2022-11-25 23:53:02,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:53:02,053 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:53:02,053 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:53:02,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 23:53:02,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-25 23:53:02,264 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 23:53:02,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:53:02,264 INFO L85 PathProgramCache]: Analyzing trace with hash 872614216, now seen corresponding path program 5 times [2022-11-25 23:53:02,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:53:02,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363027308] [2022-11-25 23:53:02,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:53:02,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:53:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:53:03,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:53:03,435 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:53:03,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363027308] [2022-11-25 23:53:03,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363027308] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:53:03,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173575761] [2022-11-25 23:53:03,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:53:03,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:53:03,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:53:03,438 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:53:03,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 23:53:03,643 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 23:53:03,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:53:03,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-25 23:53:03,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:53:03,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:53:03,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:53:03,690 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:53:03,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 23:53:03,710 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 23:53:03,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 23:53:03,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 23:53:04,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-25 23:53:04,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-25 23:53:04,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:53:04,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-25 23:53:04,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-25 23:53:04,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2022-11-25 23:53:04,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:53:04,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:53:04,915 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1138 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1138) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647)) is different from false [2022-11-25 23:53:05,050 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1138 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| Int) (v_ArrVal_1135 (Array Int Int)) (v_ArrVal_1136 Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1135))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| 4) |c_~#queue~0.offset|) v_ArrVal_1136)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1138) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| (select .cse1 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-25 23:53:05,068 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1138 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| Int) (v_ArrVal_1134 Int) (v_ArrVal_1135 (Array Int Int)) (v_ArrVal_1136 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_1134)) |c_~#stored_elements~0.base| v_ArrVal_1135))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (not (<= v_ArrVal_1134 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| 4) |c_~#queue~0.offset|) v_ArrVal_1136)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1138) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-25 23:53:05,185 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (select .cse3 .cse4))) (or (forall ((v_ArrVal_1138 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| Int) (v_ArrVal_1134 Int) (v_ArrVal_1135 (Array Int Int)) (v_ArrVal_1136 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1134)) |c_~#stored_elements~0.base| v_ArrVal_1135))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ .cse1 1) v_ArrVal_1134) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| 4) |c_~#queue~0.offset|) v_ArrVal_1136)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1138) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) (= 400 .cse1)))) is different from false [2022-11-25 23:53:05,224 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select .cse3 .cse4))) (or (forall ((v_ArrVal_1132 Int) (v_ArrVal_1138 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| Int) (v_ArrVal_1134 Int) (v_ArrVal_1135 (Array Int Int)) (v_ArrVal_1136 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1132) .cse4 v_ArrVal_1134)) |c_~#stored_elements~0.base| v_ArrVal_1135))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| 4) |c_~#queue~0.offset|) v_ArrVal_1136)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1138) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| (select .cse1 (+ |c_~#queue~0.offset| 1604)))) (< (+ .cse2 1) v_ArrVal_1134) (not (<= v_ArrVal_1132 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))))))) (= 400 .cse2)))) is different from false [2022-11-25 23:53:05,436 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1130 Int) (v_ArrVal_1132 Int) (v_ArrVal_1138 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| Int) (v_ArrVal_1134 Int) (v_ArrVal_1135 (Array Int Int)) (v_ArrVal_1136 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1130)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_1132) .cse5 v_ArrVal_1134)) |c_~#stored_elements~0.base| v_ArrVal_1135))) (let ((.cse0 (select .cse2 .cse5)) (.cse1 (select .cse4 |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_1134) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| (select .cse1 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1132) (= 400 .cse0) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| 4) |c_~#queue~0.offset|) v_ArrVal_1136)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1138) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-25 23:53:10,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-25 23:53:10,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173575761] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:53:10,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [773164748] [2022-11-25 23:53:10,671 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:53:10,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:53:10,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 35 [2022-11-25 23:53:10,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585058256] [2022-11-25 23:53:10,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:53:10,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-25 23:53:10,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:53:10,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-25 23:53:10,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=674, Unknown=18, NotChecked=378, Total=1332 [2022-11-25 23:53:10,674 INFO L87 Difference]: Start difference. First operand 979 states and 2412 transitions. Second operand has 37 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:53:18,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:53:18,035 INFO L93 Difference]: Finished difference Result 1270 states and 3082 transitions. [2022-11-25 23:53:18,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 23:53:18,035 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 0 states have call successors, (0), 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 17 [2022-11-25 23:53:18,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:53:18,039 INFO L225 Difference]: With dead ends: 1270 [2022-11-25 23:53:18,040 INFO L226 Difference]: Without dead ends: 1270 [2022-11-25 23:53:18,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 9 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=488, Invalid=1156, Unknown=20, NotChecked=498, Total=2162 [2022-11-25 23:53:18,041 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 385 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 47 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 679 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:53:18,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 120 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 852 Invalid, 20 Unknown, 679 Unchecked, 2.5s Time] [2022-11-25 23:53:18,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2022-11-25 23:53:18,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 934. [2022-11-25 23:53:18,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 918 states have (on average 2.497821350762527) internal successors, (2293), 933 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:53:18,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 2293 transitions. [2022-11-25 23:53:18,067 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 2293 transitions. Word has length 17 [2022-11-25 23:53:18,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:53:18,067 INFO L495 AbstractCegarLoop]: Abstraction has 934 states and 2293 transitions. [2022-11-25 23:53:18,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:53:18,068 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 2293 transitions. [2022-11-25 23:53:18,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 23:53:18,069 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:53:18,069 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:53:18,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 23:53:18,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:53:18,275 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 23:53:18,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:53:18,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1057914270, now seen corresponding path program 1 times [2022-11-25 23:53:18,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:53:18,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747730626] [2022-11-25 23:53:18,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:53:18,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:53:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:53:18,897 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-25 23:53:18,897 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:53:18,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747730626] [2022-11-25 23:53:18,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747730626] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:53:18,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768664124] [2022-11-25 23:53:18,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:53:18,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:53:18,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:53:18,899 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:53:18,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 23:53:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:53:19,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-25 23:53:19,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:53:19,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:53:19,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:53:19,147 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:53:19,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 23:53:19,164 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 23:53:19,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 23:53:19,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 23:53:19,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-25 23:53:19,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-25 23:53:19,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:53:19,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-25 23:53:19,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-25 23:53:20,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-11-25 23:53:20,354 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-25 23:53:20,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:53:20,460 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1238 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1236) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (<= 0 (+ 2147483649 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| 4) |c_~#queue~0.offset|) v_ArrVal_1238) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| (select .cse0 .cse1)))))) is different from false [2022-11-25 23:53:20,681 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1233 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem40#1_143| Int) (v_ArrVal_1238 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1233) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~mem40#1_143| 1))) |c_~#stored_elements~0.base| v_ArrVal_1236) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem40#1_143| (select .cse2 .cse3))) (<= 0 (+ 2147483649 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| 4) |c_~#queue~0.offset|) v_ArrVal_1238) .cse1))) (not (<= 0 (+ 2147483649 |v_t1Thread1of1ForFork1_enqueue_#t~mem40#1_143|))))))) is different from false [2022-11-25 23:53:20,756 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1231 Int) (v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1233 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem40#1_143| Int) (v_ArrVal_1238 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1231)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1233) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~mem40#1_143| 1))) |c_~#stored_elements~0.base| v_ArrVal_1236) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (<= 0 (+ (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| 4) |c_~#queue~0.offset|) v_ArrVal_1238) .cse1) 2147483649)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem40#1_143| (select .cse2 .cse3))) (not (<= 0 (+ 2147483649 |v_t1Thread1of1ForFork1_enqueue_#t~mem40#1_143|))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| (select .cse0 .cse1))))))) is different from false [2022-11-25 23:53:21,002 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-25 23:53:21,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768664124] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:53:21,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1289331109] [2022-11-25 23:53:21,005 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:53:21,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:53:21,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 24 [2022-11-25 23:53:21,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835635730] [2022-11-25 23:53:21,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:53:21,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 23:53:21,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:53:21,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 23:53:21,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=380, Unknown=3, NotChecked=132, Total=650 [2022-11-25 23:53:21,009 INFO L87 Difference]: Start difference. First operand 934 states and 2293 transitions. Second operand has 26 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:53:28,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:53:28,232 INFO L93 Difference]: Finished difference Result 2280 states and 5413 transitions. [2022-11-25 23:53:28,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 23:53:28,233 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-25 23:53:28,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:53:28,240 INFO L225 Difference]: With dead ends: 2280 [2022-11-25 23:53:28,240 INFO L226 Difference]: Without dead ends: 2280 [2022-11-25 23:53:28,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=336, Invalid=933, Unknown=3, NotChecked=210, Total=1482 [2022-11-25 23:53:28,241 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 287 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 48 mSolverCounterUnsat, 90 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 90 IncrementalHoareTripleChecker+Unknown, 417 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:53:28,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 183 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1288 Invalid, 90 Unknown, 417 Unchecked, 2.6s Time] [2022-11-25 23:53:28,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2280 states. [2022-11-25 23:53:28,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2280 to 1364. [2022-11-25 23:53:28,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 1348 states have (on average 2.5689910979228485) internal successors, (3463), 1363 states have internal predecessors, (3463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:53:28,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 3463 transitions. [2022-11-25 23:53:28,284 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 3463 transitions. Word has length 19 [2022-11-25 23:53:28,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:53:28,285 INFO L495 AbstractCegarLoop]: Abstraction has 1364 states and 3463 transitions. [2022-11-25 23:53:28,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.24) internal successors, (56), 25 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:53:28,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 3463 transitions. [2022-11-25 23:53:28,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 23:53:28,287 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:53:28,287 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:53:28,299 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-25 23:53:28,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:53:28,493 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 23:53:28,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:53:28,493 INFO L85 PathProgramCache]: Analyzing trace with hash 31655794, now seen corresponding path program 1 times [2022-11-25 23:53:28,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:53:28,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532423982] [2022-11-25 23:53:28,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:53:28,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:53:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:53:29,677 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-25 23:53:29,677 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:53:29,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532423982] [2022-11-25 23:53:29,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532423982] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:53:29,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253000948] [2022-11-25 23:53:29,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:53:29,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:53:29,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:53:29,682 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:53:29,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 23:53:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:53:29,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-25 23:53:29,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:53:29,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:53:29,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:53:29,923 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:53:29,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 23:53:29,942 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 23:53:29,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 23:53:29,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 23:53:30,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 23:53:30,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-25 23:53:30,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-25 23:53:30,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:53:30,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-25 23:53:30,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 82 [2022-11-25 23:53:30,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 111 [2022-11-25 23:53:30,866 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-25 23:53:30,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:53:30,972 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1346 Int)) (<= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1345) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1346)) .cse1)) 2147483646)) is different from false [2022-11-25 23:53:30,984 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1346 Int)) (<= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1345) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1346)) .cse1)) 2147483646)) is different from false [2022-11-25 23:53:30,995 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1346 Int)) (<= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1345) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1346)) .cse1)) 2147483646)) is different from false [2022-11-25 23:53:31,010 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1346 Int)) (<= (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1345) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1346)) .cse2)) 2147483646))))) is different from false [2022-11-25 23:53:31,026 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1342 Int) (v_ArrVal_1346 Int)) (<= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1342) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1345) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1346)) .cse1)) 2147483646)) (= 400 .cse4)))) is different from false [2022-11-25 23:53:31,056 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1340 Int) (v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1342 Int) (v_ArrVal_1346 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1340)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (<= (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1342) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1345) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1346)) .cse1)) 2147483646) (= 400 .cse4))))) is different from false [2022-11-25 23:53:31,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-25 23:53:31,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253000948] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:53:31,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [704973516] [2022-11-25 23:53:31,293 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:53:31,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:53:31,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 31 [2022-11-25 23:53:31,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618633681] [2022-11-25 23:53:31,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:53:31,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-25 23:53:31,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:53:31,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-25 23:53:31,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=547, Unknown=9, NotChecked=330, Total=1056 [2022-11-25 23:53:31,296 INFO L87 Difference]: Start difference. First operand 1364 states and 3463 transitions. Second operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:53:37,150 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (and (<= .cse0 1) (or (= 400 .cse0) (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1346 Int)) (<= (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1345) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1346)) .cse2)) 2147483646)))))) is different from false [2022-11-25 23:53:37,349 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (and (<= .cse0 2147483646) (forall ((v_ArrVal_1345 (Array Int Int)) (v_ArrVal_1346 Int)) (<= (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1345) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1346)) .cse2)) 2147483646))))) is different from false [2022-11-25 23:53:38,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:53:38,557 INFO L93 Difference]: Finished difference Result 2488 states and 6067 transitions. [2022-11-25 23:53:38,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-25 23:53:38,558 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 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-25 23:53:38,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:53:38,566 INFO L225 Difference]: With dead ends: 2488 [2022-11-25 23:53:38,566 INFO L226 Difference]: Without dead ends: 2488 [2022-11-25 23:53:38,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 18 SyntacticMatches, 12 SemanticMatches, 53 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=495, Invalid=1681, Unknown=18, NotChecked=776, Total=2970 [2022-11-25 23:53:38,568 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 449 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 39 mSolverCounterUnsat, 25 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 2534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 25 IncrementalHoareTripleChecker+Unknown, 1276 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:53:38,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 179 Invalid, 2534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1194 Invalid, 25 Unknown, 1276 Unchecked, 2.1s Time] [2022-11-25 23:53:38,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2488 states. [2022-11-25 23:53:38,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2488 to 1583. [2022-11-25 23:53:38,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1567 states have (on average 2.5641352903637524) internal successors, (4018), 1582 states have internal predecessors, (4018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:53:38,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 4018 transitions. [2022-11-25 23:53:38,619 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 4018 transitions. Word has length 20 [2022-11-25 23:53:38,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:53:38,619 INFO L495 AbstractCegarLoop]: Abstraction has 1583 states and 4018 transitions. [2022-11-25 23:53:38,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 32 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:53:38,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 4018 transitions. [2022-11-25 23:53:38,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 23:53:38,622 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:53:38,622 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:53:38,630 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 23:53:38,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:53:38,830 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 23:53:38,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:53:38,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1999023912, now seen corresponding path program 1 times [2022-11-25 23:53:38,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:53:38,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104756587] [2022-11-25 23:53:38,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:53:38,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:53:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:53:39,600 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-25 23:53:39,600 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:53:39,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104756587] [2022-11-25 23:53:39,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104756587] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:53:39,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342809337] [2022-11-25 23:53:39,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:53:39,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:53:39,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:53:39,608 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:53:39,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 23:53:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:53:39,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-25 23:53:39,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:53:39,845 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 23:53:39,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 23:53:39,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:53:40,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 23:53:40,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:53:40,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 23:53:40,152 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-25 23:53:40,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-11-25 23:53:40,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-25 23:53:40,212 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-25 23:53:40,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:53:40,357 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_1437 (Array Int Int)) (v_ArrVal_1438 Int)) (or (<= 0 (+ 2147483649 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1437) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_1438) (+ |c_~#queue~0.offset| 1604)))) (< (+ v_ArrVal_1438 2147483648) 0))) is different from false [2022-11-25 23:53:42,459 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:53:42,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-11-25 23:53:42,474 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:53:42,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 111 [2022-11-25 23:53:42,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 110 [2022-11-25 23:53:42,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2022-11-25 23:53:42,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-25 23:53:42,570 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:53:42,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 81 [2022-11-25 23:53:42,844 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-25 23:53:42,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342809337] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:53:42,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [606520399] [2022-11-25 23:53:42,845 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:53:42,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:53:42,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2022-11-25 23:53:42,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877032419] [2022-11-25 23:53:42,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:53:42,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 23:53:42,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:53:42,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 23:53:42,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=387, Unknown=5, NotChecked=40, Total=506 [2022-11-25 23:53:42,847 INFO L87 Difference]: Start difference. First operand 1583 states and 4018 transitions. Second operand has 23 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 22 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:53:43,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:53:43,466 INFO L93 Difference]: Finished difference Result 1667 states and 4181 transitions. [2022-11-25 23:53:43,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:53:43,466 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 22 states have internal predecessors, (59), 0 states have call successors, (0), 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-25 23:53:43,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:53:43,472 INFO L225 Difference]: With dead ends: 1667 [2022-11-25 23:53:43,472 INFO L226 Difference]: Without dead ends: 1667 [2022-11-25 23:53:43,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=119, Invalid=480, Unknown=5, NotChecked=46, Total=650 [2022-11-25 23:53:43,474 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 478 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:53:43,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 28 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 303 Invalid, 0 Unknown, 60 Unchecked, 0.4s Time] [2022-11-25 23:53:43,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2022-11-25 23:53:43,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1257. [2022-11-25 23:53:43,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 1243 states have (on average 2.4674175382139985) internal successors, (3067), 1256 states have internal predecessors, (3067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:53:43,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 3067 transitions. [2022-11-25 23:53:43,514 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 3067 transitions. Word has length 20 [2022-11-25 23:53:43,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:53:43,514 INFO L495 AbstractCegarLoop]: Abstraction has 1257 states and 3067 transitions. [2022-11-25 23:53:43,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 22 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:53:43,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 3067 transitions. [2022-11-25 23:53:43,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 23:53:43,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:53:43,517 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:53:43,524 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-25 23:53:43,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:53:43,724 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 23:53:43,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:53:43,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1999023926, now seen corresponding path program 2 times [2022-11-25 23:53:43,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:53:43,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303640104] [2022-11-25 23:53:43,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:53:43,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:53:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:53:45,184 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-25 23:53:45,184 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:53:45,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303640104] [2022-11-25 23:53:45,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303640104] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:53:45,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512402090] [2022-11-25 23:53:45,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:53:45,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:53:45,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:53:45,187 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:53:45,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 23:53:45,399 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 23:53:45,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:53:45,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 94 conjunts are in the unsatisfiable core [2022-11-25 23:53:45,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:53:45,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:53:45,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:53:45,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-11-25 23:53:45,498 INFO L321 Elim1Store]: treesize reduction 40, result has 45.2 percent of original size [2022-11-25 23:53:45,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 35 treesize of output 55 [2022-11-25 23:53:45,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2022-11-25 23:53:45,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2022-11-25 23:53:46,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2022-11-25 23:53:46,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2022-11-25 23:53:46,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2022-11-25 23:53:46,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2022-11-25 23:53:46,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2022-11-25 23:53:46,497 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-25 23:53:46,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:53:46,699 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1545 (Array Int Int)) (v_ArrVal_1548 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1545) |c_~#stored_elements~0.base| v_ArrVal_1546) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1548)) .cse1)) 2147483647)) is different from false [2022-11-25 23:53:46,710 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1545 (Array Int Int)) (v_ArrVal_1548 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1545) |c_~#stored_elements~0.base| v_ArrVal_1546) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1548)) .cse1)) 2147483647)) is different from false [2022-11-25 23:53:46,721 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1545 (Array Int Int)) (v_ArrVal_1548 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1545) |c_~#stored_elements~0.base| v_ArrVal_1546) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1548)) .cse1)) 2147483647)) is different from false [2022-11-25 23:53:47,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-25 23:53:47,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512402090] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:53:47,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [999567982] [2022-11-25 23:53:47,328 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:53:47,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:53:47,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 32 [2022-11-25 23:53:47,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893692168] [2022-11-25 23:53:47,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:53:47,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-25 23:53:47,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:53:47,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-25 23:53:47,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=709, Unknown=21, NotChecked=180, Total=1122 [2022-11-25 23:53:47,330 INFO L87 Difference]: Start difference. First operand 1257 states and 3067 transitions. Second operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:53:51,291 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse6 (select .cse2 .cse3))) (let ((.cse4 (+ .cse6 1)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse5 (= 400 .cse6))) (and (or (forall ((v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1545 (Array Int Int)) (v_ArrVal_1542 Int) (v_ArrVal_1548 Int)) (< (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1542) .cse3 .cse4)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1545) |c_~#stored_elements~0.base| v_ArrVal_1546) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1548)) .cse1) 2147483647)) .cse5) (< .cse6 2147483647) (or (forall ((v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1545 (Array Int Int)) (v_ArrVal_1548 Int)) (< (select (let ((.cse7 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 .cse4)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1545) |c_~#stored_elements~0.base| v_ArrVal_1546) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1548)) .cse1) 2147483647)) .cse5))))) is different from false [2022-11-25 23:53:51,328 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (select .cse4 .cse5))) (let ((.cse0 (forall ((v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1545 (Array Int Int)) (v_ArrVal_1548 Int)) (< (let ((.cse3 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 (+ .cse1 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1545) |c_~#stored_elements~0.base| v_ArrVal_1546) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1548)) .cse3)) 2147483647)))) (and .cse0 (or .cse0 (= 400 .cse1)))))) is different from false [2022-11-25 23:53:58,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:53:58,894 INFO L93 Difference]: Finished difference Result 2364 states and 5619 transitions. [2022-11-25 23:53:58,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-25 23:53:58,894 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-25 23:53:58,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:53:58,898 INFO L225 Difference]: With dead ends: 2364 [2022-11-25 23:53:58,898 INFO L226 Difference]: Without dead ends: 2364 [2022-11-25 23:53:58,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 5 IntricatePredicates, 2 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=563, Invalid=1748, Unknown=61, NotChecked=490, Total=2862 [2022-11-25 23:53:58,900 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 835 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 66 mSolverCounterUnsat, 116 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 2469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 116 IncrementalHoareTripleChecker+Unknown, 795 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-25 23:53:58,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 182 Invalid, 2469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1492 Invalid, 116 Unknown, 795 Unchecked, 3.6s Time] [2022-11-25 23:53:58,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2364 states. [2022-11-25 23:53:58,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2364 to 1187. [2022-11-25 23:53:58,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 1173 states have (on average 2.444160272804774) internal successors, (2867), 1186 states have internal predecessors, (2867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:53:58,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 2867 transitions. [2022-11-25 23:53:58,943 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 2867 transitions. Word has length 20 [2022-11-25 23:53:58,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:53:58,943 INFO L495 AbstractCegarLoop]: Abstraction has 1187 states and 2867 transitions. [2022-11-25 23:53:58,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:53:58,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 2867 transitions. [2022-11-25 23:53:58,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 23:53:58,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:53:58,945 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:53:58,956 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-25 23:53:59,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-25 23:53:59,151 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 23:53:59,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:53:59,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1562495934, now seen corresponding path program 3 times [2022-11-25 23:53:59,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:53:59,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843960560] [2022-11-25 23:53:59,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:53:59,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:53:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:54:00,326 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-25 23:54:00,326 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:54:00,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843960560] [2022-11-25 23:54:00,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843960560] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:54:00,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780915671] [2022-11-25 23:54:00,327 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:54:00,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:54:00,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:54:00,328 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:54:00,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 23:54:00,515 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:54:00,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:54:00,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-25 23:54:00,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:54:00,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:54:00,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:54:00,551 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:54:00,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 23:54:00,572 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 23:54:00,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 23:54:00,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 23:54:00,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-25 23:54:01,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-25 23:54:01,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:54:01,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-25 23:54:01,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 82 [2022-11-25 23:54:01,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 111 [2022-11-25 23:54:01,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 111 [2022-11-25 23:54:01,502 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-25 23:54:01,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:54:01,538 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1657 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1657) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 2147483647)) is different from false [2022-11-25 23:54:01,901 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1655 Int)) (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1654))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1655)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1657) |c_~#queue~0.base|) .cse2)) 2147483647)) is different from false [2022-11-25 23:54:01,914 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse4 .cse5))) (or (= 400 .cse0) (forall ((v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1655 Int)) (< (let ((.cse3 (+ |c_~#queue~0.offset| 1604))) (select (select (store (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1654))) (store .cse1 |c_~#queue~0.base| (let ((.cse2 (select .cse1 |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_1655)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1657) |c_~#queue~0.base|) .cse3)) 2147483647))))) is different from false [2022-11-25 23:54:02,092 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1651 Int) (v_ArrVal_1655 Int) (v_ArrVal_1648 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1648)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse5 (select .cse3 .cse4))) (or (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1651) .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1654))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1655)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1657) |c_~#queue~0.base|) .cse2)) 2147483647) (= .cse5 400))))) is different from false [2022-11-25 23:54:02,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-25 23:54:02,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780915671] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:54:02,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [411631364] [2022-11-25 23:54:02,307 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:54:02,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:54:02,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 31 [2022-11-25 23:54:02,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366267717] [2022-11-25 23:54:02,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:54:02,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-25 23:54:02,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:54:02,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-25 23:54:02,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=632, Unknown=25, NotChecked=228, Total=1056 [2022-11-25 23:54:02,311 INFO L87 Difference]: Start difference. First operand 1187 states and 2867 transitions. Second operand has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:10,239 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1655 Int)) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1655))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1657) |c_~#queue~0.base|) .cse1) 2147483647)) (forall ((v_ArrVal_1657 (Array Int Int)) (v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1655 Int)) (< (select (select (store (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1654))) (store .cse2 |c_~#queue~0.base| (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1655)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1657) |c_~#queue~0.base|) .cse1) 2147483647)))) is different from false [2022-11-25 23:54:12,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:54:12,789 INFO L93 Difference]: Finished difference Result 2192 states and 5312 transitions. [2022-11-25 23:54:12,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-25 23:54:12,790 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-25 23:54:12,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:54:12,793 INFO L225 Difference]: With dead ends: 2192 [2022-11-25 23:54:12,793 INFO L226 Difference]: Without dead ends: 2192 [2022-11-25 23:54:12,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 18 SyntacticMatches, 8 SemanticMatches, 49 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=467, Invalid=1574, Unknown=49, NotChecked=460, Total=2550 [2022-11-25 23:54:12,794 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 641 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 72 mSolverCounterUnsat, 129 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 2321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 129 IncrementalHoareTripleChecker+Unknown, 705 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-25 23:54:12,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 164 Invalid, 2321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1415 Invalid, 129 Unknown, 705 Unchecked, 4.9s Time] [2022-11-25 23:54:12,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2022-11-25 23:54:12,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1186. [2022-11-25 23:54:12,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 1172 states have (on average 2.4445392491467577) internal successors, (2865), 1185 states have internal predecessors, (2865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:12,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 2865 transitions. [2022-11-25 23:54:12,825 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 2865 transitions. Word has length 20 [2022-11-25 23:54:12,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:54:12,825 INFO L495 AbstractCegarLoop]: Abstraction has 1186 states and 2865 transitions. [2022-11-25 23:54:12,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:12,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 2865 transitions. [2022-11-25 23:54:12,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 23:54:12,827 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:54:12,827 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-25 23:54:12,841 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-25 23:54:13,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-25 23:54:13,033 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 23:54:13,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:54:13,034 INFO L85 PathProgramCache]: Analyzing trace with hash -148593879, now seen corresponding path program 1 times [2022-11-25 23:54:13,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:54:13,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265277288] [2022-11-25 23:54:13,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:54:13,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:54:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:54:13,122 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:54:13,122 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:54:13,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265277288] [2022-11-25 23:54:13,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265277288] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:54:13,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598822449] [2022-11-25 23:54:13,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:54:13,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:54:13,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:54:13,131 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:54:13,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 23:54:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:54:13,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 23:54:13,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:54:13,406 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:54:13,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 23:54:13,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598822449] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:54:13,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 23:54:13,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-25 23:54:13,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448165532] [2022-11-25 23:54:13,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:54:13,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:54:13,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:54:13,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:54:13,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 23:54:13,410 INFO L87 Difference]: Start difference. First operand 1186 states and 2865 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:13,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:54:13,635 INFO L93 Difference]: Finished difference Result 1174 states and 2805 transitions. [2022-11-25 23:54:13,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:54:13,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-25 23:54:13,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:54:13,638 INFO L225 Difference]: With dead ends: 1174 [2022-11-25 23:54:13,638 INFO L226 Difference]: Without dead ends: 1174 [2022-11-25 23:54:13,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:54:13,639 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 98 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:54:13,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 18 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:54:13,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2022-11-25 23:54:13,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1174. [2022-11-25 23:54:13,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 1162 states have (on average 2.4139414802065406) internal successors, (2805), 1173 states have internal predecessors, (2805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:13,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 2805 transitions. [2022-11-25 23:54:13,667 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 2805 transitions. Word has length 22 [2022-11-25 23:54:13,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:54:13,668 INFO L495 AbstractCegarLoop]: Abstraction has 1174 states and 2805 transitions. [2022-11-25 23:54:13,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:13,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 2805 transitions. [2022-11-25 23:54:13,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 23:54:13,671 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:54:13,671 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-25 23:54:13,682 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-25 23:54:13,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:54:13,877 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 23:54:13,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:54:13,877 INFO L85 PathProgramCache]: Analyzing trace with hash -148593699, now seen corresponding path program 1 times [2022-11-25 23:54:13,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:54:13,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605031440] [2022-11-25 23:54:13,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:54:13,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:54:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:54:13,925 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:54:13,926 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:54:13,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605031440] [2022-11-25 23:54:13,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605031440] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:54:13,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:54:13,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:54:13,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644050016] [2022-11-25 23:54:13,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:54:13,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:54:13,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:54:13,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:54:13,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:54:13,928 INFO L87 Difference]: Start difference. First operand 1174 states and 2805 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) 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-25 23:54:14,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:54:14,070 INFO L93 Difference]: Finished difference Result 1162 states and 2745 transitions. [2022-11-25 23:54:14,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:54:14,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) 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-25 23:54:14,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:54:14,073 INFO L225 Difference]: With dead ends: 1162 [2022-11-25 23:54:14,073 INFO L226 Difference]: Without dead ends: 1162 [2022-11-25 23:54:14,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:54:14,074 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 20 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:54:14,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 15 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:54:14,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2022-11-25 23:54:14,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1162. [2022-11-25 23:54:14,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 1152 states have (on average 2.3828125) internal successors, (2745), 1161 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:14,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 2745 transitions. [2022-11-25 23:54:14,097 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 2745 transitions. Word has length 22 [2022-11-25 23:54:14,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:54:14,098 INFO L495 AbstractCegarLoop]: Abstraction has 1162 states and 2745 transitions. [2022-11-25 23:54:14,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) 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-25 23:54:14,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 2745 transitions. [2022-11-25 23:54:14,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 23:54:14,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:54:14,100 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:54:14,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-25 23:54:14,101 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 23:54:14,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:54:14,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1098079562, now seen corresponding path program 1 times [2022-11-25 23:54:14,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:54:14,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861302346] [2022-11-25 23:54:14,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:54:14,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:54:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:54:14,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:54:14,172 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:54:14,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861302346] [2022-11-25 23:54:14,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861302346] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:54:14,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541120561] [2022-11-25 23:54:14,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:54:14,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:54:14,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:54:14,178 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:54:14,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-25 23:54:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:54:14,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 23:54:14,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:54:14,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:54:14,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:54:14,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:54:14,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541120561] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:54:14,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1715635422] [2022-11-25 23:54:14,500 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:54:14,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:54:14,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-25 23:54:14,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651985485] [2022-11-25 23:54:14,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:54:14,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 23:54:14,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:54:14,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 23:54:14,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-25 23:54:14,502 INFO L87 Difference]: Start difference. First operand 1162 states and 2745 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:14,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:54:14,751 INFO L93 Difference]: Finished difference Result 1239 states and 2894 transitions. [2022-11-25 23:54:14,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:54:14,752 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 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-25 23:54:14,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:54:14,754 INFO L225 Difference]: With dead ends: 1239 [2022-11-25 23:54:14,754 INFO L226 Difference]: Without dead ends: 1239 [2022-11-25 23:54:14,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-25 23:54:14,755 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 96 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:54:14,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 20 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:54:14,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2022-11-25 23:54:14,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1197. [2022-11-25 23:54:14,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1197 states, 1187 states have (on average 2.3614153327716934) internal successors, (2803), 1196 states have internal predecessors, (2803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:14,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 2803 transitions. [2022-11-25 23:54:14,778 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 2803 transitions. Word has length 24 [2022-11-25 23:54:14,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:54:14,778 INFO L495 AbstractCegarLoop]: Abstraction has 1197 states and 2803 transitions. [2022-11-25 23:54:14,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:14,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 2803 transitions. [2022-11-25 23:54:14,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 23:54:14,781 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:54:14,781 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-25 23:54:14,793 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-25 23:54:14,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-25 23:54:14,988 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 23:54:14,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:54:14,988 INFO L85 PathProgramCache]: Analyzing trace with hash -801126441, now seen corresponding path program 6 times [2022-11-25 23:54:14,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:54:14,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010093614] [2022-11-25 23:54:14,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:54:14,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:54:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:54:16,964 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:54:16,964 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:54:16,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010093614] [2022-11-25 23:54:16,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010093614] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:54:16,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815906879] [2022-11-25 23:54:16,965 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:54:16,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:54:16,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:54:16,966 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:54:16,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-25 23:54:17,183 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:54:17,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:54:17,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 101 conjunts are in the unsatisfiable core [2022-11-25 23:54:17,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:54:17,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:54:17,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:54:17,222 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:54:17,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 23:54:17,245 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 23:54:17,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 23:54:17,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 23:54:17,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 44 [2022-11-25 23:54:17,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-25 23:54:17,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-25 23:54:18,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:54:18,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-25 23:54:18,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 85 [2022-11-25 23:54:18,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 92 [2022-11-25 23:54:19,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 97 [2022-11-25 23:54:19,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:54:19,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 93 [2022-11-25 23:54:20,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 102 [2022-11-25 23:54:22,990 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:54:22,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:54:23,186 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (v_ArrVal_1990 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1989) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_1990) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-25 23:54:23,206 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (v_ArrVal_1990 Int) (v_ArrVal_1988 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_1988)) |c_~#stored_elements~0.base| v_ArrVal_1989) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_1990) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_1988 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))))) is different from false [2022-11-25 23:54:23,226 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (v_ArrVal_1990 Int) (v_ArrVal_1988 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1988)) |c_~#stored_elements~0.base| v_ArrVal_1989) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1988) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_1990) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-25 23:54:23,253 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse2 .cse3))) (or (= 400 .cse0) (forall ((v_ArrVal_1989 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (v_ArrVal_1990 Int) (v_ArrVal_1988 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1988)) |c_~#stored_elements~0.base| v_ArrVal_1989) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse1 (+ |c_~#queue~0.offset| 1604)))) (< (+ .cse0 1) v_ArrVal_1988) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_1990) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2022-11-25 23:54:23,293 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (select .cse2 .cse3))) (or (forall ((v_ArrVal_1989 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (v_ArrVal_1990 Int) (v_ArrVal_1986 Int) (v_ArrVal_1988 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1986) .cse3 v_ArrVal_1988)) |c_~#stored_elements~0.base| v_ArrVal_1989) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1986 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ .cse1 1) v_ArrVal_1988) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_1990) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) (= 400 .cse1)))) is different from false [2022-11-25 23:54:23,540 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (v_ArrVal_1990 Int) (v_ArrVal_1984 Int) (v_ArrVal_1986 Int) (v_ArrVal_1988 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1984)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_1986) .cse4 v_ArrVal_1988)) |c_~#stored_elements~0.base| v_ArrVal_1989) |c_~#queue~0.base|)) (.cse1 (select .cse2 .cse4))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_1990) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (= 400 .cse1) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1986) (< (+ .cse1 1) v_ArrVal_1988))))) is different from false [2022-11-25 23:54:27,833 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| Int) (v_ArrVal_1990 Int) (v_ArrVal_1982 (Array Int Int)) (v_ArrVal_1984 Int) (v_ArrVal_1986 Int) (v_ArrVal_1988 Int)) (let ((.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1982))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| 4) |c_~#queue~0.offset|) v_ArrVal_1984)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select .cse3 .cse1)) (.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1986) .cse1 v_ArrVal_1988)) |c_~#stored_elements~0.base| v_ArrVal_1989) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse0 .cse1))) (< (+ .cse2 1) v_ArrVal_1988) (= 400 .cse2) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1986) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| (select .cse5 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_1990) .cse4) 2147483647))))))) is different from false [2022-11-25 23:54:27,879 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| Int) (v_ArrVal_1990 Int) (v_ArrVal_1982 (Array Int Int)) (v_ArrVal_1984 Int) (v_ArrVal_1986 Int) (v_ArrVal_1988 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1982))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| 4) |c_~#queue~0.offset|) v_ArrVal_1984)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse1 .cse5)) (.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_1986) .cse5 v_ArrVal_1988)) |c_~#stored_elements~0.base| v_ArrVal_1989) |c_~#queue~0.base|))) (or (= .cse0 400) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1986) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_1990) .cse2) 2147483647) (< (+ .cse0 1) v_ArrVal_1988) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| (select .cse4 .cse5))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse3 .cse5))))))))) is different from false [2022-11-25 23:54:27,921 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| Int) (v_ArrVal_1990 Int) (v_ArrVal_1982 (Array Int Int)) (v_ArrVal_1984 Int) (v_ArrVal_1986 Int) (v_ArrVal_1988 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse7 .cse8 (+ (select .cse7 .cse8) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1982))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| 4) |c_~#queue~0.offset|) v_ArrVal_1984)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_1986) .cse2 v_ArrVal_1988)) |c_~#stored_elements~0.base| v_ArrVal_1989) |c_~#queue~0.base|)) (.cse0 (select .cse4 .cse2))) (or (< (+ .cse0 1) v_ArrVal_1988) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse1 .cse2))) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_1990) .cse3) 2147483647) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1986) (= 400 .cse0) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| (select .cse5 .cse2))))))))) is different from false [2022-11-25 23:54:29,240 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse8 .cse9))) (or (= 400 .cse0) (forall ((v_ArrVal_1989 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| Int) (v_ArrVal_1990 Int) (v_ArrVal_1982 (Array Int Int)) (v_ArrVal_1984 Int) (v_ArrVal_1986 Int) (v_ArrVal_1978 Int) (v_ArrVal_1988 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse8 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1978) .cse9 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1982))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| 4) |c_~#queue~0.offset|) v_ArrVal_1984)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (select .cse2 .cse5)) (.cse4 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1986) .cse5 v_ArrVal_1988)) |c_~#stored_elements~0.base| v_ArrVal_1989) |c_~#queue~0.base|))) (or (< (+ .cse1 1) v_ArrVal_1988) (= .cse1 400) (not (<= v_ArrVal_1978 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1986) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse4 .cse5))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| (select .cse6 .cse5))) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_1990) .cse3) 2147483647)))))))))) is different from false [2022-11-25 23:54:29,311 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int)) (v_ArrVal_1977 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| Int) (v_ArrVal_1990 Int) (v_ArrVal_1982 (Array Int Int)) (v_ArrVal_1984 Int) (v_ArrVal_1986 Int) (v_ArrVal_1978 Int) (v_ArrVal_1988 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1977))) (let ((.cse9 (select .cse8 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse9 .cse10))) (let ((.cse7 (store (store .cse8 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse9 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1978) .cse10 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1982))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| 4) |c_~#queue~0.offset|) v_ArrVal_1984)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_1986) .cse5 v_ArrVal_1988)) |c_~#stored_elements~0.base| v_ArrVal_1989) |c_~#queue~0.base|)) (.cse4 (select .cse3 .cse5))) (or (= 400 .cse0) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_1990) .cse2) 2147483647) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1986) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse1 .cse5))) (not (<= v_ArrVal_1978 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| (select .cse6 .cse5))) (< (+ .cse4 1) v_ArrVal_1988)))))))))) is different from false [2022-11-25 23:54:29,388 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int)) (v_ArrVal_1977 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| Int) (v_ArrVal_1990 Int) (v_ArrVal_1982 (Array Int Int)) (v_ArrVal_1984 Int) (v_ArrVal_1986 Int) (v_ArrVal_1978 Int) (v_ArrVal_1988 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1977))) (let ((.cse10 (select .cse9 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse11 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select .cse10 .cse11))) (let ((.cse8 (store (store .cse9 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse10 .cse1 v_ArrVal_1978) .cse11 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1982))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| 4) |c_~#queue~0.offset|) v_ArrVal_1984)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_1986) .cse6 v_ArrVal_1988)) |c_~#stored_elements~0.base| v_ArrVal_1989) |c_~#queue~0.base|)) (.cse5 (select .cse4 .cse6))) (or (= 400 .cse0) (< (+ (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1) 1) v_ArrVal_1978) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_1990) .cse3) 2147483647) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1986) (= 400 .cse5) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse2 .cse6))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| (select .cse7 .cse6))) (< (+ .cse5 1) v_ArrVal_1988)))))))))) is different from false [2022-11-25 23:54:29,491 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int)) (v_ArrVal_1977 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| Int) (v_ArrVal_1990 Int) (v_ArrVal_1982 (Array Int Int)) (v_ArrVal_1984 Int) (v_ArrVal_1976 Int) (v_ArrVal_1986 Int) (v_ArrVal_1978 Int) (v_ArrVal_1988 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1976))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| .cse3) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1977))) (let ((.cse11 (select .cse10 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse12 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse7 (select .cse11 .cse12))) (let ((.cse9 (store (store .cse10 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse11 .cse4 v_ArrVal_1978) .cse12 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1982))) (let ((.cse1 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| 4) |c_~#queue~0.offset|) v_ArrVal_1984)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse6 v_ArrVal_1986) .cse2 v_ArrVal_1988)) |c_~#stored_elements~0.base| v_ArrVal_1989) |c_~#queue~0.base|)) (.cse0 (select .cse8 .cse2))) (or (< (+ .cse0 1) v_ArrVal_1988) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| (select .cse1 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1978) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_1990) .cse6) 2147483647) (= 400 .cse7) (< (+ (select .cse8 .cse6) 1) v_ArrVal_1986) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse5 .cse2))) (= 400 .cse0))))))))))) is different from false [2022-11-25 23:54:29,597 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int)) (v_ArrVal_1977 (Array Int Int)) (v_ArrVal_1982 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| Int) (v_ArrVal_1990 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_202| Int) (v_ArrVal_1984 Int) (v_ArrVal_1976 Int) (v_ArrVal_1986 Int) (v_ArrVal_1978 Int) (v_ArrVal_1988 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_202| 4) |c_~#queue~0.offset|) v_ArrVal_1976))) (let ((.cse10 (store (store |c_#memory_int| |c_~#queue~0.base| .cse2) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1977))) (let ((.cse11 (select .cse10 |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (select .cse11 .cse5))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse3 v_ArrVal_1978) .cse5 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1982))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| 4) |c_~#queue~0.offset|) v_ArrVal_1984))) (let ((.cse6 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse3 v_ArrVal_1986) .cse5 v_ArrVal_1988)) |c_~#stored_elements~0.base| v_ArrVal_1989) |c_~#queue~0.base|)) (.cse0 (select .cse8 .cse5))) (or (= 400 .cse0) (= 400 .cse1) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1978) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_202| (select .cse4 .cse5))) (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_1990) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse6 .cse5))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| (select .cse7 .cse5))) (< (+ (select .cse8 .cse3) 1) v_ArrVal_1986) (< (+ .cse0 1) v_ArrVal_1988)))))))))))) is different from false [2022-11-25 23:54:29,825 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-11-25 23:54:29,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815906879] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:54:29,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [74536662] [2022-11-25 23:54:29,826 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:54:29,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:54:29,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 20] total 55 [2022-11-25 23:54:29,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90630354] [2022-11-25 23:54:29,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:54:29,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-25 23:54:29,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:54:29,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-25 23:54:29,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1384, Unknown=21, NotChecked=1330, Total=3192 [2022-11-25 23:54:29,828 INFO L87 Difference]: Start difference. First operand 1197 states and 2803 transitions. Second operand has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:32,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:54:39,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:54:43,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:55:06,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:55:07,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:07,949 INFO L93 Difference]: Finished difference Result 1943 states and 4542 transitions. [2022-11-25 23:55:07,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-25 23:55:07,950 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-25 23:55:07,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:07,954 INFO L225 Difference]: With dead ends: 1943 [2022-11-25 23:55:07,954 INFO L226 Difference]: Without dead ends: 1943 [2022-11-25 23:55:07,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 13 SyntacticMatches, 11 SemanticMatches, 73 ConstructedPredicates, 14 IntricatePredicates, 7 DeprecatedPredicates, 1488 ImplicationChecksByTransitivity, 35.8s TimeCoverageRelationStatistics Valid=896, Invalid=2795, Unknown=25, NotChecked=1834, Total=5550 [2022-11-25 23:55:07,956 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 489 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 37 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 4572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 3062 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:07,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 218 Invalid, 4572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1450 Invalid, 23 Unknown, 3062 Unchecked, 13.3s Time] [2022-11-25 23:55:07,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states. [2022-11-25 23:55:07,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1463. [2022-11-25 23:55:07,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1463 states, 1453 states have (on average 2.388162422573985) internal successors, (3470), 1462 states have internal predecessors, (3470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:07,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1463 states and 3470 transitions. [2022-11-25 23:55:07,994 INFO L78 Accepts]: Start accepts. Automaton has 1463 states and 3470 transitions. Word has length 26 [2022-11-25 23:55:07,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:07,994 INFO L495 AbstractCegarLoop]: Abstraction has 1463 states and 3470 transitions. [2022-11-25 23:55:07,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:07,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 3470 transitions. [2022-11-25 23:55:07,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 23:55:07,997 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:55:07,997 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-25 23:55:08,011 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-25 23:55:08,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-25 23:55:08,205 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 23:55:08,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:55:08,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1149832023, now seen corresponding path program 7 times [2022-11-25 23:55:08,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:55:08,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91318895] [2022-11-25 23:55:08,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:55:08,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:11,252 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:55:11,252 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:11,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91318895] [2022-11-25 23:55:11,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91318895] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:55:11,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504559109] [2022-11-25 23:55:11,253 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 23:55:11,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:55:11,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:55:11,254 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:55:11,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-25 23:55:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:11,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 96 conjunts are in the unsatisfiable core [2022-11-25 23:55:11,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:55:11,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:55:11,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:55:11,545 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:55:11,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 23:55:11,575 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 23:55:11,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 23:55:11,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 23:55:11,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-25 23:55:12,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-25 23:55:12,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-25 23:55:12,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:55:12,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-25 23:55:12,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-25 23:55:13,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2022-11-25 23:55:13,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 68 [2022-11-25 23:55:14,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:55:14,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 64 [2022-11-25 23:55:16,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 73 [2022-11-25 23:55:28,687 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:55:28,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:55:28,890 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2115 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| Int) (v_ArrVal_2116 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| 4) |c_~#queue~0.offset|) v_ArrVal_2116) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-25 23:55:28,911 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| Int) (v_ArrVal_2116 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_2114)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_2114 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| 4) |c_~#queue~0.offset|) v_ArrVal_2116) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-25 23:55:38,719 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2111 Int) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2114 Int) (v_ArrVal_2106 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| Int) (v_ArrVal_2116 Int) (v_ArrVal_2109 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| 4) |c_~#queue~0.offset|) v_ArrVal_2109)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2111) .cse1 v_ArrVal_2114)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| (select .cse2 .cse1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2111) (not (<= v_ArrVal_2106 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2114) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| 4) |c_~#queue~0.offset|) v_ArrVal_2116) .cse4) 2147483647))))))) is different from false [2022-11-25 23:55:38,765 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2111 Int) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2114 Int) (v_ArrVal_2106 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| Int) (v_ArrVal_2116 Int) (v_ArrVal_2109 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| 4) |c_~#queue~0.offset|) v_ArrVal_2109)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2111) .cse1 v_ArrVal_2114)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| (select .cse2 .cse1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2111) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2114) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| 4) |c_~#queue~0.offset|) v_ArrVal_2116) .cse4) 2147483647) (< (+ (select .cse5 .cse6) 1) v_ArrVal_2106)))))))) is different from false [2022-11-25 23:55:38,817 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2111 Int) (v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2114 Int) (v_ArrVal_2106 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| Int) (v_ArrVal_2116 Int) (v_ArrVal_2109 Int)) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2105))) (let ((.cse4 (select .cse8 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse7 (store (store .cse8 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| 4) |c_~#queue~0.offset|) v_ArrVal_2109)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_2111) .cse3 v_ArrVal_2114)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2111) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| (select .cse2 .cse3))) (< (+ (select .cse4 .cse5) 1) v_ArrVal_2106) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| (select .cse6 .cse3))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_2114) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| 4) |c_~#queue~0.offset|) v_ArrVal_2116) .cse1) 2147483647))))))))) is different from false [2022-11-25 23:55:38,961 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2111 Int) (v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2103 Int) (v_ArrVal_2114 Int) (v_ArrVal_2106 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| Int) (v_ArrVal_2116 Int) (v_ArrVal_2109 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2103)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2105))) (let ((.cse2 (select .cse8 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse7 (store (store .cse8 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| 4) |c_~#queue~0.offset|) v_ArrVal_2109)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_2111) .cse5 v_ArrVal_2114)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| 4) |c_~#queue~0.offset|) v_ArrVal_2116) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2106) (not (<= v_ArrVal_2103 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse4 .cse5) 1) v_ArrVal_2114) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| (select .cse0 .cse5))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2111) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| (select .cse6 .cse5))))))))))) is different from false [2022-11-25 23:55:39,045 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2111 Int) (v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2103 Int) (v_ArrVal_2114 Int) (v_ArrVal_2106 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| Int) (v_ArrVal_2116 Int) (v_ArrVal_2109 Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_2103)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2105))) (let ((.cse2 (select .cse10 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse9 (store (store .cse10 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| 4) |c_~#queue~0.offset|) v_ArrVal_2109)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_2111) .cse5 v_ArrVal_2114)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| 4) |c_~#queue~0.offset|) v_ArrVal_2116) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2106) (< (+ (select .cse4 .cse5) 1) v_ArrVal_2114) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| (select .cse0 .cse5))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2111) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| (select .cse6 .cse5))) (< (+ (select .cse7 .cse8) 1) v_ArrVal_2103)))))))))) is different from false [2022-11-25 23:55:39,162 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2111 Int) (v_ArrVal_2101 Int) (v_ArrVal_2103 Int) (v_ArrVal_2114 Int) (v_ArrVal_2106 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| Int) (v_ArrVal_2116 Int) (v_ArrVal_2109 Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2101)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_2103)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2105))) (let ((.cse7 (select .cse10 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse9 (store (store .cse10 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| 4) |c_~#queue~0.offset|) v_ArrVal_2109)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse2 v_ArrVal_2111) .cse1 v_ArrVal_2114)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| 4) |c_~#queue~0.offset|) v_ArrVal_2116) .cse2) 2147483647) (< (+ 1 (select .cse3 .cse4)) v_ArrVal_2103) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| (select .cse5 .cse1))) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2114) (< (+ (select .cse7 .cse8) 1) v_ArrVal_2106) (< (+ (select .cse6 .cse2) 1) v_ArrVal_2111)))))))))) is different from false [2022-11-25 23:55:39,243 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2108 (Array Int Int)) (v_ArrVal_2105 (Array Int Int)) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2111 Int) (v_ArrVal_2101 Int) (v_ArrVal_2103 Int) (v_ArrVal_2114 Int) (v_ArrVal_2106 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| Int) (v_ArrVal_2116 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_209| Int) (v_ArrVal_2109 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_209| 4) |c_~#queue~0.offset|) v_ArrVal_2101)) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_2103)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2105))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store .cse7 .cse1 v_ArrVal_2106)) |c_~#stored_elements~0.base| v_ArrVal_2108))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| 4) |c_~#queue~0.offset|) v_ArrVal_2109))) (let ((.cse5 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_2111) .cse1 v_ArrVal_2114)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_209| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2103) (< (+ (select .cse4 .cse3) 1) v_ArrVal_2111) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| 4) |c_~#queue~0.offset|) v_ArrVal_2116) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| (select .cse5 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_208| (select .cse6 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2114) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2106))))))))))) is different from false [2022-11-25 23:55:39,459 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-11-25 23:55:39,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504559109] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:55:39,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [810673894] [2022-11-25 23:55:39,461 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:55:39,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:55:39,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 52 [2022-11-25 23:55:39,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079268543] [2022-11-25 23:55:39,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:55:39,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-25 23:55:39,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:55:39,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-25 23:55:39,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=490, Invalid=1475, Unknown=51, NotChecked=846, Total=2862 [2022-11-25 23:55:39,466 INFO L87 Difference]: Start difference. First operand 1463 states and 3470 transitions. Second operand has 54 states, 53 states have (on average 1.471698113207547) internal successors, (78), 53 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:57,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:56:01,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:56:03,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:56:09,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:56:25,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:56:27,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:56:29,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:56:31,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:56:33,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:56:40,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:56:42,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:56:44,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:56:46,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:56:48,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:56:51,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:56:53,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:57:04,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:57:08,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:57:11,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:57:12,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:57:19,894 WARN L233 SmtUtils]: Spent 5.02s on a formula simplification. DAG size of input: 132 DAG size of output: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:57:21,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-25 23:57:21,985 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse0 (+ (select .cse4 .cse5) 1))) (and (forall ((v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| Int) (v_ArrVal_2116 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_2114)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (or (< .cse0 v_ArrVal_2114) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| (select .cse1 .cse2))) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| 4) |c_~#queue~0.offset|) v_ArrVal_2116) .cse3) 2147483647)))) (forall ((v_ArrVal_2111 Int) (v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| Int) (v_ArrVal_2116 Int)) (let ((.cse6 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2111) .cse5 v_ArrVal_2114)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_2111 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| 4) |c_~#queue~0.offset|) v_ArrVal_2116) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| (select .cse6 .cse2))) (< .cse0 v_ArrVal_2114))))))) is different from false [2022-11-25 23:57:24,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:57:27,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:57:27,667 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (and (forall ((v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| Int) (v_ArrVal_2116 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_2114)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_2114 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| 4) |c_~#queue~0.offset|) v_ArrVal_2116) .cse2) 2147483647)))) (forall ((v_ArrVal_2115 (Array Int Int)) (v_ArrVal_2114 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| Int) (v_ArrVal_2116 Int)) (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_2114)) |c_~#stored_elements~0.base| v_ArrVal_2115) |c_~#queue~0.base|))) (or (< (+ (select .cse3 .cse4) 1) v_ArrVal_2114) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| (select .cse5 .cse1))) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_207| 4) |c_~#queue~0.offset|) v_ArrVal_2116) .cse2) 2147483647)))))) is different from false [2022-11-25 23:57:30,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:57:30,410 INFO L93 Difference]: Finished difference Result 2000 states and 4716 transitions. [2022-11-25 23:57:30,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-25 23:57:30,411 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.471698113207547) internal successors, (78), 53 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-25 23:57:30,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:57:30,414 INFO L225 Difference]: With dead ends: 2000 [2022-11-25 23:57:30,414 INFO L226 Difference]: Without dead ends: 2000 [2022-11-25 23:57:30,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 18 SyntacticMatches, 11 SemanticMatches, 74 ConstructedPredicates, 11 IntricatePredicates, 1 DeprecatedPredicates, 1602 ImplicationChecksByTransitivity, 82.7s TimeCoverageRelationStatistics Valid=1035, Invalid=3107, Unknown=62, NotChecked=1496, Total=5700 [2022-11-25 23:57:30,418 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 663 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 53 mSolverCounterUnsat, 61 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 2721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 61 IncrementalHoareTripleChecker+Unknown, 1372 IncrementalHoareTripleChecker+Unchecked, 54.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:57:30,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 186 Invalid, 2721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1235 Invalid, 61 Unknown, 1372 Unchecked, 54.3s Time] [2022-11-25 23:57:30,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2022-11-25 23:57:30,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1311. [2022-11-25 23:57:30,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1311 states, 1301 states have (on average 2.3996925441967716) internal successors, (3122), 1310 states have internal predecessors, (3122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:57:30,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1311 states to 1311 states and 3122 transitions. [2022-11-25 23:57:30,448 INFO L78 Accepts]: Start accepts. Automaton has 1311 states and 3122 transitions. Word has length 26 [2022-11-25 23:57:30,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:57:30,448 INFO L495 AbstractCegarLoop]: Abstraction has 1311 states and 3122 transitions. [2022-11-25 23:57:30,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.471698113207547) internal successors, (78), 53 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:57:30,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1311 states and 3122 transitions. [2022-11-25 23:57:30,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 23:57:30,450 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:57:30,450 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-25 23:57:30,458 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-25 23:57:30,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-25 23:57:30,658 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-25 23:57:30,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:57:30,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1399296771, now seen corresponding path program 8 times [2022-11-25 23:57:30,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:57:30,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378405773] [2022-11-25 23:57:30,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:57:30,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:57:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:57:33,474 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:57:33,475 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:57:33,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378405773] [2022-11-25 23:57:33,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378405773] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:57:33,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057272816] [2022-11-25 23:57:33,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:57:33,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:57:33,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:57:33,476 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:57:33,479 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c03d8921-e523-4861-91ff-3b9d9dc8a048/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-25 23:57:33,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 23:57:33,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:57:33,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 96 conjunts are in the unsatisfiable core [2022-11-25 23:57:33,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:57:33,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:33,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:33,913 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:57:33,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-25 23:57:33,939 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 23:57:33,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 23:57:34,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-25 23:57:34,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-25 23:57:34,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-25 23:57:34,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-25 23:57:34,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:34,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-25 23:57:35,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-25 23:57:35,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2022-11-25 23:57:36,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 68 [2022-11-25 23:57:36,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:57:36,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 64 [2022-11-25 23:57:37,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 73 [2022-11-25 23:57:44,981 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:57:44,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:57:45,210 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2242 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_214| Int) (v_ArrVal_2241 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_214| 4) |c_~#queue~0.offset|) v_ArrVal_2242) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_214| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-25 23:57:45,231 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2240 Int) (v_ArrVal_2242 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_214| Int) (v_ArrVal_2241 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_2240)) |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_214| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_214| 4) |c_~#queue~0.offset|) v_ArrVal_2242) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_2240 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))))) is different from false [2022-11-25 23:57:47,131 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2240 Int) (v_ArrVal_2242 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_214| Int) (v_ArrVal_2238 Int) (v_ArrVal_2241 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_2238) .cse3 v_ArrVal_2240)) |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_214| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2238) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_214| 4) |c_~#queue~0.offset|) v_ArrVal_2242) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse3) 1) v_ArrVal_2240))))) is different from false [2022-11-25 23:57:47,168 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2240 Int) (v_ArrVal_2242 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_214| Int) (v_ArrVal_2236 Int) (v_ArrVal_2238 Int) (v_ArrVal_2241 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2236)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse3 v_ArrVal_2238) .cse2 v_ArrVal_2240)) |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_214| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2240) (< (+ (select .cse1 .cse3) 1) v_ArrVal_2238) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_214| 4) |c_~#queue~0.offset|) v_ArrVal_2242) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-25 23:57:54,230 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2240 Int) (v_ArrVal_2242 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_214| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2234 (Array Int Int)) (v_ArrVal_2236 Int) (v_ArrVal_2233 (Array Int Int)) (v_ArrVal_2238 Int) (v_ArrVal_2241 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2233) |c_~#stored_elements~0.base| v_ArrVal_2234))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2236)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_2238) .cse4 v_ArrVal_2240)) |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2238) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_214| 4) |c_~#queue~0.offset|) v_ArrVal_2242) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_215| (select .cse3 .cse4))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_214| (select .cse2 .cse4))) (< (+ (select .cse0 .cse4) 1) v_ArrVal_2240))))))) is different from false [2022-11-25 23:57:54,293 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2240 Int) (v_ArrVal_2231 Int) (v_ArrVal_2242 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_214| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2234 (Array Int Int)) (v_ArrVal_2236 Int) (v_ArrVal_2233 (Array Int Int)) (v_ArrVal_2238 Int) (v_ArrVal_2241 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_2231)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2233) |c_~#stored_elements~0.base| v_ArrVal_2234))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2236)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2238) .cse1 v_ArrVal_2240)) |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_214| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_215| (select .cse2 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2240) (not (<= v_ArrVal_2231 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2238) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_214| 4) |c_~#queue~0.offset|) v_ArrVal_2242) .cse4) 2147483647))))))) is different from false [2022-11-25 23:57:54,347 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2240 Int) (v_ArrVal_2231 Int) (v_ArrVal_2242 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_214| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2234 (Array Int Int)) (v_ArrVal_2236 Int) (v_ArrVal_2233 (Array Int Int)) (v_ArrVal_2238 Int) (v_ArrVal_2241 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse7 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_2231)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2233) |c_~#stored_elements~0.base| v_ArrVal_2234))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2236)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse6 v_ArrVal_2238) .cse1 v_ArrVal_2240)) |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_214| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_215| (select .cse2 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2240) (< (+ (select .cse4 .cse5) 1) v_ArrVal_2231) (< (+ (select .cse3 .cse6) 1) v_ArrVal_2238) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_214| 4) |c_~#queue~0.offset|) v_ArrVal_2242) .cse6) 2147483647)))))))) is different from false [2022-11-25 23:57:55,094 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2234 (Array Int Int)) (v_ArrVal_2233 (Array Int Int)) (v_ArrVal_2241 (Array Int Int)) (v_ArrVal_2240 Int) (v_ArrVal_2231 Int) (v_ArrVal_2242 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_214| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2236 Int) (v_ArrVal_2238 Int) (v_ArrVal_2229 Int) (v_ArrVal_2228 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2228)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse8 (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_2229) .cse7 v_ArrVal_2231)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2233) |c_~#stored_elements~0.base| v_ArrVal_2234))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2236)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_2238) .cse1 v_ArrVal_2240)) |c_~#stored_elements~0.base| v_ArrVal_2241) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2240) (< (+ 1 (select .cse2 .cse3)) v_ArrVal_2229) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_214| (select .cse4 .cse1))) (< (+ (select .cse0 .cse5) 1) v_ArrVal_2238) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_215| (select .cse6 .cse1))) (< (+ (select .cse2 .cse7) 1) v_ArrVal_2231) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_214| 4) |c_~#queue~0.offset|) v_ArrVal_2242) .cse5) 2147483647)))))))) is different from false [2022-11-25 23:58:06,170 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-25 23:58:06,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057272816] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:58:06,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1277966536] [2022-11-25 23:58:06,170 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:58:06,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:58:06,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 53 [2022-11-25 23:58:06,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525708993] [2022-11-25 23:58:06,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:58:06,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-25 23:58:06,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:58:06,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-25 23:58:06,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=1682, Unknown=47, NotChecked=776, Total=2970 [2022-11-25 23:58:06,174 INFO L87 Difference]: Start difference. First operand 1311 states and 3122 transitions. Second operand has 55 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 54 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:59:04,569 WARN L233 SmtUtils]: Spent 38.44s on a formula simplification. DAG size of input: 187 DAG size of output: 119 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:59:07,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-25 23:59:51,519 WARN L233 SmtUtils]: Spent 40.80s on a formula simplification. DAG size of input: 179 DAG size of output: 116 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:00:34,721 WARN L233 SmtUtils]: Spent 38.44s on a formula simplification. DAG size of input: 172 DAG size of output: 119 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:00:36,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:00:51,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:01:34,490 WARN L233 SmtUtils]: Spent 10.31s on a formula simplification. DAG size of input: 199 DAG size of output: 153 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:01:38,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:01:54,531 WARN L233 SmtUtils]: Spent 6.42s on a formula simplification. DAG size of input: 185 DAG size of output: 141 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:02:12,802 WARN L233 SmtUtils]: Spent 14.32s on a formula simplification. DAG size of input: 232 DAG size of output: 182 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 00:02:15,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:02:17,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:02:31,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:03:09,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:03:11,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:03:38,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:03:40,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:03:42,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:03:44,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:03:46,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:03:48,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:03:50,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:03:52,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:04:03,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-26 00:04:05,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:04:07,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:04:09,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:04:16,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:04:18,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:04:20,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:04:22,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:04:24,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:04:26,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:04:28,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:04:30,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:04:32,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-26 00:04:34,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-26 00:04:36,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]