./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-2329fc7 [2022-12-14 15:34:03,606 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 15:34:03,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 15:34:03,619 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 15:34:03,619 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 15:34:03,619 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 15:34:03,620 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 15:34:03,621 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 15:34:03,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 15:34:03,623 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 15:34:03,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 15:34:03,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 15:34:03,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 15:34:03,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 15:34:03,626 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 15:34:03,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 15:34:03,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 15:34:03,627 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 15:34:03,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 15:34:03,629 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 15:34:03,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 15:34:03,632 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 15:34:03,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 15:34:03,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 15:34:03,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 15:34:03,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 15:34:03,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 15:34:03,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 15:34:03,636 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 15:34:03,637 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 15:34:03,637 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 15:34:03,637 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 15:34:03,638 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 15:34:03,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 15:34:03,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 15:34:03,639 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 15:34:03,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 15:34:03,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 15:34:03,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 15:34:03,640 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 15:34:03,641 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 15:34:03,642 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-12-14 15:34:03,655 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 15:34:03,655 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 15:34:03,656 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 15:34:03,656 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 15:34:03,656 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 15:34:03,656 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 15:34:03,656 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 15:34:03,656 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 15:34:03,657 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 15:34:03,657 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 15:34:03,657 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 15:34:03,657 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 15:34:03,657 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 15:34:03,657 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 15:34:03,657 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 15:34:03,657 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 15:34:03,657 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 15:34:03,657 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 15:34:03,658 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 15:34:03,658 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 15:34:03,658 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 15:34:03,658 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 15:34:03,658 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 15:34:03,658 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 15:34:03,659 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 15:34:03,659 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 15:34:03,659 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 15:34:03,659 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 15:34:03,659 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 15:34:03,659 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 15:34:03,659 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 15:34:03,659 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 15:34:03,659 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 15:34:03,659 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 15:34:03,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:34:03,660 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 15:34:03,660 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 15:34:03,660 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 15:34:03,660 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 15:34:03,660 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 15:34:03,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 15:34:03,660 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 15:34:03,660 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 15:34:03,660 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_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2022-12-14 15:34:03,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 15:34:03,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 15:34:03,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 15:34:03,843 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 15:34:03,843 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 15:34:03,844 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2022-12-14 15:34:06,409 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 15:34:06,596 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 15:34:06,596 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/sv-benchmarks/c/pthread/queue_ok_longer.i [2022-12-14 15:34:06,609 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/data/cf01a16d8/de7eff7b594449da88ad88644c7f17dd/FLAG19c75bf27 [2022-12-14 15:34:06,624 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/data/cf01a16d8/de7eff7b594449da88ad88644c7f17dd [2022-12-14 15:34:06,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 15:34:06,628 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 15:34:06,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 15:34:06,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 15:34:06,632 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 15:34:06,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:34:06" (1/1) ... [2022-12-14 15:34:06,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4493a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:34:06, skipping insertion in model container [2022-12-14 15:34:06,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:34:06" (1/1) ... [2022-12-14 15:34:06,642 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 15:34:06,681 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 15:34:07,046 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_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-12-14 15:34:07,049 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_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-12-14 15:34:07,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:34:07,063 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 15:34:07,107 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_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-12-14 15:34:07,110 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_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-12-14 15:34:07,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:34:07,153 INFO L208 MainTranslator]: Completed translation [2022-12-14 15:34:07,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:34:07 WrapperNode [2022-12-14 15:34:07,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 15:34:07,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 15:34:07,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 15:34:07,154 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 15:34:07,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:34:07" (1/1) ... [2022-12-14 15:34:07,176 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:34:07" (1/1) ... [2022-12-14 15:34:07,200 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 214 [2022-12-14 15:34:07,201 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 15:34:07,201 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 15:34:07,202 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 15:34:07,202 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 15:34:07,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:34:07" (1/1) ... [2022-12-14 15:34:07,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:34:07" (1/1) ... [2022-12-14 15:34:07,214 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:34:07" (1/1) ... [2022-12-14 15:34:07,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:34:07" (1/1) ... [2022-12-14 15:34:07,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:34:07" (1/1) ... [2022-12-14 15:34:07,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:34:07" (1/1) ... [2022-12-14 15:34:07,230 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:34:07" (1/1) ... [2022-12-14 15:34:07,232 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:34:07" (1/1) ... [2022-12-14 15:34:07,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 15:34:07,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 15:34:07,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 15:34:07,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 15:34:07,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:34:07" (1/1) ... [2022-12-14 15:34:07,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:34:07,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:34:07,263 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 15:34:07,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 15:34:07,296 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-14 15:34:07,296 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-14 15:34:07,296 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-14 15:34:07,296 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-14 15:34:07,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 15:34:07,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 15:34:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 15:34:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 15:34:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-14 15:34:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 15:34:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 15:34:07,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 15:34:07,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 15:34:07,299 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 15:34:07,419 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 15:34:07,420 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 15:34:07,707 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 15:34:07,715 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 15:34:07,715 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-14 15:34:07,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:34:07 BoogieIcfgContainer [2022-12-14 15:34:07,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 15:34:07,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 15:34:07,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 15:34:07,721 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 15:34:07,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:34:06" (1/3) ... [2022-12-14 15:34:07,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721b959f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:34:07, skipping insertion in model container [2022-12-14 15:34:07,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:34:07" (2/3) ... [2022-12-14 15:34:07,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721b959f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:34:07, skipping insertion in model container [2022-12-14 15:34:07,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:34:07" (3/3) ... [2022-12-14 15:34:07,723 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-12-14 15:34:07,730 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 15:34:07,737 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 15:34:07,738 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-12-14 15:34:07,738 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 15:34:07,818 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-14 15:34:07,846 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 15:34:07,857 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 245 places, 251 transitions, 518 flow [2022-12-14 15:34:07,859 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 245 places, 251 transitions, 518 flow [2022-12-14 15:34:07,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 251 transitions, 518 flow [2022-12-14 15:34:07,928 INFO L130 PetriNetUnfolder]: 13/249 cut-off events. [2022-12-14 15:34:07,928 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-14 15:34:07,934 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 462 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-12-14 15:34:07,938 INFO L119 LiptonReduction]: Number of co-enabled transitions 14376 [2022-12-14 15:34:16,295 INFO L134 LiptonReduction]: Checked pairs total: 31164 [2022-12-14 15:34:16,295 INFO L136 LiptonReduction]: Total number of compositions: 241 [2022-12-14 15:34:16,301 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 61 places, 61 transitions, 138 flow [2022-12-14 15:34:16,343 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1060 states, 1012 states have (on average 2.7865612648221343) internal successors, (2820), 1059 states have internal predecessors, (2820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:34:16,355 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 15:34:16,360 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;@36d51bb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 15:34:16,360 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-12-14 15:34:16,363 INFO L276 IsEmpty]: Start isEmpty. Operand has 1060 states, 1012 states have (on average 2.7865612648221343) internal successors, (2820), 1059 states have internal predecessors, (2820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:34:16,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 15:34:16,367 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:16,367 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:16,368 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 15:34:16,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:16,371 INFO L85 PathProgramCache]: Analyzing trace with hash 806788440, now seen corresponding path program 1 times [2022-12-14 15:34:16,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:16,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041767979] [2022-12-14 15:34:16,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:16,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:17,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:17,108 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:17,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041767979] [2022-12-14 15:34:17,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041767979] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:17,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:17,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:34:17,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959906946] [2022-12-14 15:34:17,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:17,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:34:17,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:17,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:34:17,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:34:17,141 INFO L87 Difference]: Start difference. First operand has 1060 states, 1012 states have (on average 2.7865612648221343) internal successors, (2820), 1059 states have internal predecessors, (2820), 0 states have call successors, (0), 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-12-14 15:34:17,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:17,301 INFO L93 Difference]: Finished difference Result 1068 states and 2836 transitions. [2022-12-14 15:34:17,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:34:17,303 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-12-14 15:34:17,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:17,328 INFO L225 Difference]: With dead ends: 1068 [2022-12-14 15:34:17,328 INFO L226 Difference]: Without dead ends: 1068 [2022-12-14 15:34:17,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-12-14 15:34:17,331 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:17,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 15 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:34:17,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2022-12-14 15:34:17,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1063. [2022-12-14 15:34:17,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 1015 states have (on average 2.7852216748768472) internal successors, (2827), 1062 states have internal predecessors, (2827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:34:17,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 2827 transitions. [2022-12-14 15:34:17,395 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 2827 transitions. Word has length 7 [2022-12-14 15:34:17,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:17,396 INFO L495 AbstractCegarLoop]: Abstraction has 1063 states and 2827 transitions. [2022-12-14 15:34:17,396 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-12-14 15:34:17,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 2827 transitions. [2022-12-14 15:34:17,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 15:34:17,396 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:17,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:17,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 15:34:17,397 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 15:34:17,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:17,397 INFO L85 PathProgramCache]: Analyzing trace with hash -280538193, now seen corresponding path program 1 times [2022-12-14 15:34:17,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:17,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582124406] [2022-12-14 15:34:17,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:17,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:17,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:17,834 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:17,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582124406] [2022-12-14 15:34:17,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582124406] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:17,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:17,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:34:17,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038102147] [2022-12-14 15:34:17,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:17,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:34:17,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:17,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:34:17,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:34:17,837 INFO L87 Difference]: Start difference. First operand 1063 states and 2827 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-12-14 15:34:18,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:18,125 INFO L93 Difference]: Finished difference Result 1829 states and 4954 transitions. [2022-12-14 15:34:18,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:34:18,126 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-12-14 15:34:18,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:18,132 INFO L225 Difference]: With dead ends: 1829 [2022-12-14 15:34:18,132 INFO L226 Difference]: Without dead ends: 1829 [2022-12-14 15:34:18,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:34:18,133 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 131 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:18,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 26 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:34:18,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2022-12-14 15:34:18,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1228. [2022-12-14 15:34:18,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 1180 states have (on average 2.828813559322034) internal successors, (3338), 1227 states have internal predecessors, (3338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:34:18,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 3338 transitions. [2022-12-14 15:34:18,165 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 3338 transitions. Word has length 8 [2022-12-14 15:34:18,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:18,165 INFO L495 AbstractCegarLoop]: Abstraction has 1228 states and 3338 transitions. [2022-12-14 15:34:18,165 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-12-14 15:34:18,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 3338 transitions. [2022-12-14 15:34:18,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 15:34:18,166 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:18,166 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:18,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 15:34:18,166 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 15:34:18,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:18,167 INFO L85 PathProgramCache]: Analyzing trace with hash -280538192, now seen corresponding path program 1 times [2022-12-14 15:34:18,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:18,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269240146] [2022-12-14 15:34:18,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:18,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:18,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:18,553 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:18,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269240146] [2022-12-14 15:34:18,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269240146] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:18,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:18,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:34:18,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132790780] [2022-12-14 15:34:18,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:18,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:34:18,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:18,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:34:18,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:34:18,555 INFO L87 Difference]: Start difference. First operand 1228 states and 3338 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-12-14 15:34:18,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:18,772 INFO L93 Difference]: Finished difference Result 1437 states and 3797 transitions. [2022-12-14 15:34:18,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:34:18,773 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-12-14 15:34:18,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:18,777 INFO L225 Difference]: With dead ends: 1437 [2022-12-14 15:34:18,778 INFO L226 Difference]: Without dead ends: 1437 [2022-12-14 15:34:18,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:34:18,778 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 91 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:18,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 26 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:34:18,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2022-12-14 15:34:18,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1228. [2022-12-14 15:34:18,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 1180 states have (on average 2.799152542372881) internal successors, (3303), 1227 states have internal predecessors, (3303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:34:18,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 3303 transitions. [2022-12-14 15:34:18,805 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 3303 transitions. Word has length 8 [2022-12-14 15:34:18,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:18,805 INFO L495 AbstractCegarLoop]: Abstraction has 1228 states and 3303 transitions. [2022-12-14 15:34:18,805 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-12-14 15:34:18,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 3303 transitions. [2022-12-14 15:34:18,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 15:34:18,806 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:18,806 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:18,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 15:34:18,806 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 15:34:18,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:18,807 INFO L85 PathProgramCache]: Analyzing trace with hash -759260343, now seen corresponding path program 2 times [2022-12-14 15:34:18,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:18,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394388038] [2022-12-14 15:34:18,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:18,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:19,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:19,408 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:19,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394388038] [2022-12-14 15:34:19,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394388038] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:19,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:19,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:34:19,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359076923] [2022-12-14 15:34:19,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:19,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:34:19,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:19,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:34:19,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:34:19,410 INFO L87 Difference]: Start difference. First operand 1228 states and 3303 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-12-14 15:34:19,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:19,919 INFO L93 Difference]: Finished difference Result 1472 states and 3888 transitions. [2022-12-14 15:34:19,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:34:19,920 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-12-14 15:34:19,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:19,928 INFO L225 Difference]: With dead ends: 1472 [2022-12-14 15:34:19,928 INFO L226 Difference]: Without dead ends: 1472 [2022-12-14 15:34:19,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:34:19,929 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 89 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:19,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 26 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:34:19,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2022-12-14 15:34:19,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1228. [2022-12-14 15:34:19,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 1180 states have (on average 2.799152542372881) internal successors, (3303), 1227 states have internal predecessors, (3303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:34:19,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 3303 transitions. [2022-12-14 15:34:19,968 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 3303 transitions. Word has length 8 [2022-12-14 15:34:19,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:19,968 INFO L495 AbstractCegarLoop]: Abstraction has 1228 states and 3303 transitions. [2022-12-14 15:34:19,968 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-12-14 15:34:19,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 3303 transitions. [2022-12-14 15:34:19,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 15:34:19,969 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:19,969 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:19,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 15:34:19,969 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 15:34:19,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:19,969 INFO L85 PathProgramCache]: Analyzing trace with hash -759359853, now seen corresponding path program 3 times [2022-12-14 15:34:19,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:19,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997108402] [2022-12-14 15:34:19,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:19,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:20,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:20,581 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:20,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997108402] [2022-12-14 15:34:20,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997108402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:20,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:20,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:34:20,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862401829] [2022-12-14 15:34:20,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:20,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:34:20,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:20,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:34:20,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:34:20,583 INFO L87 Difference]: Start difference. First operand 1228 states and 3303 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-12-14 15:34:20,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:20,947 INFO L93 Difference]: Finished difference Result 1373 states and 3676 transitions. [2022-12-14 15:34:20,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:34:20,949 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-12-14 15:34:20,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:20,953 INFO L225 Difference]: With dead ends: 1373 [2022-12-14 15:34:20,953 INFO L226 Difference]: Without dead ends: 1373 [2022-12-14 15:34:20,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-12-14 15:34:20,954 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 108 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:20,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 24 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:34:20,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2022-12-14 15:34:20,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1228. [2022-12-14 15:34:20,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 1180 states have (on average 2.799152542372881) internal successors, (3303), 1227 states have internal predecessors, (3303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:34:20,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 3303 transitions. [2022-12-14 15:34:20,978 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 3303 transitions. Word has length 8 [2022-12-14 15:34:20,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:20,978 INFO L495 AbstractCegarLoop]: Abstraction has 1228 states and 3303 transitions. [2022-12-14 15:34:20,978 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-12-14 15:34:20,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 3303 transitions. [2022-12-14 15:34:20,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 15:34:20,979 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:20,979 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:20,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 15:34:20,979 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 15:34:20,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:20,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1513837204, now seen corresponding path program 1 times [2022-12-14 15:34:20,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:20,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900978602] [2022-12-14 15:34:20,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:20,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:21,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:21,007 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:21,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900978602] [2022-12-14 15:34:21,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900978602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:21,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:21,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:34:21,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846637935] [2022-12-14 15:34:21,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:21,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:34:21,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:21,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:34:21,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:34:21,009 INFO L87 Difference]: Start difference. First operand 1228 states and 3303 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-12-14 15:34:21,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:21,159 INFO L93 Difference]: Finished difference Result 1990 states and 5370 transitions. [2022-12-14 15:34:21,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:34:21,159 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-12-14 15:34:21,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:21,165 INFO L225 Difference]: With dead ends: 1990 [2022-12-14 15:34:21,165 INFO L226 Difference]: Without dead ends: 1990 [2022-12-14 15:34:21,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:34:21,166 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 68 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:21,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 20 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:34:21,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2022-12-14 15:34:21,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1802. [2022-12-14 15:34:21,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1754 states have (on average 2.8916761687571264) internal successors, (5072), 1801 states have internal predecessors, (5072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:34:21,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 5072 transitions. [2022-12-14 15:34:21,199 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 5072 transitions. Word has length 9 [2022-12-14 15:34:21,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:21,199 INFO L495 AbstractCegarLoop]: Abstraction has 1802 states and 5072 transitions. [2022-12-14 15:34:21,200 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-12-14 15:34:21,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 5072 transitions. [2022-12-14 15:34:21,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 15:34:21,200 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:21,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:21,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 15:34:21,201 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 15:34:21,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:21,201 INFO L85 PathProgramCache]: Analyzing trace with hash 393815127, now seen corresponding path program 1 times [2022-12-14 15:34:21,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:21,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428730707] [2022-12-14 15:34:21,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:21,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:21,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:21,414 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:21,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428730707] [2022-12-14 15:34:21,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428730707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:21,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:21,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:34:21,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007637780] [2022-12-14 15:34:21,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:21,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:34:21,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:21,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:34:21,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:34:21,415 INFO L87 Difference]: Start difference. First operand 1802 states and 5072 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:34:21,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:21,517 INFO L93 Difference]: Finished difference Result 1810 states and 5087 transitions. [2022-12-14 15:34:21,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:34:21,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-14 15:34:21,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:21,527 INFO L225 Difference]: With dead ends: 1810 [2022-12-14 15:34:21,527 INFO L226 Difference]: Without dead ends: 1810 [2022-12-14 15:34:21,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-12-14 15:34:21,528 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:21,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 15 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:34:21,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2022-12-14 15:34:21,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1805. [2022-12-14 15:34:21,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1805 states, 1757 states have (on average 2.890153671030165) internal successors, (5078), 1804 states have internal predecessors, (5078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:34:21,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 5078 transitions. [2022-12-14 15:34:21,560 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 5078 transitions. Word has length 10 [2022-12-14 15:34:21,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:21,560 INFO L495 AbstractCegarLoop]: Abstraction has 1805 states and 5078 transitions. [2022-12-14 15:34:21,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:34:21,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 5078 transitions. [2022-12-14 15:34:21,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 15:34:21,561 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:21,561 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:21,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 15:34:21,561 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 15:34:21,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:21,561 INFO L85 PathProgramCache]: Analyzing trace with hash 489437856, now seen corresponding path program 1 times [2022-12-14 15:34:21,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:21,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106439708] [2022-12-14 15:34:21,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:21,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:21,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:21,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:21,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106439708] [2022-12-14 15:34:21,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106439708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:21,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:21,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:34:21,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562192185] [2022-12-14 15:34:21,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:21,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:34:21,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:21,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:34:21,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:34:21,805 INFO L87 Difference]: Start difference. First operand 1805 states and 5078 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-12-14 15:34:22,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:22,006 INFO L93 Difference]: Finished difference Result 2308 states and 6366 transitions. [2022-12-14 15:34:22,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:34:22,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-12-14 15:34:22,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:22,013 INFO L225 Difference]: With dead ends: 2308 [2022-12-14 15:34:22,014 INFO L226 Difference]: Without dead ends: 2308 [2022-12-14 15:34:22,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-12-14 15:34:22,014 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 71 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:22,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 31 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:34:22,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2308 states. [2022-12-14 15:34:22,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2308 to 2050. [2022-12-14 15:34:22,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 2002 states have (on average 2.866133866133866) internal successors, (5738), 2049 states have internal predecessors, (5738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:34:22,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 5738 transitions. [2022-12-14 15:34:22,051 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 5738 transitions. Word has length 11 [2022-12-14 15:34:22,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:22,051 INFO L495 AbstractCegarLoop]: Abstraction has 2050 states and 5738 transitions. [2022-12-14 15:34:22,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-12-14 15:34:22,052 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 5738 transitions. [2022-12-14 15:34:22,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 15:34:22,052 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:22,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:22,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 15:34:22,052 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 15:34:22,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:22,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1196506376, now seen corresponding path program 1 times [2022-12-14 15:34:22,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:22,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126864387] [2022-12-14 15:34:22,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:22,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:22,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:22,083 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:22,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126864387] [2022-12-14 15:34:22,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126864387] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:22,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:22,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:34:22,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556206986] [2022-12-14 15:34:22,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:22,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:34:22,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:22,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:34:22,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:34:22,085 INFO L87 Difference]: Start difference. First operand 2050 states and 5738 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-12-14 15:34:22,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:22,142 INFO L93 Difference]: Finished difference Result 590 states and 1369 transitions. [2022-12-14 15:34:22,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:34:22,142 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-12-14 15:34:22,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:22,146 INFO L225 Difference]: With dead ends: 590 [2022-12-14 15:34:22,146 INFO L226 Difference]: Without dead ends: 568 [2022-12-14 15:34:22,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:34:22,147 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 28 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:22,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 6 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:34:22,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2022-12-14 15:34:22,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2022-12-14 15:34:22,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 550 states have (on average 2.4127272727272726) internal successors, (1327), 567 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:34:22,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 1327 transitions. [2022-12-14 15:34:22,156 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 1327 transitions. Word has length 11 [2022-12-14 15:34:22,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:22,156 INFO L495 AbstractCegarLoop]: Abstraction has 568 states and 1327 transitions. [2022-12-14 15:34:22,156 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-12-14 15:34:22,156 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 1327 transitions. [2022-12-14 15:34:22,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 15:34:22,156 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:22,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:22,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 15:34:22,157 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 15:34:22,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:22,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1830710074, now seen corresponding path program 2 times [2022-12-14 15:34:22,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:22,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495269614] [2022-12-14 15:34:22,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:22,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:22,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:22,485 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:22,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495269614] [2022-12-14 15:34:22,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495269614] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:22,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:22,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:34:22,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340560162] [2022-12-14 15:34:22,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:22,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:34:22,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:22,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:34:22,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:34:22,486 INFO L87 Difference]: Start difference. First operand 568 states and 1327 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-12-14 15:34:22,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:22,670 INFO L93 Difference]: Finished difference Result 796 states and 1848 transitions. [2022-12-14 15:34:22,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:34:22,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-12-14 15:34:22,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:22,676 INFO L225 Difference]: With dead ends: 796 [2022-12-14 15:34:22,677 INFO L226 Difference]: Without dead ends: 796 [2022-12-14 15:34:22,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-12-14 15:34:22,677 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 38 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:22,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 23 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:34:22,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2022-12-14 15:34:22,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 557. [2022-12-14 15:34:22,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 539 states have (on average 2.4155844155844157) internal successors, (1302), 556 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:34:22,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1302 transitions. [2022-12-14 15:34:22,686 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 1302 transitions. Word has length 11 [2022-12-14 15:34:22,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:22,686 INFO L495 AbstractCegarLoop]: Abstraction has 557 states and 1302 transitions. [2022-12-14 15:34:22,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-12-14 15:34:22,686 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 1302 transitions. [2022-12-14 15:34:22,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 15:34:22,686 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:22,686 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:22,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 15:34:22,686 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 15:34:22,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:22,687 INFO L85 PathProgramCache]: Analyzing trace with hash -674522538, now seen corresponding path program 3 times [2022-12-14 15:34:22,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:22,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838081363] [2022-12-14 15:34:22,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:22,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:23,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:23,220 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:23,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838081363] [2022-12-14 15:34:23,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838081363] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:23,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:23,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:34:23,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041019799] [2022-12-14 15:34:23,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:23,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:34:23,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:23,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:34:23,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:34:23,221 INFO L87 Difference]: Start difference. First operand 557 states and 1302 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-12-14 15:34:23,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:23,590 INFO L93 Difference]: Finished difference Result 774 states and 1798 transitions. [2022-12-14 15:34:23,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:34:23,591 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-12-14 15:34:23,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:23,594 INFO L225 Difference]: With dead ends: 774 [2022-12-14 15:34:23,594 INFO L226 Difference]: Without dead ends: 774 [2022-12-14 15:34:23,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:34:23,594 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 39 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:23,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 22 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:34:23,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2022-12-14 15:34:23,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 546. [2022-12-14 15:34:23,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 528 states have (on average 2.418560606060606) internal successors, (1277), 545 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:34:23,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1277 transitions. [2022-12-14 15:34:23,604 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1277 transitions. Word has length 11 [2022-12-14 15:34:23,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:23,604 INFO L495 AbstractCegarLoop]: Abstraction has 546 states and 1277 transitions. [2022-12-14 15:34:23,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 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-12-14 15:34:23,604 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1277 transitions. [2022-12-14 15:34:23,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 15:34:23,605 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:23,605 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:23,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 15:34:23,605 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 15:34:23,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:23,605 INFO L85 PathProgramCache]: Analyzing trace with hash 499134818, now seen corresponding path program 1 times [2022-12-14 15:34:23,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:23,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970323543] [2022-12-14 15:34:23,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:23,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:23,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:23,633 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:23,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970323543] [2022-12-14 15:34:23,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970323543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:34:23,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:34:23,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:34:23,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992175149] [2022-12-14 15:34:23,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:34:23,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:34:23,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:23,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:34:23,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:34:23,634 INFO L87 Difference]: Start difference. First operand 546 states and 1277 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:34:23,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:23,703 INFO L93 Difference]: Finished difference Result 570 states and 1325 transitions. [2022-12-14 15:34:23,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:34:23,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-12-14 15:34:23,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:23,706 INFO L225 Difference]: With dead ends: 570 [2022-12-14 15:34:23,706 INFO L226 Difference]: Without dead ends: 570 [2022-12-14 15:34:23,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:34:23,707 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:23,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 9 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:34:23,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2022-12-14 15:34:23,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2022-12-14 15:34:23,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 552 states have (on average 2.4003623188405796) internal successors, (1325), 569 states have internal predecessors, (1325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:34:23,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1325 transitions. [2022-12-14 15:34:23,723 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1325 transitions. Word has length 12 [2022-12-14 15:34:23,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:23,723 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 1325 transitions. [2022-12-14 15:34:23,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:34:23,723 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1325 transitions. [2022-12-14 15:34:23,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 15:34:23,724 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:23,724 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:23,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 15:34:23,724 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 15:34:23,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:23,725 INFO L85 PathProgramCache]: Analyzing trace with hash 551037305, now seen corresponding path program 1 times [2022-12-14 15:34:23,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:23,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670875300] [2022-12-14 15:34:23,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:23,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:23,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:23,997 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:23,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670875300] [2022-12-14 15:34:23,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670875300] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:34:23,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441748241] [2022-12-14 15:34:23,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:23,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:34:23,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:34:23,998 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:34:23,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 15:34:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:24,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 15:34:24,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:34:24,227 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-12-14 15:34:24,299 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-12-14 15:34:24,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:24,329 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-12-14 15:34:24,400 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 15:34:24,400 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-12-14 15:34:24,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:24,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:34:24,673 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:34:24,673 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 2 case distinctions, treesize of input 36 treesize of output 42 [2022-12-14 15:34:24,683 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:34:24,683 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 55 treesize of output 59 [2022-12-14 15:34:24,689 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 32 treesize of output 28 [2022-12-14 15:34:24,706 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-12-14 15:34:24,715 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:34:24,715 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 47 treesize of output 47 [2022-12-14 15:34:24,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:24,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441748241] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:34:24,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1303095239] [2022-12-14 15:34:24,799 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-12-14 15:34:24,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:34:24,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-14 15:34:24,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960406346] [2022-12-14 15:34:24,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:34:24,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 15:34:24,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:24,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 15:34:24,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=392, Unknown=4, NotChecked=0, Total=506 [2022-12-14 15:34:24,802 INFO L87 Difference]: Start difference. First operand 570 states and 1325 transitions. Second operand has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 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-12-14 15:34:25,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:25,279 INFO L93 Difference]: Finished difference Result 1224 states and 2843 transitions. [2022-12-14 15:34:25,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 15:34:25,280 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 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 15 [2022-12-14 15:34:25,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:25,284 INFO L225 Difference]: With dead ends: 1224 [2022-12-14 15:34:25,284 INFO L226 Difference]: Without dead ends: 1224 [2022-12-14 15:34:25,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=415, Unknown=4, NotChecked=0, Total=552 [2022-12-14 15:34:25,285 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 475 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:25,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 55 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:34:25,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2022-12-14 15:34:25,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 701. [2022-12-14 15:34:25,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 683 states have (on average 2.480234260614934) internal successors, (1694), 700 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:34:25,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1694 transitions. [2022-12-14 15:34:25,303 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1694 transitions. Word has length 15 [2022-12-14 15:34:25,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:25,303 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 1694 transitions. [2022-12-14 15:34:25,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 22 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-12-14 15:34:25,304 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1694 transitions. [2022-12-14 15:34:25,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 15:34:25,304 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:25,304 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:25,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 15:34:25,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:34:25,505 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 15:34:25,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:25,506 INFO L85 PathProgramCache]: Analyzing trace with hash 551037306, now seen corresponding path program 1 times [2022-12-14 15:34:25,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:25,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116723207] [2022-12-14 15:34:25,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:25,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:26,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:26,062 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:26,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116723207] [2022-12-14 15:34:26,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116723207] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:34:26,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238134991] [2022-12-14 15:34:26,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:26,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:34:26,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:34:26,064 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:34:26,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 15:34:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:26,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-14 15:34:26,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:34:26,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:26,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:26,192 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 15:34:26,192 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-12-14 15:34:26,202 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 15:34:26,203 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-12-14 15:34:26,289 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-12-14 15:34:26,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 53 treesize of output 46 [2022-12-14 15:34:26,566 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-12-14 15:34:26,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:26,632 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-12-14 15:34:26,764 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-12-14 15:34:26,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:26,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:34:27,000 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 Int) (v_ArrVal_551 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_93| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_551) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_93| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_93| 4) |c_~#queue~0.offset|) v_ArrVal_552) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-12-14 15:34:27,086 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 Int) (v_ArrVal_550 Int) (v_ArrVal_551 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_93| 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_550)) |c_~#stored_elements~0.base| v_ArrVal_551) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_550) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_93| 4) |c_~#queue~0.offset|) v_ArrVal_552) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_93| (select .cse2 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-12-14 15:34:27,115 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 Int) (v_ArrVal_550 Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_548 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_93| 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_548) .cse2 v_ArrVal_550)) |c_~#stored_elements~0.base| v_ArrVal_551) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_93| 4) |c_~#queue~0.offset|) v_ArrVal_552) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_548 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_550) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_93| (select .cse0 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-12-14 15:34:27,139 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 Int) (v_ArrVal_550 Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_548 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_93| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.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_548) .cse2 v_ArrVal_550)) |c_~#stored_elements~0.base| v_ArrVal_551) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_93| 4) |c_~#queue~0.offset|) v_ArrVal_552) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_550) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_93| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse3) 1) v_ArrVal_548))))) is different from false [2022-12-14 15:34:27,166 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 Int) (v_ArrVal_550 Int) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_548 Int) (v_ArrVal_545 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_93| 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_545)) (.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_548) .cse3 v_ArrVal_550)) |c_~#stored_elements~0.base| v_ArrVal_551) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_93| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_93| 4) |c_~#queue~0.offset|) v_ArrVal_552) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_548) (< (+ (select .cse1 .cse3) 1) v_ArrVal_550))))) is different from false [2022-12-14 15:34:29,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 15:34:29,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238134991] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:34:29,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [684038513] [2022-12-14 15:34:29,391 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-12-14 15:34:29,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:34:29,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-12-14 15:34:29,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215657853] [2022-12-14 15:34:29,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:34:29,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 15:34:29,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:29,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 15:34:29,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=524, Unknown=8, NotChecked=270, Total=992 [2022-12-14 15:34:29,393 INFO L87 Difference]: Start difference. First operand 701 states and 1694 transitions. Second operand has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 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-12-14 15:34:32,773 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-12-14 15:34:33,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:33,194 INFO L93 Difference]: Finished difference Result 721 states and 1739 transitions. [2022-12-14 15:34:33,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 15:34:33,194 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 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 15 [2022-12-14 15:34:33,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:33,197 INFO L225 Difference]: With dead ends: 721 [2022-12-14 15:34:33,197 INFO L226 Difference]: Without dead ends: 721 [2022-12-14 15:34:33,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=345, Invalid=927, Unknown=8, NotChecked=360, Total=1640 [2022-12-14 15:34:33,198 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 33 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 7 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 393 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:33,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 102 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 874 Invalid, 3 Unknown, 393 Unchecked, 2.9s Time] [2022-12-14 15:34:33,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2022-12-14 15:34:33,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 712. [2022-12-14 15:34:33,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 694 states have (on average 2.4827089337175794) internal successors, (1723), 711 states have internal predecessors, (1723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:34:33,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1723 transitions. [2022-12-14 15:34:33,209 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1723 transitions. Word has length 15 [2022-12-14 15:34:33,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:33,209 INFO L495 AbstractCegarLoop]: Abstraction has 712 states and 1723 transitions. [2022-12-14 15:34:33,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 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-12-14 15:34:33,209 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1723 transitions. [2022-12-14 15:34:33,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:34:33,210 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:33,210 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:33,214 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 15:34:33,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 15:34:33,412 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 15:34:33,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:33,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1170958127, now seen corresponding path program 1 times [2022-12-14 15:34:33,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:33,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958643435] [2022-12-14 15:34:33,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:33,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:34,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:34,048 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:34,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958643435] [2022-12-14 15:34:34,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958643435] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:34:34,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178773849] [2022-12-14 15:34:34,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:34,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:34:34,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:34:34,050 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:34:34,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 15:34:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:34,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 73 conjunts are in the unsatisfiable core [2022-12-14 15:34:34,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:34:34,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:34,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:34,174 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 15:34:34,174 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-12-14 15:34:34,190 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 15:34:34,190 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-12-14 15:34:34,246 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-12-14 15:34:34,343 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-12-14 15:34:34,443 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 73 treesize of output 66 [2022-12-14 15:34:34,612 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 54 treesize of output 47 [2022-12-14 15:34:34,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:34,675 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-12-14 15:34:34,792 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 59 treesize of output 52 [2022-12-14 15:34:34,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:34,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:34:35,268 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_654 Int) (v_ArrVal_652 Int) (v_ArrVal_650 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_653 (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_650) .cse3 v_ArrVal_652)) |c_~#stored_elements~0.base| v_ArrVal_653) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_654) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_650) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse3) 1) v_ArrVal_652))))) is different from false [2022-12-14 15:34:35,298 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_654 Int) (v_ArrVal_652 Int) (v_ArrVal_650 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_648 Int) (v_ArrVal_653 (Array Int Int))) (let ((.cse0 (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_648)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse2 v_ArrVal_650) .cse1 v_ArrVal_652)) |c_~#stored_elements~0.base| v_ArrVal_653) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_652) (< (+ (select .cse0 .cse2) 1) v_ArrVal_650) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_654) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse3 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-12-14 15:34:45,441 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_654 Int) (v_ArrVal_652 Int) (v_ArrVal_646 (Array Int Int)) (v_ArrVal_650 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_648 Int) (v_ArrVal_653 (Array Int Int))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_646))) (let ((.cse0 (let ((.cse5 (select .cse4 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_648))) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse2 v_ArrVal_650) .cse1 v_ArrVal_652)) |c_~#stored_elements~0.base| v_ArrVal_653) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_652) (< (+ (select .cse0 .cse2) 1) v_ArrVal_650) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_654) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse3 .cse1)))))))) is different from false [2022-12-14 15:34:45,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 15:34:45,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178773849] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:34:45,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [459568720] [2022-12-14 15:34:45,459 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-12-14 15:34:45,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:34:45,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-14 15:34:45,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876669233] [2022-12-14 15:34:45,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:34:45,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 15:34:45,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:45,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 15:34:45,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=750, Unknown=23, NotChecked=186, Total=1190 [2022-12-14 15:34:45,460 INFO L87 Difference]: Start difference. First operand 712 states and 1723 transitions. Second operand has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 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-12-14 15:34:48,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, 1] [2022-12-14 15:34:51,014 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-12-14 15:34:51,039 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 ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ (select .cse4 .cse5) 1))) (and (forall ((v_ArrVal_654 Int) (v_ArrVal_652 Int) (v_ArrVal_650 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_653 (Array Int 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_650) .cse5 v_ArrVal_652)) |c_~#stored_elements~0.base| v_ArrVal_653) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_654) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse0 .cse2))) (< .cse3 v_ArrVal_652) (not (<= v_ArrVal_650 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)))))) (forall ((v_ArrVal_654 Int) (v_ArrVal_652 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_653 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_652)) |c_~#stored_elements~0.base| v_ArrVal_653) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse6 .cse2))) (< (select (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_654) .cse1) 2147483647) (< .cse3 v_ArrVal_652))))))) is different from false [2022-12-14 15:34:51,194 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_654 Int) (v_ArrVal_652 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_653 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_652)) |c_~#stored_elements~0.base| v_ArrVal_653) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse0 .cse1))) (not (<= v_ArrVal_652 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_654) .cse2) 2147483647)))) (forall ((v_ArrVal_654 Int) (v_ArrVal_652 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| Int) (v_ArrVal_653 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_652)) |c_~#stored_elements~0.base| v_ArrVal_653) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| (select .cse5 .cse1))) (< (select (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_98| 4)) v_ArrVal_654) .cse2) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_652)))))) is different from false [2022-12-14 15:34:54,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:34:55,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:34:55,545 INFO L93 Difference]: Finished difference Result 1213 states and 2908 transitions. [2022-12-14 15:34:55,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 15:34:55,545 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 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-12-14 15:34:55,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:34:55,547 INFO L225 Difference]: With dead ends: 1213 [2022-12-14 15:34:55,548 INFO L226 Difference]: Without dead ends: 1213 [2022-12-14 15:34:55,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=445, Invalid=1356, Unknown=25, NotChecked=430, Total=2256 [2022-12-14 15:34:55,548 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 355 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 22 mSolverCounterUnsat, 78 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 2058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 78 IncrementalHoareTripleChecker+Unknown, 575 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:34:55,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 166 Invalid, 2058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1383 Invalid, 78 Unknown, 575 Unchecked, 9.1s Time] [2022-12-14 15:34:55,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2022-12-14 15:34:55,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 833. [2022-12-14 15:34:55,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 815 states have (on average 2.5312883435582823) internal successors, (2063), 832 states have internal predecessors, (2063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:34:55,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 2063 transitions. [2022-12-14 15:34:55,560 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 2063 transitions. Word has length 16 [2022-12-14 15:34:55,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:34:55,560 INFO L495 AbstractCegarLoop]: Abstraction has 833 states and 2063 transitions. [2022-12-14 15:34:55,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 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-12-14 15:34:55,560 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 2063 transitions. [2022-12-14 15:34:55,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:34:55,561 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:34:55,561 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:34:55,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 15:34:55,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 15:34:55,762 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 15:34:55,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:34:55,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1448019792, now seen corresponding path program 1 times [2022-12-14 15:34:55,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:34:55,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858363793] [2022-12-14 15:34:55,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:55,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:34:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:56,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:56,182 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:34:56,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858363793] [2022-12-14 15:34:56,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858363793] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:34:56,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339423554] [2022-12-14 15:34:56,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:34:56,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:34:56,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:34:56,183 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:34:56,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 15:34:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:34:56,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 71 conjunts are in the unsatisfiable core [2022-12-14 15:34:56,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:34:56,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:56,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:56,301 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 15:34:56,301 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-12-14 15:34:56,317 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 15:34:56,317 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-12-14 15:34:56,413 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-12-14 15:34:56,471 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-12-14 15:34:56,550 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-12-14 15:34:56,663 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-12-14 15:34:56,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:34:56,723 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-12-14 15:34:56,848 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-12-14 15:34:56,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:34:56,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:34:57,060 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_753 Int) (v_ArrVal_755 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_103| Int) (v_ArrVal_757 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_753)) |c_~#stored_elements~0.base| v_ArrVal_755) |c_~#queue~0.base|))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_103| 4) |c_~#queue~0.offset|) v_ArrVal_757) (+ 1608 |c_~#queue~0.offset|)))) (not (<= v_ArrVal_753 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_103| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-12-14 15:34:57,191 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_753 Int) (v_ArrVal_755 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_103| Int) (v_ArrVal_757 Int) (v_ArrVal_752 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_752))) (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_753)) |c_~#stored_elements~0.base| v_ArrVal_755) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_753) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_103| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< 0 (+ 2147483650 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_103| 4) |c_~#queue~0.offset|) v_ArrVal_757) (+ 1608 |c_~#queue~0.offset|))))))))) is different from false [2022-12-14 15:34:57,231 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_753 Int) (v_ArrVal_755 (Array Int Int)) (v_ArrVal_751 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_103| Int) (v_ArrVal_757 Int) (v_ArrVal_752 (Array Int 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_751)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_752))) (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_753)) |c_~#stored_elements~0.base| v_ArrVal_755) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_103| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_753) (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_103| 4) |c_~#queue~0.offset|) v_ArrVal_757) (+ 1608 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_751 2147483648) 0)))))) is different from false [2022-12-14 15:34:57,281 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_753 Int) (v_ArrVal_755 (Array Int Int)) (v_ArrVal_751 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_103| Int) (v_ArrVal_749 Int) (v_ArrVal_757 Int) (v_ArrVal_752 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (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_749) (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_751)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_752))) (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_753)) |c_~#stored_elements~0.base| v_ArrVal_755) |c_~#queue~0.base|))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_103| 4) |c_~#queue~0.offset|) v_ArrVal_757) (+ 1608 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_753) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_103| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ v_ArrVal_751 2147483648) 0)))))) is different from false [2022-12-14 15:34:57,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 15:34:57,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339423554] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:34:57,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1882173253] [2022-12-14 15:34:57,486 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-12-14 15:34:57,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:34:57,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 28 [2022-12-14 15:34:57,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213181754] [2022-12-14 15:34:57,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:34:57,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-14 15:34:57,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:34:57,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-14 15:34:57,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=483, Unknown=17, NotChecked=204, Total=870 [2022-12-14 15:34:57,488 INFO L87 Difference]: Start difference. First operand 833 states and 2063 transitions. Second operand has 30 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 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-12-14 15:35:03,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:35:14,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:35:14,679 INFO L93 Difference]: Finished difference Result 1855 states and 4474 transitions. [2022-12-14 15:35:14,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 15:35:14,680 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 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-12-14 15:35:14,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:35:14,683 INFO L225 Difference]: With dead ends: 1855 [2022-12-14 15:35:14,683 INFO L226 Difference]: Without dead ends: 1855 [2022-12-14 15:35:14,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=538, Invalid=1350, Unknown=20, NotChecked=348, Total=2256 [2022-12-14 15:35:14,684 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 735 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 615 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-12-14 15:35:14,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 98 Invalid, 1566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 850 Invalid, 0 Unknown, 615 Unchecked, 3.9s Time] [2022-12-14 15:35:14,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2022-12-14 15:35:14,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 800. [2022-12-14 15:35:14,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 784 states have (on average 2.4489795918367347) internal successors, (1920), 799 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:35:14,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1920 transitions. [2022-12-14 15:35:14,702 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1920 transitions. Word has length 16 [2022-12-14 15:35:14,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:35:14,702 INFO L495 AbstractCegarLoop]: Abstraction has 800 states and 1920 transitions. [2022-12-14 15:35:14,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 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-12-14 15:35:14,702 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1920 transitions. [2022-12-14 15:35:14,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:35:14,703 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:35:14,703 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:35:14,708 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 15:35:14,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:35:14,905 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 15:35:14,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:35:14,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1448019791, now seen corresponding path program 2 times [2022-12-14 15:35:14,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:35:14,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877237234] [2022-12-14 15:35:14,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:35:14,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:35:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:35:15,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:35:15,496 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:35:15,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877237234] [2022-12-14 15:35:15,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877237234] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:35:15,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293401742] [2022-12-14 15:35:15,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 15:35:15,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:35:15,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:35:15,497 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:35:15,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 15:35:15,598 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 15:35:15,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:35:15,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 77 conjunts are in the unsatisfiable core [2022-12-14 15:35:15,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:35:15,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:15,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:15,624 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 15:35:15,624 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-12-14 15:35:15,639 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 15:35:15,639 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-12-14 15:35:15,717 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-12-14 15:35:15,811 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-12-14 15:35:15,898 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-12-14 15:35:16,016 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-12-14 15:35:16,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:16,089 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-12-14 15:35:16,239 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-12-14 15:35:16,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:35:16,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:35:16,723 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_860 Int) (v_ArrVal_858 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int) (v_ArrVal_856 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_856)) |c_~#stored_elements~0.base| v_ArrVal_858) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_856 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_860) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-12-14 15:35:16,738 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_860 Int) (v_ArrVal_858 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int) (v_ArrVal_856 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_856)) |c_~#stored_elements~0.base| v_ArrVal_858) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_856) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_860) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-12-14 15:35:16,755 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_855 (Array Int Int)) (v_ArrVal_860 Int) (v_ArrVal_858 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int) (v_ArrVal_856 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_855))) (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_856)) |c_~#stored_elements~0.base| v_ArrVal_858) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_860) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_856)))))) is different from false [2022-12-14 15:35:16,793 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_855 (Array Int Int)) (v_ArrVal_860 Int) (v_ArrVal_858 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int) (v_ArrVal_856 Int) (v_ArrVal_854 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_854)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_855))) (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_856)) |c_~#stored_elements~0.base| v_ArrVal_858) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_854 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse0 .cse1) 1) v_ArrVal_856) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_860) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse2 (+ |c_~#queue~0.offset| 1604))))))))) is different from false [2022-12-14 15:35:16,828 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_855 (Array Int Int)) (v_ArrVal_860 Int) (v_ArrVal_858 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int) (v_ArrVal_856 Int) (v_ArrVal_854 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_854)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_855))) (let ((.cse2 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_856)) |c_~#stored_elements~0.base| v_ArrVal_858) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_854) (< (+ (select .cse2 .cse3) 1) v_ArrVal_856) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_860) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse4 (+ |c_~#queue~0.offset| 1604)))))))))) is different from false [2022-12-14 15:35:16,860 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_852 Int) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_860 Int) (v_ArrVal_858 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int) (v_ArrVal_856 Int) (v_ArrVal_854 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_852)) (.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_854)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_855))) (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_856)) |c_~#stored_elements~0.base| v_ArrVal_858) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_860) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_854) (< (+ (select .cse3 .cse4) 1) v_ArrVal_856))))))) is different from false [2022-12-14 15:35:16,889 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_852 Int) (v_ArrVal_855 (Array Int Int)) (v_ArrVal_860 Int) (v_ArrVal_858 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| Int) (v_ArrVal_856 Int) (v_ArrVal_854 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| 4) |c_~#queue~0.offset|) v_ArrVal_852)) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse5 .cse4 v_ArrVal_854)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_855))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store .cse3 .cse1 v_ArrVal_856)) |c_~#stored_elements~0.base| v_ArrVal_858) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_109| (select .cse2 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_856) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_860) .cse4) 2147483647) (< (+ (select .cse5 .cse4) 1) v_ArrVal_854)))))))) is different from false [2022-12-14 15:35:16,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-14 15:35:16,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293401742] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:35:16,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [768668570] [2022-12-14 15:35:16,954 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-12-14 15:35:16,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:35:16,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-14 15:35:16,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049966297] [2022-12-14 15:35:16,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:35:16,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 15:35:16,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:35:16,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 15:35:16,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=556, Unknown=9, NotChecked=406, Total=1190 [2022-12-14 15:35:16,956 INFO L87 Difference]: Start difference. First operand 800 states and 1920 transitions. Second operand has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 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-12-14 15:35:20,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:35:20,579 INFO L93 Difference]: Finished difference Result 1168 states and 2770 transitions. [2022-12-14 15:35:20,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 15:35:20,579 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 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-12-14 15:35:20,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:35:20,581 INFO L225 Difference]: With dead ends: 1168 [2022-12-14 15:35:20,581 INFO L226 Difference]: Without dead ends: 1168 [2022-12-14 15:35:20,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 7 IntricatePredicates, 3 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=429, Invalid=996, Unknown=9, NotChecked=546, Total=1980 [2022-12-14 15:35:20,582 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 294 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 28 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 674 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:35:20,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 103 Invalid, 1404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 696 Invalid, 6 Unknown, 674 Unchecked, 0.7s Time] [2022-12-14 15:35:20,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2022-12-14 15:35:20,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 844. [2022-12-14 15:35:20,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 828 states have (on average 2.4456521739130435) internal successors, (2025), 843 states have internal predecessors, (2025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:35:20,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 2025 transitions. [2022-12-14 15:35:20,592 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 2025 transitions. Word has length 16 [2022-12-14 15:35:20,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:35:20,592 INFO L495 AbstractCegarLoop]: Abstraction has 844 states and 2025 transitions. [2022-12-14 15:35:20,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 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-12-14 15:35:20,592 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 2025 transitions. [2022-12-14 15:35:20,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:35:20,593 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:35:20,593 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:35:20,597 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 15:35:20,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 15:35:20,794 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 15:35:20,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:35:20,796 INFO L85 PathProgramCache]: Analyzing trace with hash -99715525, now seen corresponding path program 3 times [2022-12-14 15:35:20,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:35:20,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116923228] [2022-12-14 15:35:20,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:35:20,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:35:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:35:21,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:35:21,791 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:35:21,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116923228] [2022-12-14 15:35:21,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116923228] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:35:21,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605023845] [2022-12-14 15:35:21,791 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 15:35:21,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:35:21,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:35:21,792 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:35:21,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 15:35:21,876 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 15:35:21,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:35:21,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-14 15:35:21,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:35:21,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:21,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:21,906 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 15:35:21,906 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-12-14 15:35:21,923 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 15:35:21,923 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-12-14 15:35:22,039 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-12-14 15:35:22,162 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-12-14 15:35:22,342 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-12-14 15:35:22,421 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-12-14 15:35:22,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:35:22,497 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-12-14 15:35:22,643 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-12-14 15:35:22,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:35:22,793 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:35:22,966 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_960 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_960) |c_~#stored_elements~0.base| v_ArrVal_961) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_962) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-12-14 15:35:27,889 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_959 Int) (v_ArrVal_957 Int) (v_ArrVal_960 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse2 v_ArrVal_957) .cse1 v_ArrVal_959)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_960) |c_~#stored_elements~0.base| v_ArrVal_961) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_959) (< (+ (select .cse0 .cse2) 1) v_ArrVal_957) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_962) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse3 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-12-14 15:35:39,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 15:35:39,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605023845] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:35:39,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1347288734] [2022-12-14 15:35:39,616 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-12-14 15:35:39,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:35:39,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-14 15:35:39,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195545563] [2022-12-14 15:35:39,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:35:39,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 15:35:39,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:35:39,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 15:35:39,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=797, Unknown=33, NotChecked=126, Total=1190 [2022-12-14 15:35:39,618 INFO L87 Difference]: Start difference. First operand 844 states and 2025 transitions. Second operand has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 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-12-14 15:35:42,371 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse8 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse11 (+ (select .cse10 .cse9) 1)) (.cse6 (+ |c_~#queue~0.offset| 1604)) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (let ((.cse1 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (or (and (<= (select .cse0 1608) 1) (<= (select .cse0 1604) 401) (not .cse1)) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|))) (and (<= (select .cse2 1604) 1) .cse1 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 1604)) (<= (select .cse2 1608) 1) (not (= 1608 |c_ULTIMATE.start_main_~#id2~0#1.offset|)))))) (forall ((v_ArrVal_962 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_114| Int) (v_ArrVal_959 Int) (v_ArrVal_957 Int) (v_ArrVal_960 (Array Int Int)) (v_ArrVal_954 Int) (v_ArrVal_961 (Array Int Int))) (let ((.cse5 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_114| 4)) v_ArrVal_954))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_957) .cse6 v_ArrVal_959)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_960) |c_~#stored_elements~0.base| v_ArrVal_961) |c_~#queue~0.base|))) (or (< (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_962) .cse4) 2147483647) (< (+ (select .cse5 .cse6) 1) v_ArrVal_959) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_114| (select .cse0 .cse6))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse3 .cse6))) (< (+ (select .cse5 .cse4) 1) v_ArrVal_957))))) (exists ((v_ArrVal_962 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_111| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_112| Int) (v_ArrVal_959 Int) (v_ArrVal_957 Int) (v_ArrVal_954 Int)) (let ((.cse7 (store (store (store (store ((as const (Array Int Int)) 0) (+ 1600 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) 0) .cse9 0) .cse8 0) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_111| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_954))) (and (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_111| 0) (= (store (store (store .cse7 .cse8 v_ArrVal_957) .cse9 v_ArrVal_959) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_112| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_962) .cse10) (<= v_ArrVal_959 (+ (select .cse7 .cse9) 1)) (<= v_ArrVal_957 (+ (select .cse7 .cse8) 1)) (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_112| v_ArrVal_959)))) (= 5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_962 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_959 Int) (v_ArrVal_957 Int) (v_ArrVal_960 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (let ((.cse12 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse10 .cse8 v_ArrVal_957) .cse9 v_ArrVal_959)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_960) |c_~#stored_elements~0.base| v_ArrVal_961) |c_~#queue~0.base|))) (or (< .cse11 v_ArrVal_959) (< (+ (select .cse10 .cse8) 1) v_ArrVal_957) (< (select (store .cse12 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_962) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse12 .cse6)))))) (forall ((v_ArrVal_962 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_959 Int) (v_ArrVal_960 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse10 .cse9 v_ArrVal_959)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_960) |c_~#stored_elements~0.base| v_ArrVal_961) |c_~#queue~0.base|))) (or (< .cse11 v_ArrVal_959) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse13 .cse6))) (< (select (store .cse13 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_962) .cse4) 2147483647))))))) is different from false [2022-12-14 15:35:44,638 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-12-14 15:35:48,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:35:51,048 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-12-14 15:35:53,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 [1] [2022-12-14 15:35:53,957 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_962 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_959 Int) (v_ArrVal_960 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_959)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_960) |c_~#stored_elements~0.base| v_ArrVal_961) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_959 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse0 .cse1))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_962) .cse2) 2147483647)))) (forall ((v_ArrVal_962 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| Int) (v_ArrVal_959 Int) (v_ArrVal_960 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_959)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_960) |c_~#stored_elements~0.base| v_ArrVal_961) |c_~#queue~0.base|))) (or (< (+ (select .cse3 .cse4) 1) v_ArrVal_959) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| (select .cse5 .cse1))) (< (select (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_113| 4)) v_ArrVal_962) .cse2) 2147483647)))))) is different from false [2022-12-14 15:35:56,125 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-12-14 15:35:58,167 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-12-14 15:36:00,347 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-12-14 15:36:01,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:36:01,804 INFO L93 Difference]: Finished difference Result 1836 states and 4364 transitions. [2022-12-14 15:36:01,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-14 15:36:01,805 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 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-12-14 15:36:01,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:36:01,808 INFO L225 Difference]: With dead ends: 1836 [2022-12-14 15:36:01,809 INFO L226 Difference]: Without dead ends: 1836 [2022-12-14 15:36:01,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=553, Invalid=1587, Unknown=38, NotChecked=372, Total=2550 [2022-12-14 15:36:01,809 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 704 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 42 mSolverCounterUnsat, 87 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 2099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 87 IncrementalHoareTripleChecker+Unknown, 428 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:36:01,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 212 Invalid, 2099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1542 Invalid, 87 Unknown, 428 Unchecked, 20.5s Time] [2022-12-14 15:36:01,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1836 states. [2022-12-14 15:36:01,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1836 to 847. [2022-12-14 15:36:01,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 831 states have (on average 2.4560770156438028) internal successors, (2041), 846 states have internal predecessors, (2041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:36:01,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 2041 transitions. [2022-12-14 15:36:01,823 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 2041 transitions. Word has length 16 [2022-12-14 15:36:01,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:36:01,823 INFO L495 AbstractCegarLoop]: Abstraction has 847 states and 2041 transitions. [2022-12-14 15:36:01,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 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-12-14 15:36:01,823 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 2041 transitions. [2022-12-14 15:36:01,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:36:01,824 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:36:01,824 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:36:01,829 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-14 15:36:02,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 15:36:02,025 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 15:36:02,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:36:02,026 INFO L85 PathProgramCache]: Analyzing trace with hash -97710445, now seen corresponding path program 4 times [2022-12-14 15:36:02,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:36:02,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776642843] [2022-12-14 15:36:02,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:36:02,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:36:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:36:02,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:36:02,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:36:02,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776642843] [2022-12-14 15:36:02,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776642843] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:36:02,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170458777] [2022-12-14 15:36:02,832 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 15:36:02,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:36:02,832 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:36:02,833 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:36:02,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 15:36:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:36:02,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-14 15:36:02,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:36:02,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:02,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:02,948 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 15:36:02,948 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-12-14 15:36:02,965 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 15:36:02,965 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-12-14 15:36:03,048 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-12-14 15:36:03,148 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-12-14 15:36:03,304 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-12-14 15:36:03,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:03,385 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-12-14 15:36:03,522 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-12-14 15:36:03,676 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-12-14 15:36:03,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:36:03,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:36:04,055 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1061 Int) (v_ArrVal_1065 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| Int) (v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (let ((.cse0 (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_1061)) |c_~#stored_elements~0.base| v_ArrVal_1063))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1061 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1065)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1066) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| (select .cse1 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-12-14 15:36:04,191 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1061 Int) (v_ArrVal_1065 Int) (v_ArrVal_1059 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| Int) (v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1059) .cse1 v_ArrVal_1061)) |c_~#stored_elements~0.base| v_ArrVal_1063))) (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1059 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse0 .cse1) 1) v_ArrVal_1061) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1065)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1066) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| (select .cse3 (+ |c_~#queue~0.offset| 1604))))))))) is different from false [2022-12-14 15:36:05,415 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1061 Int) (v_ArrVal_1065 Int) (v_ArrVal_1057 Int) (v_ArrVal_1059 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| Int) (v_ArrVal_1066 (Array Int Int)) (v_ArrVal_1063 (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_1057)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_1059) .cse3 v_ArrVal_1061)) |c_~#stored_elements~0.base| v_ArrVal_1063))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1059) (< (+ (select .cse1 .cse3) 1) v_ArrVal_1061) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1065)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1066) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-12-14 15:36:13,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 15:36:13,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170458777] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:36:13,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [52523872] [2022-12-14 15:36:13,628 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-12-14 15:36:13,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:36:13,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-14 15:36:13,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89429239] [2022-12-14 15:36:13,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:36:13,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 15:36:13,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:36:13,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 15:36:13,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=749, Unknown=28, NotChecked=186, Total=1190 [2022-12-14 15:36:13,634 INFO L87 Difference]: Start difference. First operand 847 states and 2041 transitions. Second operand has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 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-12-14 15:36:28,037 WARN L233 SmtUtils]: Spent 6.20s on a formula simplification. DAG size of input: 170 DAG size of output: 105 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:36:30,374 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-12-14 15:36:32,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:36:34,163 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-12-14 15:36:35,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:36:36,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:36:38,657 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1065 Int) (v_ArrVal_1066 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (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_1065)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1066) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647)) (forall ((v_ArrVal_1065 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| Int) (v_ArrVal_1066 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1065)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1066) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| (select .cse0 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-12-14 15:36:39,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:36:39,962 INFO L93 Difference]: Finished difference Result 1436 states and 3423 transitions. [2022-12-14 15:36:39,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 15:36:39,962 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 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-12-14 15:36:39,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:36:39,965 INFO L225 Difference]: With dead ends: 1436 [2022-12-14 15:36:39,965 INFO L226 Difference]: Without dead ends: 1436 [2022-12-14 15:36:39,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=514, Invalid=1364, Unknown=30, NotChecked=348, Total=2256 [2022-12-14 15:36:39,965 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 425 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 63 mSolverCounterUnsat, 165 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 1853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 165 IncrementalHoareTripleChecker+Unknown, 404 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:36:39,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 158 Invalid, 1853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1221 Invalid, 165 Unknown, 404 Unchecked, 12.5s Time] [2022-12-14 15:36:39,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2022-12-14 15:36:39,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 865. [2022-12-14 15:36:39,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 849 states have (on average 2.5064782096584217) internal successors, (2128), 864 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:36:39,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 2128 transitions. [2022-12-14 15:36:39,981 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 2128 transitions. Word has length 16 [2022-12-14 15:36:39,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:36:39,981 INFO L495 AbstractCegarLoop]: Abstraction has 865 states and 2128 transitions. [2022-12-14 15:36:39,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 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-12-14 15:36:39,981 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 2128 transitions. [2022-12-14 15:36:39,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 15:36:39,982 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:36:39,982 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:36:39,987 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 15:36:40,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:36:40,184 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 15:36:40,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:36:40,185 INFO L85 PathProgramCache]: Analyzing trace with hash 583735446, now seen corresponding path program 1 times [2022-12-14 15:36:40,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:36:40,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362924436] [2022-12-14 15:36:40,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:36:40,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:36:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:36:40,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:36:40,462 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:36:40,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362924436] [2022-12-14 15:36:40,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362924436] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:36:40,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621868626] [2022-12-14 15:36:40,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:36:40,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:36:40,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:36:40,463 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:36:40,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 15:36:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:36:40,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-14 15:36:40,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:36:40,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:40,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:40,605 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 15:36:40,606 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-12-14 15:36:40,615 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 15:36:40,615 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-12-14 15:36:40,687 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-12-14 15:36:40,743 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-12-14 15:36:40,857 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-12-14 15:36:40,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:40,904 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-12-14 15:36:40,999 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-12-14 15:36:41,076 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 88 treesize of output 83 [2022-12-14 15:36:41,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:36:41,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:36:41,221 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_123| Int) (v_ArrVal_1165 Int) (v_ArrVal_1164 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1164) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_123| (select .cse0 .cse1))) (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_123| 4) |c_~#queue~0.offset|) v_ArrVal_1165) .cse1)))))) is different from false [2022-12-14 15:36:41,291 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_123| Int) (v_ArrVal_1165 Int) (v_ArrVal_1164 (Array Int Int))) (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_1164) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_123| 4) |c_~#queue~0.offset|) v_ArrVal_1165) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_123| (select .cse0 .cse1)))))) is different from false [2022-12-14 15:36:41,312 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1161 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_123| Int) (v_ArrVal_1165 Int) (v_ArrVal_1164 (Array Int Int))) (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 (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1161) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1164) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_123| 4) |c_~#queue~0.offset|) v_ArrVal_1165) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_123| (select .cse0 .cse1)))))) is different from false [2022-12-14 15:36:41,336 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1161 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_123| Int) (v_ArrVal_1165 Int) (v_ArrVal_1158 Int) (v_ArrVal_1164 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (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_1158)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1161) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1164) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_123| 4) |c_~#queue~0.offset|) v_ArrVal_1165) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_123| (select .cse0 .cse1)))))) is different from false [2022-12-14 15:36:41,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-12-14 15:36:41,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621868626] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:36:41,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1977648135] [2022-12-14 15:36:41,445 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-12-14 15:36:41,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:36:41,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 24 [2022-12-14 15:36:41,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393091144] [2022-12-14 15:36:41,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:36:41,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 15:36:41,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:36:41,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 15:36:41,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=358, Unknown=8, NotChecked=172, Total=650 [2022-12-14 15:36:41,446 INFO L87 Difference]: Start difference. First operand 865 states and 2128 transitions. Second operand has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:36:44,201 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-12-14 15:36:48,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:36:48,099 INFO L93 Difference]: Finished difference Result 2028 states and 4955 transitions. [2022-12-14 15:36:48,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 15:36:48,100 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-14 15:36:48,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:36:48,104 INFO L225 Difference]: With dead ends: 2028 [2022-12-14 15:36:48,104 INFO L226 Difference]: Without dead ends: 2028 [2022-12-14 15:36:48,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 16 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=355, Invalid=984, Unknown=9, NotChecked=292, Total=1640 [2022-12-14 15:36:48,105 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 304 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 47 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1469 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 507 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:36:48,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 161 Invalid, 2045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1469 Invalid, 22 Unknown, 507 Unchecked, 4.4s Time] [2022-12-14 15:36:48,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2028 states. [2022-12-14 15:36:48,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2028 to 1375. [2022-12-14 15:36:48,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 1359 states have (on average 2.554819720382634) internal successors, (3472), 1374 states have internal predecessors, (3472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:36:48,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 3472 transitions. [2022-12-14 15:36:48,125 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 3472 transitions. Word has length 18 [2022-12-14 15:36:48,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:36:48,125 INFO L495 AbstractCegarLoop]: Abstraction has 1375 states and 3472 transitions. [2022-12-14 15:36:48,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:36:48,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 3472 transitions. [2022-12-14 15:36:48,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 15:36:48,126 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:36:48,126 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:36:48,131 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 15:36:48,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:36:48,327 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 15:36:48,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:36:48,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1488521269, now seen corresponding path program 1 times [2022-12-14 15:36:48,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:36:48,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003957860] [2022-12-14 15:36:48,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:36:48,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:36:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:36:48,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:36:48,782 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:36:48,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003957860] [2022-12-14 15:36:48,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003957860] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:36:48,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045230924] [2022-12-14 15:36:48,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:36:48,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:36:48,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:36:48,783 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:36:48,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 15:36:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:36:48,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-14 15:36:48,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:36:48,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:48,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:48,897 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 15:36:48,898 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-12-14 15:36:48,910 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 15:36:48,910 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-12-14 15:36:49,000 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-12-14 15:36:49,070 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-12-14 15:36:49,214 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-12-14 15:36:49,269 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-12-14 15:36:49,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:36:49,314 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-12-14 15:36:49,408 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-12-14 15:36:49,482 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 88 treesize of output 83 [2022-12-14 15:36:49,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:36:49,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:36:49,681 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1275 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_128| Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1272) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_1275) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_128| (select .cse0 .cse1)))))) is different from false [2022-12-14 15:36:49,693 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1275 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_128| Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (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) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1272) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< 0 (+ (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_1275) .cse1) 2147483650)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_128| (select .cse0 .cse1)))))) is different from false [2022-12-14 15:36:49,705 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1275 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_128| Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (Array Int Int))) (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_1272) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_1275) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_128| (select .cse0 .cse1)))))) is different from false [2022-12-14 15:36:49,733 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1275 Int) (v_ArrVal_1268 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_128| Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (Array Int Int))) (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 (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1268) .cse3 (+ (select .cse2 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1272) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_1275) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_128| (select .cse0 .cse1)))))) is different from false [2022-12-14 15:36:49,763 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1275 Int) (v_ArrVal_1268 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_128| Int) (v_ArrVal_1267 Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (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_1267)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1268) .cse3 (+ (select .cse2 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1272) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< 0 (+ (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_1275) .cse1) 2147483650)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_128| (select .cse0 .cse1)))))) is different from false [2022-12-14 15:36:49,866 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-12-14 15:36:49,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045230924] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:36:49,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1880385589] [2022-12-14 15:36:49,866 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-12-14 15:36:49,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:36:49,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2022-12-14 15:36:49,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158046924] [2022-12-14 15:36:49,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:36:49,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 15:36:49,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:36:49,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 15:36:49,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=516, Unknown=10, NotChecked=260, Total=930 [2022-12-14 15:36:49,868 INFO L87 Difference]: Start difference. First operand 1375 states and 3472 transitions. Second operand has 31 states, 30 states have (on average 1.9) internal successors, (57), 30 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:36:58,536 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (and (< 0 (+ (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 2147483650)) (forall ((v_ArrVal_1275 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_128| Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1272) |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_1275) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_128| (select .cse0 .cse1)))))) (forall ((v_ArrVal_1275 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_128| Int) (v_ArrVal_1273 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1273) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_128| (select .cse2 .cse1))) (< 0 (+ 2147483650 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_128| 4) |c_~#queue~0.offset|) v_ArrVal_1275) .cse1)))))))) is different from false [2022-12-14 15:36:59,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:36:59,822 INFO L93 Difference]: Finished difference Result 2626 states and 6526 transitions. [2022-12-14 15:36:59,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 15:36:59,822 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 30 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 15:36:59,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:36:59,827 INFO L225 Difference]: With dead ends: 2626 [2022-12-14 15:36:59,827 INFO L226 Difference]: Without dead ends: 2626 [2022-12-14 15:36:59,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=268, Invalid=933, Unknown=13, NotChecked=426, Total=1640 [2022-12-14 15:36:59,828 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 344 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 42 mSolverCounterUnsat, 48 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 2385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 48 IncrementalHoareTripleChecker+Unknown, 940 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-12-14 15:36:59,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 147 Invalid, 2385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1355 Invalid, 48 Unknown, 940 Unchecked, 2.8s Time] [2022-12-14 15:36:59,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states. [2022-12-14 15:36:59,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 1342. [2022-12-14 15:36:59,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1342 states, 1326 states have (on average 2.558069381598793) internal successors, (3392), 1341 states have internal predecessors, (3392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:36:59,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 3392 transitions. [2022-12-14 15:36:59,850 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 3392 transitions. Word has length 19 [2022-12-14 15:36:59,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:36:59,850 INFO L495 AbstractCegarLoop]: Abstraction has 1342 states and 3392 transitions. [2022-12-14 15:36:59,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 30 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:36:59,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 3392 transitions. [2022-12-14 15:36:59,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 15:36:59,851 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:36:59,851 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:36:59,856 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 15:37:00,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-14 15:37:00,051 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 15:37:00,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:37:00,052 INFO L85 PathProgramCache]: Analyzing trace with hash 918040055, now seen corresponding path program 2 times [2022-12-14 15:37:00,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:37:00,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875267119] [2022-12-14 15:37:00,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:37:00,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:37:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:37:00,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:37:00,435 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:37:00,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875267119] [2022-12-14 15:37:00,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875267119] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:37:00,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083100093] [2022-12-14 15:37:00,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 15:37:00,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:37:00,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:37:00,436 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:37:00,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 15:37:00,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 15:37:00,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:37:00,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-14 15:37:00,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:37:00,615 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-12-14 15:37:00,615 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 29 treesize of output 39 [2022-12-14 15:37:00,708 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-12-14 15:37:00,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:00,736 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-12-14 15:37:00,796 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 15:37:00,797 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-12-14 15:37:00,848 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-12-14 15:37:00,868 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-12-14 15:37:00,872 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:37:00,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:37:00,925 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_1364 Int) (v_ArrVal_1366 (Array Int Int))) (or (< 0 (+ (select (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| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_1364)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1366) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 2147483650)) (not (<= |c_t1Thread1of1ForFork1_enqueue_~x#1| v_ArrVal_1364)))) is different from false [2022-12-14 15:37:00,936 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_1364 Int) (v_ArrVal_1366 (Array Int Int))) (or (< (+ v_ArrVal_1364 2147483648) 0) (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (select |c_#memory_int| |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_1364)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1366) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)))))) is different from false [2022-12-14 15:37:00,946 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_1364 Int) (v_ArrVal_1366 (Array Int Int)) (v_ArrVal_1363 (Array Int Int))) (or (< 0 (+ 2147483650 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1363))) (store .cse0 |c_~#queue~0.base| (store (select .cse0 |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_1364))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1366) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 1604)))) (< (+ v_ArrVal_1364 2147483648) 0))) is different from false [2022-12-14 15:37:00,955 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:37:00,955 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 52 treesize of output 43 [2022-12-14 15:37:00,962 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:37:00,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 93 treesize of output 97 [2022-12-14 15:37:00,968 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 51 treesize of output 47 [2022-12-14 15:37:00,973 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 88 treesize of output 80 [2022-12-14 15:37:00,992 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-12-14 15:37:01,004 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:37:01,005 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 62 treesize of output 62 [2022-12-14 15:37:01,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 15:37:01,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083100093] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:37:01,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [808977708] [2022-12-14 15:37:01,166 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-12-14 15:37:01,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:37:01,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2022-12-14 15:37:01,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621097366] [2022-12-14 15:37:01,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:37:01,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 15:37:01,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:37:01,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 15:37:01,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=352, Unknown=8, NotChecked=120, Total=552 [2022-12-14 15:37:01,168 INFO L87 Difference]: Start difference. First operand 1342 states and 3392 transitions. Second operand has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:37:01,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:37:01,564 INFO L93 Difference]: Finished difference Result 1427 states and 3557 transitions. [2022-12-14 15:37:01,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:37:01,564 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 15:37:01,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:37:01,566 INFO L225 Difference]: With dead ends: 1427 [2022-12-14 15:37:01,567 INFO L226 Difference]: Without dead ends: 1427 [2022-12-14 15:37:01,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=444, Unknown=8, NotChecked=138, Total=702 [2022-12-14 15:37:01,567 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 340 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 228 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:37:01,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 31 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 342 Invalid, 0 Unknown, 228 Unchecked, 0.2s Time] [2022-12-14 15:37:01,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2022-12-14 15:37:01,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1147. [2022-12-14 15:37:01,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1147 states, 1133 states have (on average 2.5251544571932922) internal successors, (2861), 1146 states have internal predecessors, (2861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:37:01,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 2861 transitions. [2022-12-14 15:37:01,582 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 2861 transitions. Word has length 19 [2022-12-14 15:37:01,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:37:01,582 INFO L495 AbstractCegarLoop]: Abstraction has 1147 states and 2861 transitions. [2022-12-14 15:37:01,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 23 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:37:01,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 2861 transitions. [2022-12-14 15:37:01,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 15:37:01,583 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:37:01,583 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 15:37:01,588 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 15:37:01,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:37:01,784 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 15:37:01,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:37:01,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1671032351, now seen corresponding path program 1 times [2022-12-14 15:37:01,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:37:01,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19799579] [2022-12-14 15:37:01,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:37:01,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:37:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:37:01,862 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:37:01,862 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:37:01,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19799579] [2022-12-14 15:37:01,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19799579] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:37:01,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123126601] [2022-12-14 15:37:01,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:37:01,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:37:01,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:37:01,864 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:37:01,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 15:37:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:37:01,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 15:37:01,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:37:01,976 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:37:01,976 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:37:01,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123126601] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:37:01,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 15:37:01,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-14 15:37:01,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267574181] [2022-12-14 15:37:01,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:37:01,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:37:01,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:37:01,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:37:01,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:37:01,977 INFO L87 Difference]: Start difference. First operand 1147 states and 2861 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:37:02,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:37:02,055 INFO L93 Difference]: Finished difference Result 1135 states and 2779 transitions. [2022-12-14 15:37:02,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:37:02,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 15:37:02,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:37:02,057 INFO L225 Difference]: With dead ends: 1135 [2022-12-14 15:37:02,057 INFO L226 Difference]: Without dead ends: 1135 [2022-12-14 15:37:02,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:37:02,057 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 46 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:37:02,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 9 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:37:02,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2022-12-14 15:37:02,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1135. [2022-12-14 15:37:02,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 1123 states have (on average 2.4746215494211934) internal successors, (2779), 1134 states have internal predecessors, (2779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:37:02,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 2779 transitions. [2022-12-14 15:37:02,069 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 2779 transitions. Word has length 20 [2022-12-14 15:37:02,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:37:02,069 INFO L495 AbstractCegarLoop]: Abstraction has 1135 states and 2779 transitions. [2022-12-14 15:37:02,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:37:02,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 2779 transitions. [2022-12-14 15:37:02,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 15:37:02,070 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:37:02,070 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 15:37:02,074 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 15:37:02,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:37:02,272 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 15:37:02,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:37:02,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1671032350, now seen corresponding path program 1 times [2022-12-14 15:37:02,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:37:02,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268444095] [2022-12-14 15:37:02,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:37:02,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:37:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:37:02,336 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:37:02,336 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:37:02,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268444095] [2022-12-14 15:37:02,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268444095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:37:02,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:37:02,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:37:02,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296137283] [2022-12-14 15:37:02,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:37:02,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:37:02,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:37:02,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:37:02,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:37:02,337 INFO L87 Difference]: Start difference. First operand 1135 states and 2779 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:37:02,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:37:02,397 INFO L93 Difference]: Finished difference Result 1123 states and 2697 transitions. [2022-12-14 15:37:02,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:37:02,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 15:37:02,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:37:02,399 INFO L225 Difference]: With dead ends: 1123 [2022-12-14 15:37:02,399 INFO L226 Difference]: Without dead ends: 1123 [2022-12-14 15:37:02,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:37:02,399 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 11 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:37:02,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 9 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:37:02,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2022-12-14 15:37:02,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1123. [2022-12-14 15:37:02,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 1113 states have (on average 2.4231805929919137) internal successors, (2697), 1122 states have internal predecessors, (2697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:37:02,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 2697 transitions. [2022-12-14 15:37:02,411 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 2697 transitions. Word has length 20 [2022-12-14 15:37:02,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:37:02,411 INFO L495 AbstractCegarLoop]: Abstraction has 1123 states and 2697 transitions. [2022-12-14 15:37:02,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:37:02,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 2697 transitions. [2022-12-14 15:37:02,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 15:37:02,412 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:37:02,412 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] [2022-12-14 15:37:02,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-14 15:37:02,413 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 15:37:02,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:37:02,413 INFO L85 PathProgramCache]: Analyzing trace with hash 329226065, now seen corresponding path program 1 times [2022-12-14 15:37:02,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:37:02,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716964808] [2022-12-14 15:37:02,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:37:02,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:37:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:37:02,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:37:02,452 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:37:02,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716964808] [2022-12-14 15:37:02,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716964808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:37:02,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:37:02,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:37:02,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850781470] [2022-12-14 15:37:02,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:37:02,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:37:02,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:37:02,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:37:02,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:37:02,453 INFO L87 Difference]: Start difference. First operand 1123 states and 2697 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:37:02,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:37:02,502 INFO L93 Difference]: Finished difference Result 681 states and 1385 transitions. [2022-12-14 15:37:02,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:37:02,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 15:37:02,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:37:02,504 INFO L225 Difference]: With dead ends: 681 [2022-12-14 15:37:02,504 INFO L226 Difference]: Without dead ends: 679 [2022-12-14 15:37:02,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:37:02,504 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:37:02,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 2 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:37:02,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2022-12-14 15:37:02,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 663. [2022-12-14 15:37:02,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 653 states have (on average 2.088820826952527) internal successors, (1364), 662 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:37:02,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1364 transitions. [2022-12-14 15:37:02,511 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1364 transitions. Word has length 23 [2022-12-14 15:37:02,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:37:02,511 INFO L495 AbstractCegarLoop]: Abstraction has 663 states and 1364 transitions. [2022-12-14 15:37:02,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:37:02,512 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1364 transitions. [2022-12-14 15:37:02,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:37:02,512 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:37:02,512 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-12-14 15:37:02,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-14 15:37:02,512 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 15:37:02,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:37:02,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1692750139, now seen corresponding path program 1 times [2022-12-14 15:37:02,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:37:02,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799361991] [2022-12-14 15:37:02,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:37:02,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:37:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:37:02,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:37:02,546 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:37:02,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799361991] [2022-12-14 15:37:02,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799361991] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:37:02,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344342916] [2022-12-14 15:37:02,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:37:02,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:37:02,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:37:02,547 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:37:02,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 15:37:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:37:02,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 15:37:02,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:37:02,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:37:02,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:37:02,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:37:02,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344342916] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:37:02,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1571534830] [2022-12-14 15:37:02,703 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-12-14 15:37:02,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:37:02,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-14 15:37:02,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38229269] [2022-12-14 15:37:02,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:37:02,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 15:37:02,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:37:02,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 15:37:02,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:37:02,705 INFO L87 Difference]: Start difference. First operand 663 states and 1364 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 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-12-14 15:37:02,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:37:02,816 INFO L93 Difference]: Finished difference Result 812 states and 1621 transitions. [2022-12-14 15:37:02,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:37:02,816 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 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-12-14 15:37:02,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:37:02,817 INFO L225 Difference]: With dead ends: 812 [2022-12-14 15:37:02,817 INFO L226 Difference]: Without dead ends: 812 [2022-12-14 15:37:02,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:37:02,818 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 42 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:37:02,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 16 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:37:02,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-12-14 15:37:02,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 748. [2022-12-14 15:37:02,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 738 states have (on average 2.0365853658536586) internal successors, (1503), 747 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:37:02,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1503 transitions. [2022-12-14 15:37:02,826 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1503 transitions. Word has length 24 [2022-12-14 15:37:02,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:37:02,826 INFO L495 AbstractCegarLoop]: Abstraction has 748 states and 1503 transitions. [2022-12-14 15:37:02,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 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-12-14 15:37:02,826 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1503 transitions. [2022-12-14 15:37:02,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:37:02,826 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:37:02,826 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 15:37:02,831 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 15:37:03,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-14 15:37:03,028 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 15:37:03,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:37:03,029 INFO L85 PathProgramCache]: Analyzing trace with hash 496903130, now seen corresponding path program 5 times [2022-12-14 15:37:03,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:37:03,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687539205] [2022-12-14 15:37:03,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:37:03,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:37:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:37:04,014 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:37:04,015 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:37:04,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687539205] [2022-12-14 15:37:04,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687539205] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:37:04,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743124665] [2022-12-14 15:37:04,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 15:37:04,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:37:04,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:37:04,016 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:37:04,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 15:37:04,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 15:37:04,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:37:04,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 96 conjunts are in the unsatisfiable core [2022-12-14 15:37:04,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:37:04,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:04,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:04,360 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 15:37:04,361 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-12-14 15:37:04,375 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 15:37:04,375 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-12-14 15:37:04,468 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-12-14 15:37:04,584 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-12-14 15:37:04,747 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-12-14 15:37:04,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:04,836 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-12-14 15:37:04,981 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-12-14 15:37:05,292 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 61 treesize of output 61 [2022-12-14 15:37:05,428 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-12-14 15:37:06,148 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-12-14 15:37:06,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:37:06,758 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-12-14 15:37:07,247 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-12-14 15:37:21,440 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:37:21,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:37:21,556 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1742 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| Int) (v_ArrVal_1744 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1742) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| 4) |c_~#queue~0.offset|) v_ArrVal_1744) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-12-14 15:37:21,593 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1742 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| Int) (v_ArrVal_1740 Int) (v_ArrVal_1744 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_1740)) |c_~#stored_elements~0.base| v_ArrVal_1742) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1740 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| 4) |c_~#queue~0.offset|) v_ArrVal_1744) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-12-14 15:37:21,610 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1742 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| Int) (v_ArrVal_1740 Int) (v_ArrVal_1744 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_1740)) |c_~#stored_elements~0.base| v_ArrVal_1742) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1740) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| 4) |c_~#queue~0.offset|) v_ArrVal_1744) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| (select .cse2 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-12-14 15:37:21,653 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1738 Int) (v_ArrVal_1742 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| Int) (v_ArrVal_1740 Int) (v_ArrVal_1744 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_1738) .cse1 v_ArrVal_1740)) |c_~#stored_elements~0.base| v_ArrVal_1742) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1740) (not (<= v_ArrVal_1738 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| 4) |c_~#queue~0.offset|) v_ArrVal_1744) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| (select .cse2 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-12-14 15:37:21,678 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1738 Int) (v_ArrVal_1742 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| Int) (v_ArrVal_1740 Int) (v_ArrVal_1744 Int) (v_ArrVal_1737 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1737))) (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 (store .cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1738) .cse2 v_ArrVal_1740)) |c_~#stored_elements~0.base| v_ArrVal_1742) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| 4) |c_~#queue~0.offset|) v_ArrVal_1744) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_1738 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1740)))))) is different from false [2022-12-14 15:37:21,706 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1738 Int) (v_ArrVal_1742 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| Int) (v_ArrVal_1740 Int) (v_ArrVal_1744 Int) (v_ArrVal_1737 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1737))) (let ((.cse2 (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse1 v_ArrVal_1738) .cse3 v_ArrVal_1740)) |c_~#stored_elements~0.base| v_ArrVal_1742) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| 4) |c_~#queue~0.offset|) v_ArrVal_1744) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1) 1) v_ArrVal_1738) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1740)))))) is different from false [2022-12-14 15:37:21,738 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1738 Int) (v_ArrVal_1742 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| Int) (v_ArrVal_1740 Int) (v_ArrVal_1744 Int) (v_ArrVal_1736 Int) (v_ArrVal_1737 (Array Int 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_1736))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| .cse3) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1737))) (let ((.cse1 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse4 v_ArrVal_1738) .cse2 v_ArrVal_1740)) |c_~#stored_elements~0.base| v_ArrVal_1742) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1740) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1738) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| 4) |c_~#queue~0.offset|) v_ArrVal_1744) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2022-12-14 15:37:21,764 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1738 Int) (v_ArrVal_1742 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| Int) (v_ArrVal_1740 Int) (v_ArrVal_1744 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| Int) (v_ArrVal_1736 Int) (v_ArrVal_1737 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| 4) |c_~#queue~0.offset|) v_ArrVal_1736))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| .cse4) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1737))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1738) .cse3 v_ArrVal_1740)) |c_~#stored_elements~0.base| v_ArrVal_1742) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| 4) |c_~#queue~0.offset|) v_ArrVal_1744) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| (select .cse2 .cse3))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1738) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| (select .cse0 .cse3))) (< (+ (select .cse5 .cse3) 1) v_ArrVal_1740)))))))) is different from false [2022-12-14 15:37:21,791 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1738 Int) (v_ArrVal_1734 (Array Int Int)) (v_ArrVal_1742 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| Int) (v_ArrVal_1740 Int) (v_ArrVal_1744 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| Int) (v_ArrVal_1736 Int) (v_ArrVal_1737 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1734))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| 4) |c_~#queue~0.offset|) v_ArrVal_1736))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| .cse5) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1737))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1738) .cse3 v_ArrVal_1740)) |c_~#stored_elements~0.base| v_ArrVal_1742) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| 4) |c_~#queue~0.offset|) v_ArrVal_1744) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1740) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| (select .cse4 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| (select .cse0 .cse3))) (< (+ 1 (select .cse5 .cse1)) v_ArrVal_1738))))))))) is different from false [2022-12-14 15:37:21,827 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1738 Int) (v_ArrVal_1734 (Array Int Int)) (v_ArrVal_1742 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| Int) (v_ArrVal_1740 Int) (v_ArrVal_1733 Int) (v_ArrVal_1744 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| Int) (v_ArrVal_1736 Int) (v_ArrVal_1737 (Array Int Int))) (let ((.cse7 (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_1733)) |c_~#stored_elements~0.base| v_ArrVal_1734))) (let ((.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| 4) |c_~#queue~0.offset|) v_ArrVal_1736))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| .cse2) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1737))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse3 v_ArrVal_1738) .cse1 v_ArrVal_1740)) |c_~#stored_elements~0.base| v_ArrVal_1742) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1733 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1738) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| (select .cse4 .cse1))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1740) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| 4) |c_~#queue~0.offset|) v_ArrVal_1744) .cse3) 2147483647))))))))) is different from false [2022-12-14 15:37:21,866 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1738 Int) (v_ArrVal_1734 (Array Int Int)) (v_ArrVal_1742 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| Int) (v_ArrVal_1740 Int) (v_ArrVal_1733 Int) (v_ArrVal_1744 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| Int) (v_ArrVal_1736 Int) (v_ArrVal_1737 (Array Int Int))) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_1733)) |c_~#stored_elements~0.base| v_ArrVal_1734))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| 4) |c_~#queue~0.offset|) v_ArrVal_1736))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| .cse2) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1737))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse5 .cse3 v_ArrVal_1738) .cse1 v_ArrVal_1740)) |c_~#stored_elements~0.base| v_ArrVal_1742) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1738) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| (select .cse4 .cse1))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1740) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| 4) |c_~#queue~0.offset|) v_ArrVal_1744) .cse3) 2147483647) (< (+ (select .cse6 .cse7) 1) v_ArrVal_1733)))))))))) is different from false [2022-12-14 15:37:21,948 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1738 Int) (v_ArrVal_1734 (Array Int Int)) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1730 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| Int) (v_ArrVal_1740 Int) (v_ArrVal_1733 Int) (v_ArrVal_1744 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| Int) (v_ArrVal_1736 Int) (v_ArrVal_1737 (Array Int Int))) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1730) .cse7 v_ArrVal_1733)) |c_~#stored_elements~0.base| v_ArrVal_1734))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| 4) |c_~#queue~0.offset|) v_ArrVal_1736))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| .cse0) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1737))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1738) .cse3 v_ArrVal_1740)) |c_~#stored_elements~0.base| v_ArrVal_1742) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1738) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| (select .cse2 .cse3))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| 4) |c_~#queue~0.offset|) v_ArrVal_1744) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| (select .cse4 .cse3))) (not (<= v_ArrVal_1730 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse5 .cse3) 1) v_ArrVal_1740) (< (+ (select .cse6 .cse7) 1) v_ArrVal_1733)))))))))) is different from false [2022-12-14 15:37:22,004 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1738 Int) (v_ArrVal_1734 (Array Int Int)) (v_ArrVal_1742 (Array Int Int)) (v_ArrVal_1730 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| Int) (v_ArrVal_1740 Int) (v_ArrVal_1733 Int) (v_ArrVal_1744 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| Int) (v_ArrVal_1736 Int) (v_ArrVal_1737 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1730) .cse8 v_ArrVal_1733)) |c_~#stored_elements~0.base| v_ArrVal_1734))) (let ((.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| 4) |c_~#queue~0.offset|) v_ArrVal_1736))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| .cse0) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1737))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse7 .cse1 v_ArrVal_1738) .cse3 v_ArrVal_1740)) |c_~#stored_elements~0.base| v_ArrVal_1742) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1738) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| (select .cse2 .cse3))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| 4) |c_~#queue~0.offset|) v_ArrVal_1744) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| (select .cse4 .cse3))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1730) (< (+ (select .cse7 .cse3) 1) v_ArrVal_1740) (< (+ (select .cse5 .cse8) 1) v_ArrVal_1733)))))))))) is different from false [2022-12-14 15:37:22,059 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1738 Int) (v_ArrVal_1734 (Array Int Int)) (v_ArrVal_1728 Int) (v_ArrVal_1742 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| Int) (v_ArrVal_1730 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| Int) (v_ArrVal_1740 Int) (v_ArrVal_1733 Int) (v_ArrVal_1744 Int) (v_ArrVal_1736 Int) (v_ArrVal_1737 (Array Int Int))) (let ((.cse4 (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_1728)) (.cse5 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 .cse5 v_ArrVal_1730) .cse7 v_ArrVal_1733)) |c_~#stored_elements~0.base| v_ArrVal_1734))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse0 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| 4) |c_~#queue~0.offset|) v_ArrVal_1736))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| .cse0) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1737))) (let ((.cse2 (select .cse9 |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1738) .cse3 v_ArrVal_1740)) |c_~#stored_elements~0.base| v_ArrVal_1742) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1738) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1740) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1730) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| (select .cse6 .cse3))) (< (+ (select .cse4 .cse7) 1) v_ArrVal_1733) (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_139| 4) |c_~#queue~0.offset|) v_ArrVal_1744) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| (select .cse8 .cse3)))))))))))) is different from false [2022-12-14 15:37:24,494 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-12-14 15:37:24,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743124665] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:37:24,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [672080014] [2022-12-14 15:37:24,494 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-12-14 15:37:24,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:37:24,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 52 [2022-12-14 15:37:24,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883155850] [2022-12-14 15:37:24,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:37:24,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-12-14 15:37:24,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:37:24,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-12-14 15:37:24,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=1202, Unknown=22, NotChecked=1246, Total=2862 [2022-12-14 15:37:24,496 INFO L87 Difference]: Start difference. First operand 748 states and 1503 transitions. Second operand has 54 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:37:27,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:37:29,646 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-12-14 15:37:41,404 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-12-14 15:37:57,199 WARN L233 SmtUtils]: Spent 8.42s on a formula simplification. DAG size of input: 166 DAG size of output: 130 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:37:59,268 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-12-14 15:38:04,287 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-12-14 15:38:09,241 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-12-14 15:38:11,251 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-12-14 15:38:14,025 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-12-14 15:38:33,046 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-12-14 15:38:35,052 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-12-14 15:38:37,061 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-12-14 15:38:39,069 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-12-14 15:38:41,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-12-14 15:38:43,261 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-12-14 15:38:45,542 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-12-14 15:38:47,549 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-12-14 15:38:49,554 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-12-14 15:38:51,566 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-12-14 15:38:53,575 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-12-14 15:38:55,582 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-12-14 15:38:57,588 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-12-14 15:38:59,596 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-12-14 15:39:01,648 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-12-14 15:39:09,908 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-12-14 15:39:11,920 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-12-14 15:39:49,302 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-12-14 15:39:51,310 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-12-14 15:39:53,316 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-12-14 15:39:55,326 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-12-14 15:39:57,337 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-12-14 15:39:59,963 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-12-14 15:40:01,968 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-12-14 15:40:03,974 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-12-14 15:40:05,984 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-12-14 15:40:07,990 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-12-14 15:40:09,996 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-12-14 15:40:20,591 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-12-14 15:40:22,602 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-12-14 15:41:06,057 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-12-14 15:41:08,065 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-12-14 15:41:14,010 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-12-14 15:41:16,017 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-12-14 15:41:18,023 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-12-14 15:41:20,029 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-12-14 15:41:22,071 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-12-14 15:41:57,315 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-12-14 15:42:31,303 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-12-14 15:42:32,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:42:34,921 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-12-14 15:42:36,929 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-12-14 15:43:01,424 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-12-14 15:43:03,434 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-12-14 15:43:05,779 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-12-14 15:43:07,842 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-12-14 15:43:13,808 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-12-14 15:43:15,832 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-12-14 15:43:17,837 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-12-14 15:43:19,850 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-12-14 15:43:45,078 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-12-14 15:44:11,434 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-12-14 15:44:24,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, 1] [2022-12-14 15:44:26,309 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-12-14 15:44:28,366 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-12-14 15:44:45,776 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-12-14 15:44:48,080 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-12-14 15:44:50,115 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-12-14 15:44:52,165 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-12-14 15:44:52,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:44:52,609 INFO L93 Difference]: Finished difference Result 950 states and 1830 transitions. [2022-12-14 15:44:52,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-14 15:44:52,610 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 0 states have call successors, (0), 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-12-14 15:44:52,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:44:52,611 INFO L225 Difference]: With dead ends: 950 [2022-12-14 15:44:52,611 INFO L226 Difference]: Without dead ends: 950 [2022-12-14 15:44:52,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 13 SyntacticMatches, 11 SemanticMatches, 85 ConstructedPredicates, 14 IntricatePredicates, 2 DeprecatedPredicates, 2104 ImplicationChecksByTransitivity, 322.4s TimeCoverageRelationStatistics Valid=1203, Invalid=3972, Unknown=137, NotChecked=2170, Total=7482 [2022-12-14 15:44:52,612 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 353 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 73 mSolverCounterUnsat, 124 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 144.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 3060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 124 IncrementalHoareTripleChecker+Unknown, 1808 IncrementalHoareTripleChecker+Unchecked, 144.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:44:52,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 87 Invalid, 3060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1055 Invalid, 124 Unknown, 1808 Unchecked, 144.5s Time] [2022-12-14 15:44:52,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2022-12-14 15:44:52,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 699. [2022-12-14 15:44:52,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 689 states have (on average 2.050798258345428) internal successors, (1413), 698 states have internal predecessors, (1413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:44:52,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1413 transitions. [2022-12-14 15:44:52,619 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1413 transitions. Word has length 24 [2022-12-14 15:44:52,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:44:52,620 INFO L495 AbstractCegarLoop]: Abstraction has 699 states and 1413 transitions. [2022-12-14 15:44:52,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:44:52,620 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1413 transitions. [2022-12-14 15:44:52,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:44:52,620 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:44:52,620 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 15:44:52,626 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 15:44:52,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-14 15:44:52,822 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 15:44:52,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:44:52,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1453030992, now seen corresponding path program 6 times [2022-12-14 15:44:52,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:44:52,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916231248] [2022-12-14 15:44:52,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:44:52,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:44:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:44:53,975 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:44:53,975 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:44:53,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916231248] [2022-12-14 15:44:53,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916231248] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:44:53,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117889508] [2022-12-14 15:44:53,975 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 15:44:53,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:44:53,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:44:53,976 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:44:53,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 15:44:54,083 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 15:44:54,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:44:54,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 105 conjunts are in the unsatisfiable core [2022-12-14 15:44:54,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:44:54,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:44:54,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:44:54,110 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 15:44:54,110 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-12-14 15:44:54,123 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 15:44:54,123 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-12-14 15:44:54,218 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-12-14 15:44:54,344 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-12-14 15:44:54,545 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-12-14 15:44:54,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:44:54,622 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-12-14 15:44:54,732 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-12-14 15:44:54,971 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 165 treesize of output 158 [2022-12-14 15:44:55,226 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 152 treesize of output 154 [2022-12-14 15:44:55,499 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 132 treesize of output 125 [2022-12-14 15:44:55,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:44:55,683 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 119 treesize of output 121 [2022-12-14 15:44:55,997 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 137 treesize of output 130 [2022-12-14 15:44:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:44:58,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:44:58,506 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1869 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1868) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1869) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-12-14 15:44:58,525 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1869 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1867 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_1867)) |c_~#stored_elements~0.base| v_ArrVal_1868) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1869) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_1867 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-12-14 15:44:58,541 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1869 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1867 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_1867)) |c_~#stored_elements~0.base| v_ArrVal_1868) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1869) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1867) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse0 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-12-14 15:44:58,562 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1869 Int) (v_ArrVal_1865 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1867 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1865))) (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_1867)) |c_~#stored_elements~0.base| v_ArrVal_1868) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1869) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1867) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))))) is different from false [2022-12-14 15:44:58,581 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (or (= 400 (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0)) (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1869 Int) (v_ArrVal_1865 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1867 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1865))) (let ((.cse2 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse1 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse0 v_ArrVal_1867)) |c_~#stored_elements~0.base| v_ArrVal_1868) |c_~#queue~0.base|))) (or (< (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1869) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse0) 1) v_ArrVal_1867) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse1 (+ |c_~#queue~0.offset| 1604))))))))))) is different from false [2022-12-14 15:44:58,622 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (= 400 (select .cse0 .cse1)) (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1869 Int) (v_ArrVal_1865 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1863 Int) (v_ArrVal_1867 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1863)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1865))) (let ((.cse2 (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse3 (select (store (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse1 v_ArrVal_1867)) |c_~#stored_elements~0.base| v_ArrVal_1868) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1863 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1867) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse3 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1869) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))))) is different from false [2022-12-14 15:44:58,809 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1869 Int) (v_ArrVal_1865 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1861 Int) (v_ArrVal_1863 Int) (v_ArrVal_1867 Int)) (let ((.cse0 (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_1861)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1863)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1865))) (let ((.cse4 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse3 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse2 v_ArrVal_1867)) |c_~#stored_elements~0.base| v_ArrVal_1868) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1863) (= 400 (select .cse0 .cse2)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse3 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse4 .cse2) 1) v_ArrVal_1867) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1869) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2022-12-14 15:44:59,004 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1869 Int) (v_ArrVal_1865 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1860 (Array Int Int)) (v_ArrVal_1861 Int) (v_ArrVal_1863 Int) (v_ArrVal_1867 Int)) (let ((.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1860))) (let ((.cse2 (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1861))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse5 (store (store .cse6 |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_1863)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1865))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store .cse3 .cse4 v_ArrVal_1867)) |c_~#stored_elements~0.base| v_ArrVal_1868) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1869) .cse1) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1863) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1867) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse0 .cse4))) (= 400 (select .cse2 .cse4))))))))) is different from false [2022-12-14 15:44:59,038 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1869 Int) (v_ArrVal_1865 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1860 (Array Int Int)) (v_ArrVal_1861 Int) (v_ArrVal_1863 Int) (v_ArrVal_1867 Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.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_1860))) (let ((.cse4 (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1861))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse5 (store (store .cse6 |c_~#queue~0.base| (store .cse4 .cse1 v_ArrVal_1863)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1865))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store .cse2 .cse3 v_ArrVal_1867)) |c_~#stored_elements~0.base| v_ArrVal_1868) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1869) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1867) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse0 .cse3))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1863) (= 400 (select .cse4 .cse3))))))))) is different from false [2022-12-14 15:44:59,074 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1869 Int) (v_ArrVal_1865 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1860 (Array Int Int)) (v_ArrVal_1861 Int) (v_ArrVal_1863 Int) (v_ArrVal_1867 Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse8 .cse9 (+ (select .cse8 .cse9) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1860))) (let ((.cse2 (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1861))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse5 (store (store .cse6 |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_1863)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1865))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store .cse4 .cse3 v_ArrVal_1867)) |c_~#stored_elements~0.base| v_ArrVal_1868) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1869) .cse1) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1863) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse0 .cse3))) (< (+ 1 (select .cse4 .cse3)) v_ArrVal_1867) (= 400 (select .cse2 .cse3))))))))) is different from false [2022-12-14 15:44:59,115 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse9 .cse10))) (or (= 400 .cse0) (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1869 Int) (v_ArrVal_1865 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1860 (Array Int Int)) (v_ArrVal_1861 Int) (v_ArrVal_1863 Int) (v_ArrVal_1867 Int)) (let ((.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse9 .cse10 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1860))) (let ((.cse3 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1861))) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse3 .cse2 v_ArrVal_1863)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1865))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse1 (select (store (store .cse6 |c_~#queue~0.base| (store .cse5 .cse4 v_ArrVal_1867)) |c_~#stored_elements~0.base| v_ArrVal_1868) |c_~#queue~0.base|))) (or (< (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1869) .cse2) 2147483647) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1863) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse1 .cse4))) (< (+ 1 (select .cse5 .cse4)) v_ArrVal_1867) (= 400 (select .cse3 .cse4)))))))))))) is different from false [2022-12-14 15:44:59,167 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 ((.cse10 (select .cse8 .cse9))) (or (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1869 Int) (v_ArrVal_1865 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1860 (Array Int Int)) (v_ArrVal_1861 Int) (v_ArrVal_1863 Int) (v_ArrVal_1857 Int) (v_ArrVal_1867 Int)) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse8 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1857) .cse9 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_1860))) (let ((.cse0 (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse1) 4)) v_ArrVal_1861))) (.cse3 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse5 (store (store .cse6 |c_~#queue~0.base| (store .cse0 .cse3 v_ArrVal_1863)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1865))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store .cse4 .cse1 v_ArrVal_1867)) |c_~#stored_elements~0.base| v_ArrVal_1868) |c_~#queue~0.base|))) (or (= 400 (select .cse0 .cse1)) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1869) .cse3) 2147483647) (not (<= v_ArrVal_1857 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse2 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1867) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1863)))))))) (= 400 .cse10)))) is different from false [2022-12-14 15:44:59,220 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse11 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse5 .cse11))) (or (= 400 .cse0) (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1869 Int) (v_ArrVal_1865 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1860 (Array Int Int)) (v_ArrVal_1861 Int) (v_ArrVal_1863 Int) (v_ArrVal_1857 Int) (v_ArrVal_1867 Int)) (let ((.cse6 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1857) .cse11 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1860))) (let ((.cse1 (let ((.cse10 (select .cse9 |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse2) 4)) v_ArrVal_1861))) (.cse4 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store .cse1 .cse4 v_ArrVal_1863)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1865))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse8 |c_~#queue~0.base| (store .cse7 .cse2 v_ArrVal_1867)) |c_~#stored_elements~0.base| v_ArrVal_1868) |c_~#queue~0.base|))) (or (= 400 (select .cse1 .cse2)) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1869) .cse4) 2147483647) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1857) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse3 .cse2))) (< (+ (select .cse7 .cse2) 1) v_ArrVal_1867) (< (+ (select .cse1 .cse4) 1) v_ArrVal_1863)))))))))))) is different from false [2022-12-14 15:44:59,284 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1869 Int) (v_ArrVal_1865 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1860 (Array Int Int)) (v_ArrVal_1861 Int) (v_ArrVal_1863 Int) (v_ArrVal_1854 Int) (v_ArrVal_1857 Int) (v_ArrVal_1867 Int)) (let ((.cse6 (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_1854)) (.cse11 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse7 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (select .cse6 .cse11))) (let ((.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 .cse7 v_ArrVal_1857) .cse11 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_1860))) (let ((.cse0 (let ((.cse10 (select .cse9 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1861))) (.cse1 (+ 1608 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1863)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1865))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse8 |c_~#queue~0.base| (store .cse5 .cse4 v_ArrVal_1867)) |c_~#stored_elements~0.base| v_ArrVal_1868) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1863) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1869) .cse1) 2147483647) (= 400 .cse3) (= 400 (select .cse0 .cse4)) (< (+ (select .cse5 .cse4) 1) v_ArrVal_1867) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse2 .cse4))) (< (+ (select .cse6 .cse7) 1) v_ArrVal_1857)))))))))) is different from false [2022-12-14 15:45:02,031 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 10 not checked. [2022-12-14 15:45:02,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117889508] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:45:02,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1891915101] [2022-12-14 15:45:02,032 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-12-14 15:45:02,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:45:02,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 20] total 54 [2022-12-14 15:45:02,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963166328] [2022-12-14 15:45:02,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:45:02,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-12-14 15:45:02,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:45:02,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-12-14 15:45:02,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=458, Invalid=1285, Unknown=35, NotChecked=1302, Total=3080 [2022-12-14 15:45:02,033 INFO L87 Difference]: Start difference. First operand 699 states and 1413 transitions. Second operand has 56 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:45:17,804 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-12-14 15:45:34,338 WARN L233 SmtUtils]: Spent 16.21s on a formula simplification. DAG size of input: 209 DAG size of output: 126 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:45:53,847 WARN L233 SmtUtils]: Spent 16.21s on a formula simplification. DAG size of input: 169 DAG size of output: 123 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:46:01,980 WARN L233 SmtUtils]: Spent 5.59s on a formula simplification. DAG size of input: 274 DAG size of output: 100 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:46:03,985 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-12-14 15:46:05,989 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-12-14 15:46:07,995 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-12-14 15:46:10,050 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-12-14 15:46:12,077 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-12-14 15:46:22,774 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-12-14 15:46:27,271 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-12-14 15:46:29,274 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-12-14 15:46:31,280 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-12-14 15:46:33,293 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-12-14 15:46:35,300 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-12-14 15:46:37,308 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-12-14 15:46:39,767 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-12-14 15:46:41,771 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-12-14 15:46:43,777 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-12-14 15:46:45,783 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-12-14 15:46:47,789 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-12-14 15:46:49,796 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-12-14 15:47:02,417 WARN L233 SmtUtils]: Spent 8.62s on a formula simplification. DAG size of input: 217 DAG size of output: 167 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:47:04,527 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-12-14 15:47:04,550 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1869 Int) (v_ArrVal_1865 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1860 (Array Int Int)) (v_ArrVal_1861 Int) (v_ArrVal_1863 Int) (v_ArrVal_1854 Int) (v_ArrVal_1857 Int) (v_ArrVal_1867 Int)) (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1854))) (let ((.cse7 (select .cse0 .cse3))) (let ((.cse9 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1857) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_1860))) (let ((.cse2 (let ((.cse10 (select .cse9 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1861)))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_1863)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1865))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse6 (select (store (store .cse8 |c_~#queue~0.base| (store .cse4 .cse3 v_ArrVal_1867)) |c_~#stored_elements~0.base| v_ArrVal_1868) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1857) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1863) (= 400 (select .cse2 .cse3)) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1867) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_148| (select .cse5 .cse3))) (< (select (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1869) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse6 .cse3))) (= 400 .cse7))))))))))) (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1869 Int) (v_ArrVal_1865 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1860 (Array Int Int)) (v_ArrVal_1861 Int) (v_ArrVal_1863 Int) (v_ArrVal_1854 Int) (v_ArrVal_1857 Int) (v_ArrVal_1867 Int)) (let ((.cse15 (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_1854)) (.cse20 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse16 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse13 (select .cse15 .cse20))) (let ((.cse18 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse15 .cse16 v_ArrVal_1857) .cse20 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_1860))) (let ((.cse11 (let ((.cse19 (select .cse18 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1861)))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store .cse11 .cse1 v_ArrVal_1863)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1865))) (let ((.cse14 (select .cse17 |c_~#queue~0.base|))) (let ((.cse12 (select (store (store .cse17 |c_~#queue~0.base| (store .cse14 .cse3 v_ArrVal_1867)) |c_~#stored_elements~0.base| v_ArrVal_1868) |c_~#queue~0.base|))) (or (< (+ (select .cse11 .cse1) 1) v_ArrVal_1863) (< (select (store .cse12 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1869) .cse1) 2147483647) (= 400 .cse13) (= 400 (select .cse11 .cse3)) (< (+ (select .cse14 .cse3) 1) v_ArrVal_1867) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse12 .cse3))) (< (+ (select .cse15 .cse16) 1) v_ArrVal_1857)))))))))))) is different from false [2022-12-14 15:47:06,600 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-12-14 15:47:20,900 WARN L233 SmtUtils]: Spent 6.80s on a formula simplification. DAG size of input: 207 DAG size of output: 146 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:47:25,844 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-12-14 15:47:27,854 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-12-14 15:47:29,862 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-12-14 15:47:31,870 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-12-14 15:47:33,880 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-12-14 15:47:35,888 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-12-14 15:47:48,842 WARN L233 SmtUtils]: Spent 8.37s on a formula simplification. DAG size of input: 181 DAG size of output: 178 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:47:49,406 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse11 (select .cse9 .cse10))) (let ((.cse0 (= 400 .cse11)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (and (or .cse0 (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1869 Int) (v_ArrVal_1865 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1860 (Array Int Int)) (v_ArrVal_1861 Int) (v_ArrVal_1863 Int) (v_ArrVal_1867 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse9 .cse10 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_1860))) (let ((.cse3 (let ((.cse8 (select .cse7 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1861)))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse3 .cse2 v_ArrVal_1863)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1865))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse1 (select (store (store .cse6 |c_~#queue~0.base| (store .cse5 .cse4 v_ArrVal_1867)) |c_~#stored_elements~0.base| v_ArrVal_1868) |c_~#queue~0.base|))) (or (< (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1869) .cse2) 2147483647) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1863) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse1 .cse4))) (< (+ 1 (select .cse5 .cse4)) v_ArrVal_1867) (= 400 (select .cse3 .cse4)))))))))) (or .cse0 (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1869 Int) (v_ArrVal_1865 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1867 Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1865))) (let ((.cse13 (select .cse14 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse12 (select (store (store .cse14 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse13 .cse10 v_ArrVal_1867)) |c_~#stored_elements~0.base| v_ArrVal_1868) |c_~#queue~0.base|))) (or (< (select (store .cse12 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1869) .cse2) 2147483647) (< (+ (select .cse13 .cse10) 1) v_ArrVal_1867) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse12 .cse4))))))))))))) is different from false [2022-12-14 15:48:06,939 WARN L233 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 167 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:48:06,958 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (and (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1869 Int) (v_ArrVal_1865 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1867 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1865))) (let ((.cse2 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse0 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1867)) |c_~#stored_elements~0.base| v_ArrVal_1868) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1869) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1867) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse0 .cse4)))))))) (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1869 Int) (v_ArrVal_1865 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1860 (Array Int Int)) (v_ArrVal_1861 Int) (v_ArrVal_1863 Int) (v_ArrVal_1867 Int)) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse12 .cse3 (+ (select .cse12 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1860))) (let ((.cse7 (let ((.cse11 (select .cse10 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1861)))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store .cse7 .cse1 v_ArrVal_1863)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1865))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (select (store (store .cse9 |c_~#queue~0.base| (store .cse8 .cse4 v_ArrVal_1867)) |c_~#stored_elements~0.base| v_ArrVal_1868) |c_~#queue~0.base|))) (or (< (select (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1869) .cse1) 2147483647) (< (+ (select .cse7 .cse1) 1) v_ArrVal_1863) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse6 .cse4))) (< (+ 1 (select .cse8 .cse4)) v_ArrVal_1867) (= 400 (select .cse7 .cse4))))))))))) is different from false [2022-12-14 15:48:09,080 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-12-14 15:48:11,316 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-12-14 15:48:11,339 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ 1608 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1869 Int) (v_ArrVal_1865 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1861 Int) (v_ArrVal_1863 Int) (v_ArrVal_1867 Int)) (let ((.cse3 (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1861)))) (let ((.cse5 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse3 .cse2 v_ArrVal_1863)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1865))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store .cse4 .cse1 v_ArrVal_1867)) |c_~#stored_elements~0.base| v_ArrVal_1868) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse0 .cse1))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1869) .cse2) 2147483647) (= 400 (select .cse3 .cse1)) (< (+ (select .cse4 .cse1) 1) v_ArrVal_1867) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1863))))))) (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1869 Int) (v_ArrVal_1865 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1861 Int) (v_ArrVal_1863 Int) (v_ArrVal_1867 Int)) (let ((.cse7 (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_1861)) (.cse8 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1863)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1865))) (let ((.cse11 (select .cse12 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse10 (select (store (store .cse12 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse11 .cse9 v_ArrVal_1867)) |c_~#stored_elements~0.base| v_ArrVal_1868) |c_~#queue~0.base|))) (or (< (+ (select .cse7 .cse8) 1) v_ArrVal_1863) (= 400 (select .cse7 .cse9)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse10 .cse1))) (< (+ (select .cse11 .cse9) 1) v_ArrVal_1867) (< (select (store .cse10 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1869) .cse2) 2147483647))))))))) is different from false [2022-12-14 15:48:12,075 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse8 (= 400 (select .cse0 .cse3))) (.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (or (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1869 Int) (v_ArrVal_1865 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1863 Int) (v_ArrVal_1867 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1863)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1865))) (let ((.cse2 (select .cse7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse4 (select (store (store .cse7 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1867)) |c_~#stored_elements~0.base| v_ArrVal_1868) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1863) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1867) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse4 .cse5))) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1869) .cse6) 2147483647)))))) .cse8) (or .cse8 (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1869 Int) (v_ArrVal_1865 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| Int) (v_ArrVal_1863 Int) (v_ArrVal_1867 Int)) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1863)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1865))) (let ((.cse9 (select .cse11 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (let ((.cse10 (select (store (store .cse11 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse9 .cse3 v_ArrVal_1867)) |c_~#stored_elements~0.base| v_ArrVal_1868) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1863 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse9 .cse3) 1) v_ArrVal_1867) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| (select .cse10 .cse5))) (< (select (store .cse10 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_146| 4)) v_ArrVal_1869) .cse6) 2147483647)))))))))) is different from false [2022-12-14 15:48:14,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:48:14,010 INFO L93 Difference]: Finished difference Result 1107 states and 2219 transitions. [2022-12-14 15:48:14,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-12-14 15:48:14,010 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 0 states have call successors, (0), 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-12-14 15:48:14,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:48:14,011 INFO L225 Difference]: With dead ends: 1107 [2022-12-14 15:48:14,011 INFO L226 Difference]: Without dead ends: 1107 [2022-12-14 15:48:14,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 9 SyntacticMatches, 12 SemanticMatches, 86 ConstructedPredicates, 19 IntricatePredicates, 9 DeprecatedPredicates, 2241 ImplicationChecksByTransitivity, 133.8s TimeCoverageRelationStatistics Valid=1198, Invalid=3495, Unknown=75, NotChecked=2888, Total=7656 [2022-12-14 15:48:14,013 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 374 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1439 mSolverCounterSat, 80 mSolverCounterUnsat, 83 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 4619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1439 IncrementalHoareTripleChecker+Invalid, 83 IncrementalHoareTripleChecker+Unknown, 3017 IncrementalHoareTripleChecker+Unchecked, 64.9s IncrementalHoareTripleChecker+Time [2022-12-14 15:48:14,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 136 Invalid, 4619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1439 Invalid, 83 Unknown, 3017 Unchecked, 64.9s Time] [2022-12-14 15:48:14,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2022-12-14 15:48:14,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 701. [2022-12-14 15:48:14,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 691 states have (on average 2.0622286541244574) internal successors, (1425), 700 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:48:14,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1425 transitions. [2022-12-14 15:48:14,021 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1425 transitions. Word has length 24 [2022-12-14 15:48:14,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:48:14,021 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 1425 transitions. [2022-12-14 15:48:14,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:48:14,021 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1425 transitions. [2022-12-14 15:48:14,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:48:14,022 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:48:14,022 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 15:48:14,027 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-14 15:48:14,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-14 15:48:14,223 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 15:48:14,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:48:14,225 INFO L85 PathProgramCache]: Analyzing trace with hash -104726726, now seen corresponding path program 7 times [2022-12-14 15:48:14,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:48:14,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541380752] [2022-12-14 15:48:14,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:48:14,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:48:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:48:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:48:15,400 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:48:15,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541380752] [2022-12-14 15:48:15,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541380752] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:48:15,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178723870] [2022-12-14 15:48:15,401 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 15:48:15,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:48:15,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:48:15,401 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:48:15,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2f29fc1-b0b0-4fd5-899d-0fc10eaeb5dd/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 15:48:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:48:15,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 98 conjunts are in the unsatisfiable core [2022-12-14 15:48:15,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:48:15,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:48:15,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:48:15,554 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 15:48:15,554 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-12-14 15:48:15,569 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 15:48:15,569 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-12-14 15:48:15,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 46 treesize of output 39 [2022-12-14 15:48:15,851 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-12-14 15:48:16,047 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-12-14 15:48:16,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:48:16,141 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-12-14 15:48:16,288 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-12-14 15:48:16,656 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-12-14 15:48:17,747 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-12-14 15:48:18,449 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-12-14 15:48:23,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:48:23,001 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-12-14 15:48:23,801 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-12-14 15:48:31,484 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:48:31,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:48:31,803 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| Int) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1995 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1992) |c_~#stored_elements~0.base| v_ArrVal_1993) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| 4)) v_ArrVal_1995) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-12-14 15:48:47,518 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| Int) (v_ArrVal_1985 (Array Int Int)) (v_ArrVal_1990 Int) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1995 Int) (v_ArrVal_1987 Int) (v_ArrVal_1989 Int)) (let ((.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1985))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| 4)) v_ArrVal_1987)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse3 v_ArrVal_1989) .cse1 v_ArrVal_1990)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1992) |c_~#stored_elements~0.base| v_ArrVal_1993) |c_~#queue~0.base|)) (.cse4 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| (select .cse2 .cse1))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| 4)) v_ArrVal_1995) .cse3) 2147483647) (= 400 .cse4) (< (+ .cse4 1) v_ArrVal_1990) (< (+ (select .cse5 .cse3) 1) v_ArrVal_1989))))))) is different from false [2022-12-14 15:48:47,568 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| Int) (v_ArrVal_1985 (Array Int Int)) (v_ArrVal_1990 Int) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1983 Int) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1995 Int) (v_ArrVal_1987 Int) (v_ArrVal_1989 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) v_ArrVal_1983)) |c_~#stored_elements~0.base| v_ArrVal_1985))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| 4)) v_ArrVal_1987)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_1989) .cse3 v_ArrVal_1990)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1992) |c_~#stored_elements~0.base| v_ArrVal_1993) |c_~#queue~0.base|)) (.cse4 (select .cse5 .cse3))) (or (not (<= v_ArrVal_1983 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| 4)) v_ArrVal_1995) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| (select .cse2 .cse3))) (= 400 .cse4) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| (select .cse0 .cse3))) (< (+ .cse4 1) v_ArrVal_1990) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1989))))))) is different from false [2022-12-14 15:48:47,621 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| Int) (v_ArrVal_1985 (Array Int Int)) (v_ArrVal_1990 Int) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1983 Int) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1995 Int) (v_ArrVal_1987 Int) (v_ArrVal_1989 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_1983)) |c_~#stored_elements~0.base| v_ArrVal_1985))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|))) (let ((.cse7 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| 4)) v_ArrVal_1987)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse1 v_ArrVal_1989) .cse3 v_ArrVal_1990)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1992) |c_~#stored_elements~0.base| v_ArrVal_1993) |c_~#queue~0.base|)) (.cse4 (select .cse7 .cse3))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| 4)) v_ArrVal_1995) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| (select .cse2 .cse3))) (= 400 .cse4) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1983) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| (select .cse0 .cse3))) (< (+ .cse4 1) v_ArrVal_1990) (< (+ (select .cse7 .cse1) 1) v_ArrVal_1989)))))))) is different from false [2022-12-14 15:48:47,734 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| Int) (v_ArrVal_1985 (Array Int Int)) (v_ArrVal_1990 Int) (v_ArrVal_1981 Int) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1983 Int) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1995 Int) (v_ArrVal_1987 Int) (v_ArrVal_1989 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1981) .cse3 v_ArrVal_1983)) |c_~#stored_elements~0.base| v_ArrVal_1985))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| 4)) v_ArrVal_1987)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (select (store (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1989) .cse6 v_ArrVal_1990)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1992) |c_~#stored_elements~0.base| v_ArrVal_1993) |c_~#queue~0.base|)) (.cse4 (select .cse0 .cse6))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1989) (not (<= v_ArrVal_1981 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1983) (< (+ .cse4 1) v_ArrVal_1990) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| (select .cse5 .cse6))) (< (select (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| 4)) v_ArrVal_1995) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| (select .cse7 .cse6))) (= .cse4 400)))))))) is different from false [2022-12-14 15:48:47,808 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| Int) (v_ArrVal_1985 (Array Int Int)) (v_ArrVal_1990 Int) (v_ArrVal_1981 Int) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1983 Int) (v_ArrVal_1992 (Array Int Int)) (v_ArrVal_1995 Int) (v_ArrVal_1987 Int) (v_ArrVal_1989 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse8 v_ArrVal_1981) .cse3 v_ArrVal_1983)) |c_~#stored_elements~0.base| v_ArrVal_1985))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse0 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| 4)) v_ArrVal_1987)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (let ((.cse5 (select (store (store (store .cse9 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_1989) .cse6 v_ArrVal_1990)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1992) |c_~#stored_elements~0.base| v_ArrVal_1993) |c_~#queue~0.base|)) (.cse4 (select .cse0 .cse6))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1989) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1983) (< (+ .cse4 1) v_ArrVal_1990) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| (select .cse5 .cse6))) (< (select (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| 4)) v_ArrVal_1995) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| (select .cse7 .cse6))) (< (+ (select .cse2 .cse8) 1) v_ArrVal_1981) (= .cse4 400)))))))) is different from false [2022-12-14 15:48:47,884 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1979 Int) (v_ArrVal_1985 (Array Int Int)) (v_ArrVal_1993 (Array Int Int)) (v_ArrVal_1992 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| Int) (v_ArrVal_1990 Int) (v_ArrVal_1981 Int) (v_ArrVal_1983 Int) (v_ArrVal_1995 Int) (v_ArrVal_1987 Int) (v_ArrVal_1989 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_1979)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_1981) .cse5 v_ArrVal_1983)) |c_~#stored_elements~0.base| v_ArrVal_1985))) (let ((.cse3 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse7 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| 4)) v_ArrVal_1987)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse7 .cse4)) (.cse6 (select (store (store (store .cse9 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_1989) .cse4 v_ArrVal_1990)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1992) |c_~#stored_elements~0.base| v_ArrVal_1993) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_1990) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1981) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_154| (select .cse3 .cse4))) (= 400 .cse0) (< (+ (select .cse1 .cse5) 1) v_ArrVal_1983) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| (select .cse6 .cse4))) (< (+ (select .cse7 .cse8) 1) v_ArrVal_1989) (< (select (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_153| 4)) v_ArrVal_1995) .cse8) 2147483647)))))))) is different from false