./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 b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba --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-b5237d8 [2022-11-22 00:19:20,673 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 00:19:20,675 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 00:19:20,699 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 00:19:20,699 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 00:19:20,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 00:19:20,702 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 00:19:20,704 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 00:19:20,705 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 00:19:20,706 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 00:19:20,707 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 00:19:20,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 00:19:20,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 00:19:20,710 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 00:19:20,711 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 00:19:20,713 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 00:19:20,714 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 00:19:20,715 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 00:19:20,716 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 00:19:20,718 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 00:19:20,719 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 00:19:20,724 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 00:19:20,725 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 00:19:20,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 00:19:20,730 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 00:19:20,730 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 00:19:20,730 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 00:19:20,731 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 00:19:20,732 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 00:19:20,733 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 00:19:20,733 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 00:19:20,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 00:19:20,735 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 00:19:20,735 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 00:19:20,736 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 00:19:20,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 00:19:20,737 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 00:19:20,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 00:19:20,744 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 00:19:20,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 00:19:20,748 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 00:19:20,749 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-22 00:19:20,796 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 00:19:20,796 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 00:19:20,797 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 00:19:20,797 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 00:19:20,798 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 00:19:20,798 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 00:19:20,798 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 00:19:20,799 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 00:19:20,799 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 00:19:20,799 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 00:19:20,800 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 00:19:20,800 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 00:19:20,801 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 00:19:20,801 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 00:19:20,801 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 00:19:20,801 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 00:19:20,801 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 00:19:20,802 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 00:19:20,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 00:19:20,803 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 00:19:20,803 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 00:19:20,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 00:19:20,804 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 00:19:20,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 00:19:20,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 00:19:20,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 00:19:20,805 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 00:19:20,805 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-22 00:19:20,805 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 00:19:20,806 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 00:19:20,806 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 00:19:20,806 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 00:19:20,806 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 00:19:20,807 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 00:19:20,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:19:20,807 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 00:19:20,807 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 00:19:20,807 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 00:19:20,808 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 00:19:20,808 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 00:19:20,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 00:19:20,809 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 00:19:20,809 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 00:19:20,809 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_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/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_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2022-11-22 00:19:21,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 00:19:21,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 00:19:21,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 00:19:21,153 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 00:19:21,154 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 00:19:21,155 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-22 00:19:24,199 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 00:19:24,499 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 00:19:24,502 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/sv-benchmarks/c/pthread/queue_ok_longer.i [2022-11-22 00:19:24,524 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/data/d1e7440b5/96dc7022a2434defa15cb2f8bc6967c1/FLAGda1142c53 [2022-11-22 00:19:24,543 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/data/d1e7440b5/96dc7022a2434defa15cb2f8bc6967c1 [2022-11-22 00:19:24,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 00:19:24,550 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 00:19:24,555 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 00:19:24,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 00:19:24,560 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 00:19:24,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:19:24" (1/1) ... [2022-11-22 00:19:24,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fe88176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:19:24, skipping insertion in model container [2022-11-22 00:19:24,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:19:24" (1/1) ... [2022-11-22 00:19:24,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 00:19:24,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 00:19:25,140 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_8537587a-06db-4dac-bb65-edb23ab7e36c/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-22 00:19:25,146 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_8537587a-06db-4dac-bb65-edb23ab7e36c/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-22 00:19:25,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:19:25,168 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 00:19:25,268 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_8537587a-06db-4dac-bb65-edb23ab7e36c/sv-benchmarks/c/pthread/queue_ok_longer.i[43272,43285] [2022-11-22 00:19:25,271 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_8537587a-06db-4dac-bb65-edb23ab7e36c/sv-benchmarks/c/pthread/queue_ok_longer.i[43545,43558] [2022-11-22 00:19:25,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 00:19:25,354 INFO L208 MainTranslator]: Completed translation [2022-11-22 00:19:25,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:19:25 WrapperNode [2022-11-22 00:19:25,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 00:19:25,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 00:19:25,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 00:19:25,357 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 00:19:25,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:19:25" (1/1) ... [2022-11-22 00:19:25,397 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:19:25" (1/1) ... [2022-11-22 00:19:25,449 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 214 [2022-11-22 00:19:25,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 00:19:25,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 00:19:25,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 00:19:25,451 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 00:19:25,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:19:25" (1/1) ... [2022-11-22 00:19:25,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:19:25" (1/1) ... [2022-11-22 00:19:25,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:19:25" (1/1) ... [2022-11-22 00:19:25,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:19:25" (1/1) ... [2022-11-22 00:19:25,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:19:25" (1/1) ... [2022-11-22 00:19:25,489 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:19:25" (1/1) ... [2022-11-22 00:19:25,491 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:19:25" (1/1) ... [2022-11-22 00:19:25,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:19:25" (1/1) ... [2022-11-22 00:19:25,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 00:19:25,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 00:19:25,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 00:19:25,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 00:19:25,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:19:25" (1/1) ... [2022-11-22 00:19:25,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 00:19:25,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:19:25,530 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 00:19:25,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 00:19:25,573 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-22 00:19:25,573 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-22 00:19:25,574 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-22 00:19:25,574 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-22 00:19:25,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-22 00:19:25,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 00:19:25,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 00:19:25,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 00:19:25,575 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-22 00:19:25,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 00:19:25,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 00:19:25,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 00:19:25,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 00:19:25,579 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-22 00:19:25,768 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 00:19:25,770 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 00:19:26,148 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 00:19:26,158 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 00:19:26,159 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-22 00:19:26,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:19:26 BoogieIcfgContainer [2022-11-22 00:19:26,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 00:19:26,164 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 00:19:26,164 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 00:19:26,168 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 00:19:26,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:19:24" (1/3) ... [2022-11-22 00:19:26,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcdbea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:19:26, skipping insertion in model container [2022-11-22 00:19:26,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:19:25" (2/3) ... [2022-11-22 00:19:26,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcdbea7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:19:26, skipping insertion in model container [2022-11-22 00:19:26,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:19:26" (3/3) ... [2022-11-22 00:19:26,171 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-11-22 00:19:26,180 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-22 00:19:26,192 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 00:19:26,192 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-22 00:19:26,192 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-22 00:19:26,326 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-22 00:19:26,365 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-22 00:19:26,379 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 245 places, 251 transitions, 518 flow [2022-11-22 00:19:26,382 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 245 places, 251 transitions, 518 flow [2022-11-22 00:19:26,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 251 transitions, 518 flow [2022-11-22 00:19:26,570 INFO L130 PetriNetUnfolder]: 13/249 cut-off events. [2022-11-22 00:19:26,571 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-22 00:19:26,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 249 events. 13/249 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 458 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2022-11-22 00:19:26,618 INFO L119 LiptonReduction]: Number of co-enabled transitions 14376 [2022-11-22 00:19:37,413 INFO L134 LiptonReduction]: Checked pairs total: 29976 [2022-11-22 00:19:37,413 INFO L136 LiptonReduction]: Total number of compositions: 235 [2022-11-22 00:19:37,421 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 63 places, 63 transitions, 142 flow [2022-11-22 00:19:37,501 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1160 states, 1112 states have (on average 2.7697841726618706) internal successors, (3080), 1159 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:37,519 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 00:19:37,526 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;@747f200d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 00:19:37,526 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-11-22 00:19:37,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 1160 states, 1112 states have (on average 2.7697841726618706) internal successors, (3080), 1159 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:37,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-22 00:19:37,537 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:19:37,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:19:37,539 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-22 00:19:37,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:19:37,544 INFO L85 PathProgramCache]: Analyzing trace with hash -261748653, now seen corresponding path program 1 times [2022-11-22 00:19:37,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:19:37,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020051803] [2022-11-22 00:19:37,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:37,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:19:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:39,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:19:39,185 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:19:39,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020051803] [2022-11-22 00:19:39,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020051803] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:19:39,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:19:39,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:19:39,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851106766] [2022-11-22 00:19:39,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:19:39,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 00:19:39,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:19:39,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 00:19:39,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:19:39,226 INFO L87 Difference]: Start difference. First operand has 1160 states, 1112 states have (on average 2.7697841726618706) internal successors, (3080), 1159 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:39,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:19:39,793 INFO L93 Difference]: Finished difference Result 1168 states and 3096 transitions. [2022-11-22 00:19:39,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:19:39,796 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-22 00:19:39,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:19:39,820 INFO L225 Difference]: With dead ends: 1168 [2022-11-22 00:19:39,820 INFO L226 Difference]: Without dead ends: 1168 [2022-11-22 00:19:39,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:19:39,824 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 7 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 00:19:39,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 24 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 00:19:39,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2022-11-22 00:19:39,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1163. [2022-11-22 00:19:39,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 1115 states have (on average 2.768609865470852) internal successors, (3087), 1162 states have internal predecessors, (3087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:39,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 3087 transitions. [2022-11-22 00:19:39,947 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 3087 transitions. Word has length 7 [2022-11-22 00:19:39,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:19:39,947 INFO L495 AbstractCegarLoop]: Abstraction has 1163 states and 3087 transitions. [2022-11-22 00:19:39,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:39,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 3087 transitions. [2022-11-22 00:19:39,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 00:19:39,949 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:19:39,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:19:39,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 00:19:39,949 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-22 00:19:39,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:19:39,950 INFO L85 PathProgramCache]: Analyzing trace with hash 2023131929, now seen corresponding path program 1 times [2022-11-22 00:19:39,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:19:39,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472852062] [2022-11-22 00:19:39,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:39,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:19:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:40,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:19:40,747 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:19:40,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472852062] [2022-11-22 00:19:40,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472852062] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:19:40,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:19:40,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:19:40,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467300861] [2022-11-22 00:19:40,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:19:40,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:19:40,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:19:40,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:19:40,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:19:40,750 INFO L87 Difference]: Start difference. First operand 1163 states and 3087 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:41,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:19:41,182 INFO L93 Difference]: Finished difference Result 1584 states and 4180 transitions. [2022-11-22 00:19:41,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:19:41,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-22 00:19:41,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:19:41,193 INFO L225 Difference]: With dead ends: 1584 [2022-11-22 00:19:41,193 INFO L226 Difference]: Without dead ends: 1584 [2022-11-22 00:19:41,194 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-11-22 00:19:41,195 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 98 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:19:41,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 36 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:19:41,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2022-11-22 00:19:41,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1328. [2022-11-22 00:19:41,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1280 states have (on average 2.8109375) internal successors, (3598), 1327 states have internal predecessors, (3598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:41,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 3598 transitions. [2022-11-22 00:19:41,247 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 3598 transitions. Word has length 8 [2022-11-22 00:19:41,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:19:41,247 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 3598 transitions. [2022-11-22 00:19:41,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:41,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 3598 transitions. [2022-11-22 00:19:41,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 00:19:41,249 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:19:41,249 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:19:41,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 00:19:41,249 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-22 00:19:41,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:19:41,250 INFO L85 PathProgramCache]: Analyzing trace with hash 2023131930, now seen corresponding path program 1 times [2022-11-22 00:19:41,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:19:41,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372468991] [2022-11-22 00:19:41,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:41,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:19:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:41,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:19:41,908 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:19:41,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372468991] [2022-11-22 00:19:41,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372468991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:19:41,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:19:41,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:19:41,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933015119] [2022-11-22 00:19:41,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:19:41,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:19:41,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:19:41,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:19:41,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:19:41,911 INFO L87 Difference]: Start difference. First operand 1328 states and 3598 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:42,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:19:42,278 INFO L93 Difference]: Finished difference Result 1537 states and 4057 transitions. [2022-11-22 00:19:42,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:19:42,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-22 00:19:42,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:19:42,288 INFO L225 Difference]: With dead ends: 1537 [2022-11-22 00:19:42,288 INFO L226 Difference]: Without dead ends: 1537 [2022-11-22 00:19:42,290 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-11-22 00:19:42,293 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 72 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:19:42,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 36 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:19:42,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2022-11-22 00:19:42,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1328. [2022-11-22 00:19:42,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1280 states have (on average 2.78359375) internal successors, (3563), 1327 states have internal predecessors, (3563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:42,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 3563 transitions. [2022-11-22 00:19:42,351 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 3563 transitions. Word has length 8 [2022-11-22 00:19:42,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:19:42,352 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 3563 transitions. [2022-11-22 00:19:42,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:42,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 3563 transitions. [2022-11-22 00:19:42,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 00:19:42,358 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:19:42,358 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:19:42,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 00:19:42,359 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-22 00:19:42,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:19:42,359 INFO L85 PathProgramCache]: Analyzing trace with hash 475825829, now seen corresponding path program 2 times [2022-11-22 00:19:42,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:19:42,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435617181] [2022-11-22 00:19:42,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:42,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:19:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:43,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:19:43,135 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:19:43,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435617181] [2022-11-22 00:19:43,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435617181] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:19:43,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:19:43,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:19:43,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070604343] [2022-11-22 00:19:43,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:19:43,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:19:43,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:19:43,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:19:43,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:19:43,137 INFO L87 Difference]: Start difference. First operand 1328 states and 3563 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:43,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:19:43,747 INFO L93 Difference]: Finished difference Result 1572 states and 4148 transitions. [2022-11-22 00:19:43,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:19:43,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-22 00:19:43,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:19:43,758 INFO L225 Difference]: With dead ends: 1572 [2022-11-22 00:19:43,758 INFO L226 Difference]: Without dead ends: 1572 [2022-11-22 00:19:43,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:19:43,759 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 89 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 00:19:43,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 30 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 00:19:43,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2022-11-22 00:19:43,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1328. [2022-11-22 00:19:43,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1280 states have (on average 2.78359375) internal successors, (3563), 1327 states have internal predecessors, (3563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:43,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 3563 transitions. [2022-11-22 00:19:43,808 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 3563 transitions. Word has length 8 [2022-11-22 00:19:43,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:19:43,808 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 3563 transitions. [2022-11-22 00:19:43,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:43,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 3563 transitions. [2022-11-22 00:19:43,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 00:19:43,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:19:43,810 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:19:43,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 00:19:43,810 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-22 00:19:43,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:19:43,811 INFO L85 PathProgramCache]: Analyzing trace with hash 475729109, now seen corresponding path program 3 times [2022-11-22 00:19:43,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:19:43,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407914080] [2022-11-22 00:19:43,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:43,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:19:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:44,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:19:44,660 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:19:44,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407914080] [2022-11-22 00:19:44,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407914080] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:19:44,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:19:44,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:19:44,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796405603] [2022-11-22 00:19:44,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:19:44,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:19:44,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:19:44,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:19:44,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:19:44,662 INFO L87 Difference]: Start difference. First operand 1328 states and 3563 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:45,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:19:45,288 INFO L93 Difference]: Finished difference Result 1537 states and 4057 transitions. [2022-11-22 00:19:45,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:19:45,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-22 00:19:45,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:19:45,297 INFO L225 Difference]: With dead ends: 1537 [2022-11-22 00:19:45,298 INFO L226 Difference]: Without dead ends: 1537 [2022-11-22 00:19:45,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:19:45,299 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 89 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-22 00:19:45,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 30 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-22 00:19:45,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2022-11-22 00:19:45,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1328. [2022-11-22 00:19:45,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1280 states have (on average 2.78359375) internal successors, (3563), 1327 states have internal predecessors, (3563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:45,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 3563 transitions. [2022-11-22 00:19:45,380 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 3563 transitions. Word has length 8 [2022-11-22 00:19:45,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:19:45,380 INFO L495 AbstractCegarLoop]: Abstraction has 1328 states and 3563 transitions. [2022-11-22 00:19:45,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:45,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 3563 transitions. [2022-11-22 00:19:45,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 00:19:45,382 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:19:45,382 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:19:45,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 00:19:45,383 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-22 00:19:45,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:19:45,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1933921403, now seen corresponding path program 1 times [2022-11-22 00:19:45,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:19:45,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852081423] [2022-11-22 00:19:45,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:45,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:19:45,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:45,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:19:45,435 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:19:45,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852081423] [2022-11-22 00:19:45,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852081423] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:19:45,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:19:45,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:19:45,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584960917] [2022-11-22 00:19:45,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:19:45,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:19:45,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:19:45,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:19:45,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:19:45,438 INFO L87 Difference]: Start difference. First operand 1328 states and 3563 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:45,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:19:45,661 INFO L93 Difference]: Finished difference Result 2154 states and 5798 transitions. [2022-11-22 00:19:45,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:19:45,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-22 00:19:45,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:19:45,675 INFO L225 Difference]: With dead ends: 2154 [2022-11-22 00:19:45,675 INFO L226 Difference]: Without dead ends: 2154 [2022-11-22 00:19:45,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:19:45,677 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 72 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:19:45,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 26 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:19:45,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2022-11-22 00:19:45,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1950. [2022-11-22 00:19:45,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1950 states, 1902 states have (on average 2.879074658254469) internal successors, (5476), 1949 states have internal predecessors, (5476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:45,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 5476 transitions. [2022-11-22 00:19:45,748 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 5476 transitions. Word has length 9 [2022-11-22 00:19:45,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:19:45,749 INFO L495 AbstractCegarLoop]: Abstraction has 1950 states and 5476 transitions. [2022-11-22 00:19:45,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:45,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 5476 transitions. [2022-11-22 00:19:45,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 00:19:45,751 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:19:45,751 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:19:45,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 00:19:45,752 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-22 00:19:45,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:19:45,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1903415787, now seen corresponding path program 1 times [2022-11-22 00:19:45,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:19:45,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445026389] [2022-11-22 00:19:45,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:45,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:19:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:46,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:19:46,215 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:19:46,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445026389] [2022-11-22 00:19:46,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445026389] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:19:46,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:19:46,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 00:19:46,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946040156] [2022-11-22 00:19:46,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:19:46,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:19:46,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:19:46,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:19:46,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-22 00:19:46,217 INFO L87 Difference]: Start difference. First operand 1950 states and 5476 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:46,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:19:46,519 INFO L93 Difference]: Finished difference Result 2177 states and 6018 transitions. [2022-11-22 00:19:46,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 00:19:46,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-22 00:19:46,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:19:46,532 INFO L225 Difference]: With dead ends: 2177 [2022-11-22 00:19:46,533 INFO L226 Difference]: Without dead ends: 2177 [2022-11-22 00:19:46,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:19:46,534 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 35 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:19:46,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 42 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:19:46,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2177 states. [2022-11-22 00:19:46,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2177 to 1953. [2022-11-22 00:19:46,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1953 states, 1905 states have (on average 2.877690288713911) internal successors, (5482), 1952 states have internal predecessors, (5482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:46,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1953 states and 5482 transitions. [2022-11-22 00:19:46,604 INFO L78 Accepts]: Start accepts. Automaton has 1953 states and 5482 transitions. Word has length 10 [2022-11-22 00:19:46,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:19:46,604 INFO L495 AbstractCegarLoop]: Abstraction has 1953 states and 5482 transitions. [2022-11-22 00:19:46,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:46,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 5482 transitions. [2022-11-22 00:19:46,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 00:19:46,606 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:19:46,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:19:46,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 00:19:46,609 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-22 00:19:46,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:19:46,609 INFO L85 PathProgramCache]: Analyzing trace with hash -155840155, now seen corresponding path program 1 times [2022-11-22 00:19:46,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:19:46,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282247364] [2022-11-22 00:19:46,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:46,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:19:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:46,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:19:46,977 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:19:46,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282247364] [2022-11-22 00:19:46,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282247364] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:19:46,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:19:46,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:19:46,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527933721] [2022-11-22 00:19:46,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:19:46,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:19:46,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:19:46,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:19:46,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:19:46,980 INFO L87 Difference]: Start difference. First operand 1953 states and 5482 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:47,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:19:47,383 INFO L93 Difference]: Finished difference Result 2675 states and 7297 transitions. [2022-11-22 00:19:47,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 00:19:47,383 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-22 00:19:47,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:19:47,398 INFO L225 Difference]: With dead ends: 2675 [2022-11-22 00:19:47,398 INFO L226 Difference]: Without dead ends: 2675 [2022-11-22 00:19:47,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:19:47,399 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 100 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 00:19:47,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 45 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 00:19:47,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2675 states. [2022-11-22 00:19:47,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2675 to 2198. [2022-11-22 00:19:47,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2198 states, 2150 states have (on average 2.8567441860465115) internal successors, (6142), 2197 states have internal predecessors, (6142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:47,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 2198 states and 6142 transitions. [2022-11-22 00:19:47,471 INFO L78 Accepts]: Start accepts. Automaton has 2198 states and 6142 transitions. Word has length 11 [2022-11-22 00:19:47,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:19:47,471 INFO L495 AbstractCegarLoop]: Abstraction has 2198 states and 6142 transitions. [2022-11-22 00:19:47,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:47,471 INFO L276 IsEmpty]: Start isEmpty. Operand 2198 states and 6142 transitions. [2022-11-22 00:19:47,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 00:19:47,472 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:19:47,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:19:47,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 00:19:47,473 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-22 00:19:47,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:19:47,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1222541532, now seen corresponding path program 1 times [2022-11-22 00:19:47,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:19:47,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943705596] [2022-11-22 00:19:47,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:47,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:19:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:47,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:19:47,523 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:19:47,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943705596] [2022-11-22 00:19:47,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943705596] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:19:47,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:19:47,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 00:19:47,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030928510] [2022-11-22 00:19:47,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:19:47,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 00:19:47,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:19:47,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 00:19:47,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:19:47,526 INFO L87 Difference]: Start difference. First operand 2198 states and 6142 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:47,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:19:47,608 INFO L93 Difference]: Finished difference Result 614 states and 1423 transitions. [2022-11-22 00:19:47,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 00:19:47,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-22 00:19:47,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:19:47,612 INFO L225 Difference]: With dead ends: 614 [2022-11-22 00:19:47,612 INFO L226 Difference]: Without dead ends: 592 [2022-11-22 00:19:47,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 00:19:47,613 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 30 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:19:47,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 7 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:19:47,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-11-22 00:19:47,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2022-11-22 00:19:47,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 574 states have (on average 2.4059233449477353) internal successors, (1381), 591 states have internal predecessors, (1381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:47,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 1381 transitions. [2022-11-22 00:19:47,630 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 1381 transitions. Word has length 11 [2022-11-22 00:19:47,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:19:47,631 INFO L495 AbstractCegarLoop]: Abstraction has 592 states and 1381 transitions. [2022-11-22 00:19:47,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:47,631 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 1381 transitions. [2022-11-22 00:19:47,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 00:19:47,632 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:19:47,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:19:47,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 00:19:47,632 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-22 00:19:47,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:19:47,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1932122713, now seen corresponding path program 2 times [2022-11-22 00:19:47,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:19:47,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48638480] [2022-11-22 00:19:47,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:47,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:19:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:48,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:19:48,400 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:19:48,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48638480] [2022-11-22 00:19:48,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48638480] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:19:48,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:19:48,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:19:48,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610283648] [2022-11-22 00:19:48,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:19:48,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:19:48,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:19:48,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:19:48,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:19:48,402 INFO L87 Difference]: Start difference. First operand 592 states and 1381 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:48,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:19:48,655 INFO L93 Difference]: Finished difference Result 820 states and 1902 transitions. [2022-11-22 00:19:48,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:19:48,655 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-22 00:19:48,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:19:48,659 INFO L225 Difference]: With dead ends: 820 [2022-11-22 00:19:48,659 INFO L226 Difference]: Without dead ends: 820 [2022-11-22 00:19:48,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:19:48,660 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 46 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:19:48,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 23 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:19:48,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2022-11-22 00:19:48,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 581. [2022-11-22 00:19:48,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 563 states have (on average 2.408525754884547) internal successors, (1356), 580 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:48,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 1356 transitions. [2022-11-22 00:19:48,679 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 1356 transitions. Word has length 11 [2022-11-22 00:19:48,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:19:48,680 INFO L495 AbstractCegarLoop]: Abstraction has 581 states and 1356 transitions. [2022-11-22 00:19:48,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:48,680 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 1356 transitions. [2022-11-22 00:19:48,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-22 00:19:48,681 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:19:48,681 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:19:48,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 00:19:48,681 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-22 00:19:48,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:19:48,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1121752697, now seen corresponding path program 3 times [2022-11-22 00:19:48,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:19:48,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561969409] [2022-11-22 00:19:48,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:48,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:19:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:19:49,237 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:19:49,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561969409] [2022-11-22 00:19:49,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561969409] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:19:49,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:19:49,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 00:19:49,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77634929] [2022-11-22 00:19:49,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:19:49,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 00:19:49,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:19:49,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 00:19:49,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-22 00:19:49,239 INFO L87 Difference]: Start difference. First operand 581 states and 1356 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:49,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:19:49,519 INFO L93 Difference]: Finished difference Result 798 states and 1852 transitions. [2022-11-22 00:19:49,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:19:49,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-22 00:19:49,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:19:49,523 INFO L225 Difference]: With dead ends: 798 [2022-11-22 00:19:49,523 INFO L226 Difference]: Without dead ends: 798 [2022-11-22 00:19:49,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:19:49,524 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 46 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:19:49,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 27 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:19:49,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2022-11-22 00:19:49,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 570. [2022-11-22 00:19:49,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 552 states have (on average 2.411231884057971) internal successors, (1331), 569 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:49,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1331 transitions. [2022-11-22 00:19:49,551 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1331 transitions. Word has length 11 [2022-11-22 00:19:49,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:19:49,551 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 1331 transitions. [2022-11-22 00:19:49,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:49,552 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1331 transitions. [2022-11-22 00:19:49,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 00:19:49,553 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:19:49,553 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:19:49,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-22 00:19:49,553 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-22 00:19:49,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:19:49,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1796091972, now seen corresponding path program 1 times [2022-11-22 00:19:49,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:19:49,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941896810] [2022-11-22 00:19:49,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:49,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:19:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:49,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:19:49,610 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:19:49,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941896810] [2022-11-22 00:19:49,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941896810] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:19:49,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:19:49,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:19:49,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816240069] [2022-11-22 00:19:49,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:19:49,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:19:49,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:19:49,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:19:49,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:19:49,612 INFO L87 Difference]: Start difference. First operand 570 states and 1331 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:49,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:19:49,753 INFO L93 Difference]: Finished difference Result 606 states and 1406 transitions. [2022-11-22 00:19:49,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:19:49,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-22 00:19:49,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:19:49,757 INFO L225 Difference]: With dead ends: 606 [2022-11-22 00:19:49,757 INFO L226 Difference]: Without dead ends: 606 [2022-11-22 00:19:49,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:19:49,758 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 15 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:19:49,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 17 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:19:49,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2022-11-22 00:19:49,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2022-11-22 00:19:49,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 588 states have (on average 2.391156462585034) internal successors, (1406), 605 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:49,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1406 transitions. [2022-11-22 00:19:49,774 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1406 transitions. Word has length 13 [2022-11-22 00:19:49,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:19:49,774 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 1406 transitions. [2022-11-22 00:19:49,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:19:49,775 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1406 transitions. [2022-11-22 00:19:49,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 00:19:49,775 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:19:49,776 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:19:49,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-22 00:19:49,776 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-22 00:19:49,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:19:49,777 INFO L85 PathProgramCache]: Analyzing trace with hash -664587904, now seen corresponding path program 1 times [2022-11-22 00:19:49,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:19:49,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362555847] [2022-11-22 00:19:49,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:49,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:19:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:50,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:19:50,536 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:19:50,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362555847] [2022-11-22 00:19:50,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362555847] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:19:50,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269099858] [2022-11-22 00:19:50,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:19:50,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:19:50,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:19:50,541 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:19:50,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 00:19:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:19:50,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-22 00:19:50,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:19:50,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:19:50,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:19:50,867 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 00:19:50,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-22 00:19:50,883 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 00:19:50,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-22 00:19:51,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-22 00:19:51,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-22 00:19:51,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-22 00:19:51,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:19:51,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-22 00:19:51,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-22 00:19:51,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:19:51,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:19:52,006 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| Int) (v_ArrVal_470 (Array Int Int)) (v_ArrVal_472 Int) (v_ArrVal_468 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_468)) |c_~#stored_elements~0.base| v_ArrVal_470) |c_~#queue~0.base|))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| 4) |c_~#queue~0.offset|) v_ArrVal_472) (+ 1608 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (not (<= v_ArrVal_468 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))))) is different from false [2022-11-22 00:19:52,184 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_466 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| Int) (v_ArrVal_470 (Array Int Int)) (v_ArrVal_472 Int) (v_ArrVal_468 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_466) .cse1 v_ArrVal_468)) |c_~#stored_elements~0.base| v_ArrVal_470) |c_~#queue~0.base|))) (or (< (+ v_ArrVal_466 2147483648) 0) (< (+ (select .cse0 .cse1) 1) v_ArrVal_468) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< 0 (+ 2147483650 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| 4) |c_~#queue~0.offset|) v_ArrVal_472) (+ 1608 |c_~#queue~0.offset|)))))))) is different from false [2022-11-22 00:19:52,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-22 00:19:52,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269099858] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:19:52,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [126227578] [2022-11-22 00:19:52,860 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:19:52,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:19:52,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-22 00:19:52,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526666265] [2022-11-22 00:19:52,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:19:52,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-22 00:19:52,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:19:52,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-22 00:19:52,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=554, Unknown=19, NotChecked=102, Total=812 [2022-11-22 00:19:52,869 INFO L87 Difference]: Start difference. First operand 606 states and 1406 transitions. Second operand has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:20:04,905 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| Int) (v_ArrVal_470 (Array Int Int)) (v_ArrVal_472 Int) (v_ArrVal_468 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_468)) |c_~#stored_elements~0.base| v_ArrVal_470) |c_~#queue~0.base|))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| 4) |c_~#queue~0.offset|) v_ArrVal_472) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| (select .cse0 .cse2))) (not (<= v_ArrVal_468 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))))) (exists ((v_ArrVal_466 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_133| Int) (v_ArrVal_464 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_134| Int) (v_ArrVal_472 Int) (v_ArrVal_468 Int)) (let ((.cse6 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store (store (store ((as const (Array Int Int)) 0) (+ 1600 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) 0) .cse4 0) .cse6 0) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_133| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_464))) (and (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_133| 0) (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_134| v_ArrVal_468) (= (store (store (store .cse5 .cse6 v_ArrVal_466) .cse4 v_ArrVal_468) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_134| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_472) .cse3) (<= 0 (+ v_ArrVal_466 2147483648)) (<= v_ArrVal_468 (+ (select .cse5 .cse4) 1)))))) (= 5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| Int) (v_ArrVal_472 Int)) (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| (select .cse7 .cse2))) (< 0 (+ 2147483650 (select (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| 4) |c_~#queue~0.offset|) v_ArrVal_472) .cse1)))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| Int) (v_ArrVal_470 (Array Int Int)) (v_ArrVal_472 Int) (v_ArrVal_468 Int)) (let ((.cse8 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_468)) |c_~#stored_elements~0.base| v_ArrVal_470) |c_~#queue~0.base|))) (or (< (+ (select .cse3 .cse4) 1) v_ArrVal_468) (< 0 (+ 2147483650 (select (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| 4) |c_~#queue~0.offset|) v_ArrVal_472) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_135| (select .cse8 .cse2)))))))) is different from false [2022-11-22 00:20:06,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:20:06,343 INFO L93 Difference]: Finished difference Result 1232 states and 2868 transitions. [2022-11-22 00:20:06,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-22 00:20:06,344 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-22 00:20:06,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:20:06,348 INFO L225 Difference]: With dead ends: 1232 [2022-11-22 00:20:06,349 INFO L226 Difference]: Without dead ends: 1232 [2022-11-22 00:20:06,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=358, Invalid=1246, Unknown=48, NotChecked=240, Total=1892 [2022-11-22 00:20:06,350 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 275 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 1644 mSolverCounterSat, 67 mSolverCounterUnsat, 45 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 2029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1644 IncrementalHoareTripleChecker+Invalid, 45 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:20:06,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 186 Invalid, 2029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1644 Invalid, 45 Unknown, 273 Unchecked, 3.2s Time] [2022-11-22 00:20:06,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2022-11-22 00:20:06,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 717. [2022-11-22 00:20:06,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 699 states have (on average 2.400572246065808) internal successors, (1678), 716 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:20:06,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1678 transitions. [2022-11-22 00:20:06,381 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1678 transitions. Word has length 16 [2022-11-22 00:20:06,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:20:06,381 INFO L495 AbstractCegarLoop]: Abstraction has 717 states and 1678 transitions. [2022-11-22 00:20:06,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:20:06,382 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1678 transitions. [2022-11-22 00:20:06,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 00:20:06,383 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:20:06,383 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:20:06,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-22 00:20:06,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-22 00:20:06,590 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-22 00:20:06,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:20:06,590 INFO L85 PathProgramCache]: Analyzing trace with hash -664587903, now seen corresponding path program 1 times [2022-11-22 00:20:06,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:20:06,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100734678] [2022-11-22 00:20:06,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:20:06,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:20:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:20:07,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:20:07,893 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:20:07,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100734678] [2022-11-22 00:20:07,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100734678] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:20:07,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767062072] [2022-11-22 00:20:07,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:20:07,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:20:07,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:20:07,895 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:20:07,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 00:20:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:20:08,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-22 00:20:08,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:20:08,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:20:08,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:20:08,084 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 00:20:08,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-22 00:20:08,099 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 00:20:08,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-22 00:20:08,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-22 00:20:08,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-22 00:20:08,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-22 00:20:08,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:20:08,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-22 00:20:08,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-22 00:20:09,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:20:09,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:20:09,304 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_564 Int) (v_ArrVal_566 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| Int) (v_ArrVal_568 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_564)) |c_~#stored_elements~0.base| v_ArrVal_566) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_564 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| 4) |c_~#queue~0.offset|) v_ArrVal_568) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-22 00:20:12,321 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_564 Int) (v_ArrVal_562 Int) (v_ArrVal_561 Int) (v_ArrVal_566 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| Int) (v_ArrVal_568 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_561)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_562) .cse2 v_ArrVal_564)) |c_~#stored_elements~0.base| v_ArrVal_566) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_562) (< (+ (select .cse0 .cse2) 1) v_ArrVal_564) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| (select .cse3 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| 4) |c_~#queue~0.offset|) v_ArrVal_568) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-22 00:20:20,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-22 00:20:20,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767062072] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:20:20,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [482124042] [2022-11-22 00:20:20,832 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:20:20,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:20:20,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2022-11-22 00:20:20,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694520009] [2022-11-22 00:20:20,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:20:20,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-22 00:20:20,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:20:20,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-22 00:20:20,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=674, Unknown=23, NotChecked=118, Total=1056 [2022-11-22 00:20:20,836 INFO L87 Difference]: Start difference. First operand 717 states and 1678 transitions. Second operand has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:20:25,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:20:27,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:20:27,616 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (+ (select .cse4 .cse5) 1)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_564 Int) (v_ArrVal_566 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| Int) (v_ArrVal_568 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_564)) |c_~#stored_elements~0.base| v_ArrVal_566) |c_~#queue~0.base|))) (or (< .cse0 v_ArrVal_564) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| 4) |c_~#queue~0.offset|) v_ArrVal_568) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| (select .cse1 .cse3)))))) (forall ((v_ArrVal_564 Int) (v_ArrVal_562 Int) (v_ArrVal_566 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| Int) (v_ArrVal_568 Int)) (let ((.cse6 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_562) .cse5 v_ArrVal_564)) |c_~#stored_elements~0.base| v_ArrVal_566) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_562 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< .cse0 v_ArrVal_564) (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| 4) |c_~#queue~0.offset|) v_ArrVal_568) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| (select .cse6 .cse3))))))))) is different from false [2022-11-22 00:20:28,268 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (and (forall ((v_ArrVal_564 Int) (v_ArrVal_566 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| Int) (v_ArrVal_568 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_564)) |c_~#stored_elements~0.base| v_ArrVal_566) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_564 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| 4) |c_~#queue~0.offset|) v_ArrVal_568) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| (select .cse0 .cse2)))))) (forall ((v_ArrVal_564 Int) (v_ArrVal_566 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| Int) (v_ArrVal_568 Int)) (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_564)) |c_~#stored_elements~0.base| v_ArrVal_566) |c_~#queue~0.base|))) (or (< (+ (select .cse3 .cse4) 1) v_ArrVal_564) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| 4) |c_~#queue~0.offset|) v_ArrVal_568) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_140| (select .cse5 .cse2)))))))) is different from false [2022-11-22 00:20:29,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:20:29,097 INFO L93 Difference]: Finished difference Result 740 states and 1709 transitions. [2022-11-22 00:20:29,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-22 00:20:29,098 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-22 00:20:29,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:20:29,101 INFO L225 Difference]: With dead ends: 740 [2022-11-22 00:20:29,101 INFO L226 Difference]: Without dead ends: 740 [2022-11-22 00:20:29,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=464, Invalid=1249, Unknown=25, NotChecked=332, Total=2070 [2022-11-22 00:20:29,102 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 72 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 32 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-11-22 00:20:29,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 147 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1064 Invalid, 18 Unknown, 192 Unchecked, 7.0s Time] [2022-11-22 00:20:29,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2022-11-22 00:20:29,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 717. [2022-11-22 00:20:29,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 699 states have (on average 2.3977110157367667) internal successors, (1676), 716 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:20:29,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1676 transitions. [2022-11-22 00:20:29,121 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1676 transitions. Word has length 16 [2022-11-22 00:20:29,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:20:29,122 INFO L495 AbstractCegarLoop]: Abstraction has 717 states and 1676 transitions. [2022-11-22 00:20:29,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:20:29,122 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1676 transitions. [2022-11-22 00:20:29,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 00:20:29,123 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:20:29,123 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:20:29,133 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-22 00:20:29,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-22 00:20:29,329 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-22 00:20:29,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:20:29,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1032688262, now seen corresponding path program 1 times [2022-11-22 00:20:29,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:20:29,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733452333] [2022-11-22 00:20:29,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:20:29,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:20:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:20:29,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:20:29,950 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:20:29,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733452333] [2022-11-22 00:20:29,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733452333] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:20:29,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884807442] [2022-11-22 00:20:29,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:20:29,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:20:29,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:20:29,955 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:20:29,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-22 00:20:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:20:30,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-22 00:20:30,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:20:30,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:20:30,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:20:30,151 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 00:20:30,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-22 00:20:30,180 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-22 00:20:30,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-22 00:20:30,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-22 00:20:30,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-22 00:20:30,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-22 00:20:30,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-22 00:20:30,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:20:30,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-22 00:20:30,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-22 00:20:31,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:20:31,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:20:31,496 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_669 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| Int) (v_ArrVal_671 Int) (v_ArrVal_667 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_667)) |c_~#stored_elements~0.base| v_ArrVal_669) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_667) (< 0 (+ 2147483650 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| 4) |c_~#queue~0.offset|) v_ArrVal_671) (+ 1608 |c_~#queue~0.offset|)))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| (select .cse2 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-22 00:20:31,556 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_665 Int) (v_ArrVal_669 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| Int) (v_ArrVal_671 Int) (v_ArrVal_667 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_665) .cse1 v_ArrVal_667)) |c_~#stored_elements~0.base| v_ArrVal_669) |c_~#queue~0.base|))) (or (< (+ v_ArrVal_665 2147483648) 0) (< (+ (select .cse0 .cse1) 1) v_ArrVal_667) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< 0 (+ 2147483650 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| 4) |c_~#queue~0.offset|) v_ArrVal_671) (+ 1608 |c_~#queue~0.offset|)))))))) is different from false [2022-11-22 00:20:31,620 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_665 Int) (v_ArrVal_664 Int) (v_ArrVal_669 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| Int) (v_ArrVal_671 Int) (v_ArrVal_667 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_664)) (.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_665) .cse1 v_ArrVal_667)) |c_~#stored_elements~0.base| v_ArrVal_669) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_667) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (+ v_ArrVal_665 2147483648) 0) (< 0 (+ (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_145| 4) |c_~#queue~0.offset|) v_ArrVal_671) (+ 1608 |c_~#queue~0.offset|)) 2147483650)))))) is different from false [2022-11-22 00:20:32,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-22 00:20:32,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884807442] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:20:32,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1772301446] [2022-11-22 00:20:32,917 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:20:32,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:20:32,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 27 [2022-11-22 00:20:32,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422496785] [2022-11-22 00:20:32,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:20:32,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-22 00:20:32,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:20:32,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-22 00:20:32,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=493, Unknown=18, NotChecked=150, Total=812 [2022-11-22 00:20:32,920 INFO L87 Difference]: Start difference. First operand 717 states and 1676 transitions. Second operand has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 28 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:20:37,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:21:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:21:03,039 INFO L93 Difference]: Finished difference Result 2417 states and 5678 transitions. [2022-11-22 00:21:03,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-22 00:21:03,039 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 28 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-22 00:21:03,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:21:03,047 INFO L225 Difference]: With dead ends: 2417 [2022-11-22 00:21:03,047 INFO L226 Difference]: Without dead ends: 2417 [2022-11-22 00:21:03,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 26.2s TimeCoverageRelationStatistics Valid=631, Invalid=1809, Unknown=22, NotChecked=294, Total=2756 [2022-11-22 00:21:03,049 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 1250 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 157 mSolverCounterUnsat, 37 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 2113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 37 IncrementalHoareTripleChecker+Unknown, 559 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-11-22 00:21:03,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1250 Valid, 174 Invalid, 2113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1360 Invalid, 37 Unknown, 559 Unchecked, 5.9s Time] [2022-11-22 00:21:03,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2022-11-22 00:21:03,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 987. [2022-11-22 00:21:03,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 969 states have (on average 2.57172342621259) internal successors, (2492), 986 states have internal predecessors, (2492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:21:03,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 2492 transitions. [2022-11-22 00:21:03,087 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 2492 transitions. Word has length 17 [2022-11-22 00:21:03,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:21:03,087 INFO L495 AbstractCegarLoop]: Abstraction has 987 states and 2492 transitions. [2022-11-22 00:21:03,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 28 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:21:03,088 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 2492 transitions. [2022-11-22 00:21:03,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 00:21:03,089 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:21:03,089 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:21:03,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-22 00:21:03,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-22 00:21:03,295 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-22 00:21:03,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:21:03,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1032688261, now seen corresponding path program 1 times [2022-11-22 00:21:03,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:21:03,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031178768] [2022-11-22 00:21:03,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:21:03,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:21:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:21:04,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:21:04,409 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:21:04,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031178768] [2022-11-22 00:21:04,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031178768] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:21:04,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857737639] [2022-11-22 00:21:04,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:21:04,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:21:04,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:21:04,413 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:21:04,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 00:21:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:21:04,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-22 00:21:04,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:21:04,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:21:04,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:21:04,616 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 00:21:04,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-22 00:21:04,640 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-22 00:21:04,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-22 00:21:04,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-22 00:21:04,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-22 00:21:05,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-22 00:21:05,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-22 00:21:05,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:21:05,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-22 00:21:05,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-22 00:21:05,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:21:05,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:21:05,815 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_774 Int) (v_ArrVal_772 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_772) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| 4) |c_~#queue~0.offset|) v_ArrVal_774) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-22 00:21:05,839 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_774 Int) (v_ArrVal_771 Int) (v_ArrVal_772 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| 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_771)) |c_~#stored_elements~0.base| v_ArrVal_772) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| 4) |c_~#queue~0.offset|) v_ArrVal_774) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (not (<= v_ArrVal_771 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))))) is different from false [2022-11-22 00:21:06,138 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_774 Int) (v_ArrVal_771 Int) (v_ArrVal_768 Int) (v_ArrVal_772 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.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 .cse3 v_ArrVal_768) .cse1 v_ArrVal_771)) |c_~#stored_elements~0.base| v_ArrVal_772) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_771) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| 4) |c_~#queue~0.offset|) v_ArrVal_774) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse0 .cse3) 1) v_ArrVal_768) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| (select .cse2 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-22 00:21:06,187 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_774 Int) (v_ArrVal_771 Int) (v_ArrVal_768 Int) (v_ArrVal_772 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| Int) (v_ArrVal_766 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_766)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_768) .cse3 v_ArrVal_771)) |c_~#stored_elements~0.base| v_ArrVal_772) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_768) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_771) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| 4) |c_~#queue~0.offset|) v_ArrVal_774) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-22 00:21:10,518 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_765 (Array Int Int)) (v_ArrVal_774 Int) (v_ArrVal_771 Int) (v_ArrVal_768 Int) (v_ArrVal_772 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_151| Int) (v_ArrVal_766 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_765))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_151| 4) |c_~#queue~0.offset|) v_ArrVal_766)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_768) .cse1 v_ArrVal_771)) |c_~#stored_elements~0.base| v_ArrVal_772) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_151| (select .cse0 .cse1))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| 4) |c_~#queue~0.offset|) v_ArrVal_774) .cse3) 2147483647) (< (+ 1 (select .cse4 .cse1)) v_ArrVal_771) (< (+ (select .cse4 .cse3) 1) v_ArrVal_768) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| (select .cse2 .cse1))))))))) is different from false [2022-11-22 00:21:10,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-22 00:21:10,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857737639] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:21:10,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1826972414] [2022-11-22 00:21:10,561 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:21:10,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:21:10,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-22 00:21:10,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079680124] [2022-11-22 00:21:10,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:21:10,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-22 00:21:10,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:21:10,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-22 00:21:10,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=691, Unknown=17, NotChecked=310, Total=1260 [2022-11-22 00:21:10,565 INFO L87 Difference]: Start difference. First operand 987 states and 2492 transitions. Second operand has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:21:15,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:21:16,106 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (and (forall ((v_ArrVal_774 Int) (v_ArrVal_771 Int) (v_ArrVal_772 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_771)) |c_~#stored_elements~0.base| v_ArrVal_772) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_771) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| 4) |c_~#queue~0.offset|) v_ArrVal_774) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| (select .cse2 .cse4)))))) (forall ((v_ArrVal_774 Int) (v_ArrVal_771 Int) (v_ArrVal_772 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| Int)) (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_771)) |c_~#stored_elements~0.base| v_ArrVal_772) |c_~#queue~0.base|))) (or (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| 4) |c_~#queue~0.offset|) v_ArrVal_774) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| (select .cse5 .cse4))) (not (<= v_ArrVal_771 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))))))) is different from false [2022-11-22 00:21:18,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:21:19,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:21:19,242 INFO L93 Difference]: Finished difference Result 1484 states and 3624 transitions. [2022-11-22 00:21:19,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-22 00:21:19,243 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-22 00:21:19,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:21:19,247 INFO L225 Difference]: With dead ends: 1484 [2022-11-22 00:21:19,248 INFO L226 Difference]: Without dead ends: 1484 [2022-11-22 00:21:19,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=443, Invalid=1276, Unknown=27, NotChecked=510, Total=2256 [2022-11-22 00:21:19,249 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 409 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 48 mSolverCounterUnsat, 46 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 1938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 46 IncrementalHoareTripleChecker+Unknown, 527 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-11-22 00:21:19,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 185 Invalid, 1938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1317 Invalid, 46 Unknown, 527 Unchecked, 6.6s Time] [2022-11-22 00:21:19,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2022-11-22 00:21:19,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1083. [2022-11-22 00:21:19,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1065 states have (on average 2.564319248826291) internal successors, (2731), 1082 states have internal predecessors, (2731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:21:19,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 2731 transitions. [2022-11-22 00:21:19,280 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 2731 transitions. Word has length 17 [2022-11-22 00:21:19,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:21:19,280 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 2731 transitions. [2022-11-22 00:21:19,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:21:19,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 2731 transitions. [2022-11-22 00:21:19,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 00:21:19,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:21:19,282 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:21:19,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 00:21:19,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-22 00:21:19,489 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-22 00:21:19,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:21:19,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1825643676, now seen corresponding path program 2 times [2022-11-22 00:21:19,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:21:19,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77963675] [2022-11-22 00:21:19,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:21:19,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:21:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:21:20,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:21:20,668 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:21:20,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77963675] [2022-11-22 00:21:20,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77963675] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:21:20,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708473187] [2022-11-22 00:21:20,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 00:21:20,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:21:20,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:21:20,670 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:21:20,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-22 00:21:20,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 00:21:20,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:21:20,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-22 00:21:20,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:21:20,916 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-22 00:21:20,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-22 00:21:21,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 00:21:21,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:21:21,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-22 00:21:21,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-22 00:21:21,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:21:21,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-22 00:21:21,354 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-22 00:21:21,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-11-22 00:21:21,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:21:21,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:21:21,848 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:21:21,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 48 [2022-11-22 00:21:21,877 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:21:21,877 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 889 treesize of output 879 [2022-11-22 00:21:21,894 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 1410 treesize of output 1362 [2022-11-22 00:21:21,926 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 1554 treesize of output 1490 [2022-11-22 00:21:32,372 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 28 treesize of output 24 [2022-11-22 00:21:32,537 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:21:32,537 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 533 treesize of output 505 [2022-11-22 00:21:32,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:21:32,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708473187] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:21:32,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1687309726] [2022-11-22 00:21:32,720 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:21:32,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:21:32,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 26 [2022-11-22 00:21:32,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263002466] [2022-11-22 00:21:32,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:21:32,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-22 00:21:32,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:21:32,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-22 00:21:32,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=613, Unknown=13, NotChecked=0, Total=756 [2022-11-22 00:21:32,732 INFO L87 Difference]: Start difference. First operand 1083 states and 2731 transitions. Second operand has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:21:33,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:21:33,318 INFO L93 Difference]: Finished difference Result 1232 states and 3051 transitions. [2022-11-22 00:21:33,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 00:21:33,319 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-22 00:21:33,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:21:33,321 INFO L225 Difference]: With dead ends: 1232 [2022-11-22 00:21:33,321 INFO L226 Difference]: Without dead ends: 1232 [2022-11-22 00:21:33,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=181, Invalid=736, Unknown=13, NotChecked=0, Total=930 [2022-11-22 00:21:33,323 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 448 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-22 00:21:33,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 34 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-22 00:21:33,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2022-11-22 00:21:33,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 918. [2022-11-22 00:21:33,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 902 states have (on average 2.4789356984478936) internal successors, (2236), 917 states have internal predecessors, (2236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:21:33,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 2236 transitions. [2022-11-22 00:21:33,359 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 2236 transitions. Word has length 17 [2022-11-22 00:21:33,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:21:33,361 INFO L495 AbstractCegarLoop]: Abstraction has 918 states and 2236 transitions. [2022-11-22 00:21:33,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:21:33,361 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 2236 transitions. [2022-11-22 00:21:33,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 00:21:33,362 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:21:33,363 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:21:33,373 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-22 00:21:33,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-22 00:21:33,569 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-22 00:21:33,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:21:33,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1825643677, now seen corresponding path program 2 times [2022-11-22 00:21:33,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:21:33,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282714629] [2022-11-22 00:21:33,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:21:33,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:21:33,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:21:34,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:21:34,746 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:21:34,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282714629] [2022-11-22 00:21:34,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282714629] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:21:34,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861433363] [2022-11-22 00:21:34,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 00:21:34,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:21:34,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:21:34,749 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:21:34,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-22 00:21:34,959 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 00:21:34,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:21:34,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-22 00:21:34,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:21:34,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:21:34,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:21:34,999 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 00:21:35,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-22 00:21:35,027 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-22 00:21:35,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-22 00:21:35,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2022-11-22 00:21:35,356 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-11-22 00:21:35,440 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 60 treesize of output 62 [2022-11-22 00:21:35,609 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-11-22 00:21:35,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:21:35,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2022-11-22 00:21:35,846 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-11-22 00:21:35,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:21:35,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:21:36,196 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (v_ArrVal_963 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| Int) (v_ArrVal_964 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_962)) |c_~#stored_elements~0.base| v_ArrVal_963) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (not (<= v_ArrVal_962 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| 4) |c_~#queue~0.offset|) v_ArrVal_964) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-22 00:21:36,607 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (v_ArrVal_963 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| Int) (v_ArrVal_960 (Array Int Int)) (v_ArrVal_964 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_960))) (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_962)) |c_~#stored_elements~0.base| v_ArrVal_963) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_962) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| 4) |c_~#queue~0.offset|) v_ArrVal_964) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| (select .cse2 (+ |c_~#queue~0.offset| 1604))))))))) is different from false [2022-11-22 00:21:36,645 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (v_ArrVal_963 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| Int) (v_ArrVal_959 Int) (v_ArrVal_960 (Array Int Int)) (v_ArrVal_964 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_959)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_960))) (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_962)) |c_~#stored_elements~0.base| v_ArrVal_963) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_959 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ 1 (select .cse0 .cse1)) v_ArrVal_962) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| 4) |c_~#queue~0.offset|) v_ArrVal_964) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-22 00:21:36,689 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (v_ArrVal_963 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| Int) (v_ArrVal_959 Int) (v_ArrVal_960 (Array Int Int)) (v_ArrVal_964 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_959)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_960))) (let ((.cse0 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_962)) |c_~#stored_elements~0.base| v_ArrVal_963) |c_~#queue~0.base|))) (or (< (+ 1 (select .cse0 .cse1)) v_ArrVal_962) (< (+ (select .cse2 .cse3) 1) v_ArrVal_959) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| (select .cse4 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| 4) |c_~#queue~0.offset|) v_ArrVal_964) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2022-11-22 00:21:36,728 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_962 Int) (v_ArrVal_963 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| Int) (v_ArrVal_959 Int) (v_ArrVal_957 Int) (v_ArrVal_960 (Array Int Int)) (v_ArrVal_964 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_957)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (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))) (let ((.cse0 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_962)) |c_~#stored_elements~0.base| v_ArrVal_963) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_962) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_959) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| 4) |c_~#queue~0.offset|) v_ArrVal_964) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2022-11-22 00:21:36,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-22 00:21:36,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861433363] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:21:36,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1129104210] [2022-11-22 00:21:36,949 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:21:36,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:21:36,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-22 00:21:36,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209115628] [2022-11-22 00:21:36,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:21:36,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-22 00:21:36,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:21:36,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-22 00:21:36,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=663, Unknown=22, NotChecked=310, Total=1260 [2022-11-22 00:21:36,952 INFO L87 Difference]: Start difference. First operand 918 states and 2236 transitions. Second operand has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:21:39,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:21:41,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:21:43,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:21:45,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:21:47,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:21:49,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-11-22 00:21:51,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:21:53,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:21:55,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:21:57,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:21:59,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:22:02,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:22:04,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:22:06,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:22:08,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:22:10,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:22:12,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:22:14,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:22:16,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:22:18,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:22:20,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:22:22,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:22:24,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:22:26,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:22:28,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:22:40,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:22:41,195 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_ArrVal_963 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| Int) (v_ArrVal_964 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_962)) |c_~#stored_elements~0.base| v_ArrVal_963) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| 4) |c_~#queue~0.offset|) v_ArrVal_964) .cse2) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_962)))) (forall ((v_ArrVal_962 Int) (v_ArrVal_963 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| Int) (v_ArrVal_964 Int)) (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_962)) |c_~#stored_elements~0.base| v_ArrVal_963) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| (select .cse5 .cse1))) (not (<= v_ArrVal_962 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_159| 4) |c_~#queue~0.offset|) v_ArrVal_964) .cse2) 2147483647)))))) is different from false [2022-11-22 00:22:43,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:22:43,371 INFO L93 Difference]: Finished difference Result 1508 states and 3628 transitions. [2022-11-22 00:22:43,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-22 00:22:43,372 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-22 00:22:43,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:22:43,376 INFO L225 Difference]: With dead ends: 1508 [2022-11-22 00:22:43,376 INFO L226 Difference]: Without dead ends: 1508 [2022-11-22 00:22:43,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=430, Invalid=1127, Unknown=27, NotChecked=486, Total=2070 [2022-11-22 00:22:43,378 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 480 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 61 mSolverCounterUnsat, 99 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 1969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 99 IncrementalHoareTripleChecker+Unknown, 764 IncrementalHoareTripleChecker+Unchecked, 56.4s IncrementalHoareTripleChecker+Time [2022-11-22 00:22:43,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 167 Invalid, 1969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1045 Invalid, 99 Unknown, 764 Unchecked, 56.4s Time] [2022-11-22 00:22:43,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2022-11-22 00:22:43,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 980. [2022-11-22 00:22:43,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 964 states have (on average 2.5051867219917012) internal successors, (2415), 979 states have internal predecessors, (2415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:22:43,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 2415 transitions. [2022-11-22 00:22:43,405 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 2415 transitions. Word has length 17 [2022-11-22 00:22:43,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:22:43,406 INFO L495 AbstractCegarLoop]: Abstraction has 980 states and 2415 transitions. [2022-11-22 00:22:43,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:22:43,406 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 2415 transitions. [2022-11-22 00:22:43,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 00:22:43,407 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:22:43,407 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:22:43,413 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-22 00:22:43,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-22 00:22:43,613 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-22 00:22:43,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:22:43,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1166113847, now seen corresponding path program 3 times [2022-11-22 00:22:43,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:22:43,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122963758] [2022-11-22 00:22:43,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:22:43,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:22:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:22:45,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:22:45,567 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:22:45,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122963758] [2022-11-22 00:22:45,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122963758] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:22:45,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048598136] [2022-11-22 00:22:45,567 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 00:22:45,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:22:45,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:22:45,571 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:22:45,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 00:22:45,749 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 00:22:45,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:22:45,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-22 00:22:45,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:22:45,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:22:45,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:22:45,792 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 00:22:45,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-22 00:22:45,820 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-22 00:22:45,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-22 00:22:45,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-22 00:22:46,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-22 00:22:46,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-22 00:22:46,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-22 00:22:46,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:22:46,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-22 00:22:46,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-22 00:22:46,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:22:46,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:22:47,048 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| Int) (v_ArrVal_1066 Int) (v_ArrVal_1065 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1065) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| 4) |c_~#queue~0.offset|) v_ArrVal_1066) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-22 00:22:47,060 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| Int) (v_ArrVal_1066 Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1064 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1064) |c_~#stored_elements~0.base| v_ArrVal_1065) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| 4) |c_~#queue~0.offset|) v_ArrVal_1066) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| (select .cse0 (+ |c_~#queue~0.offset| 1604))))))) is different from false [2022-11-22 00:23:17,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:23:17,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048598136] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:23:17,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1049196881] [2022-11-22 00:23:17,305 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:23:17,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:23:17,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-11-22 00:23:17,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276363767] [2022-11-22 00:23:17,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:23:17,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-22 00:23:17,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:23:17,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-22 00:23:17,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=801, Unknown=37, NotChecked=126, Total=1190 [2022-11-22 00:23:17,307 INFO L87 Difference]: Start difference. First operand 980 states and 2415 transitions. Second operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:23:21,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:23:22,278 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ (select .cse7 .cse8) 1)) (.cse10 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| 4)) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_165| Int) (v_ArrVal_1063 Int) (v_ArrVal_1066 Int) (v_ArrVal_1058 Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1060 Int)) (let ((.cse0 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_165| 4) |c_~#queue~0.offset|) v_ArrVal_1058))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1060) .cse1 v_ArrVal_1063)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1064) |c_~#stored_elements~0.base| v_ArrVal_1065) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1063) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| 4) |c_~#queue~0.offset|) v_ArrVal_1066) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_165| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| (select .cse2 .cse1))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_1060))))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| Int) (v_ArrVal_1063 Int) (v_ArrVal_1066 Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1064 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse7 .cse8 v_ArrVal_1063)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1064) |c_~#stored_elements~0.base| v_ArrVal_1065) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| (select .cse5 .cse1))) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| 4) |c_~#queue~0.offset|) v_ArrVal_1066) .cse3) 2147483647) (< .cse6 v_ArrVal_1063)))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| Int) (v_ArrVal_1063 Int) (v_ArrVal_1066 Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1060 Int)) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 .cse10 v_ArrVal_1060) .cse8 v_ArrVal_1063)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1064) |c_~#stored_elements~0.base| v_ArrVal_1065) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| (select .cse9 .cse1))) (< (+ (select .cse7 .cse10) 1) v_ArrVal_1060) (< (select (store .cse9 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_164| 4) |c_~#queue~0.offset|) v_ArrVal_1066) .cse3) 2147483647) (< .cse6 v_ArrVal_1063)))) (= |c_~#queue~0.offset| 0) (exists ((v_ArrVal_1063 Int) (v_ArrVal_1066 Int) (v_ArrVal_1058 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_162| Int) (v_ArrVal_1060 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_163| Int)) (let ((.cse11 (store (store (store (store ((as const (Array Int Int)) 0) (+ 1600 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) 0) .cse8 0) .cse10 0) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_162| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1058))) (and (= .cse7 (store (store (store .cse11 .cse10 v_ArrVal_1060) .cse8 v_ArrVal_1063) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_163| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1066)) (<= v_ArrVal_1063 (+ (select .cse11 .cse8) 1)) (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_163| v_ArrVal_1063) (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_162| 0) (<= v_ArrVal_1060 (+ 1 (select .cse11 .cse10)))))) (= 5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (let ((.cse13 (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#queue~0.base|))) (or (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base|))) (and (<= (* (select .cse12 1604) 4) 4) .cse13 (not (= |c_ULTIMATE.start_main_~#id2~0#1.offset| 1604)) (<= (select .cse12 1608) 1) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_~#stored_elements~0.base|)) (not (= 1608 |c_ULTIMATE.start_main_~#id2~0#1.offset|)))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (<= (select .cse4 1608) 1) (not .cse13) (<= (select .cse4 1604) 1))))))) is different from false [2022-11-22 00:23:26,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:23:28,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:23:29,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:23:31,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:23:35,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:23:37,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:23:44,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:23:47,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:23:49,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:23:51,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:23:59,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:24:01,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:24:03,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:24:05,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:24:05,115 INFO L93 Difference]: Finished difference Result 1879 states and 4513 transitions. [2022-11-22 00:24:05,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-22 00:24:05,116 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-22 00:24:05,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:24:05,121 INFO L225 Difference]: With dead ends: 1879 [2022-11-22 00:24:05,121 INFO L226 Difference]: Without dead ends: 1879 [2022-11-22 00:24:05,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 41.6s TimeCoverageRelationStatistics Valid=466, Invalid=1553, Unknown=63, NotChecked=270, Total=2352 [2022-11-22 00:24:05,123 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 696 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 89 mSolverCounterUnsat, 177 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 2130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 177 IncrementalHoareTripleChecker+Unknown, 526 IncrementalHoareTripleChecker+Unchecked, 37.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:24:05,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 192 Invalid, 2130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1338 Invalid, 177 Unknown, 526 Unchecked, 37.3s Time] [2022-11-22 00:24:05,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2022-11-22 00:24:05,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 994. [2022-11-22 00:24:05,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 978 states have (on average 2.516359918200409) internal successors, (2461), 993 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:24:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 2461 transitions. [2022-11-22 00:24:05,153 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 2461 transitions. Word has length 17 [2022-11-22 00:24:05,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:24:05,154 INFO L495 AbstractCegarLoop]: Abstraction has 994 states and 2461 transitions. [2022-11-22 00:24:05,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:24:05,154 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 2461 transitions. [2022-11-22 00:24:05,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 00:24:05,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:24:05,155 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:24:05,166 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-22 00:24:05,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:24:05,362 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-22 00:24:05,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:24:05,362 INFO L85 PathProgramCache]: Analyzing trace with hash 872614217, now seen corresponding path program 4 times [2022-11-22 00:24:05,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:24:05,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428765721] [2022-11-22 00:24:05,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:24:05,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:24:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:24:55,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:24:55,745 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:24:55,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428765721] [2022-11-22 00:24:55,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428765721] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:24:55,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762981202] [2022-11-22 00:24:55,746 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-22 00:24:55,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:24:55,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:24:55,747 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:24:55,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-22 00:24:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:24:55,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-22 00:24:55,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:24:55,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:24:55,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:24:55,968 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 00:24:55,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-22 00:24:55,991 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-22 00:24:55,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-22 00:24:56,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-22 00:24:56,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-11-22 00:24:56,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-22 00:24:57,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:24:57,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-22 00:24:57,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-22 00:24:57,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2022-11-22 00:24:58,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:24:58,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:24:58,482 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1170 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1170) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647)) is different from false [2022-11-22 00:24:58,834 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1170 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1168 Int)) (let ((.cse1 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1167))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| 4) |c_~#queue~0.offset|) v_ArrVal_1168)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1170) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-22 00:24:58,856 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1170 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| Int) (v_ArrVal_1166 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1168 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_1166)) |c_~#stored_elements~0.base| v_ArrVal_1167))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (not (<= v_ArrVal_1166 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| 4) |c_~#queue~0.offset|) v_ArrVal_1168)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1170) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-22 00:24:59,132 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1164 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| Int) (v_ArrVal_1166 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1168 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1164) .cse3 v_ArrVal_1166)) |c_~#stored_elements~0.base| v_ArrVal_1167))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1164 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| 4) |c_~#queue~0.offset|) v_ArrVal_1168)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1170) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| (select .cse1 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1166)))))) is different from false [2022-11-22 00:24:59,456 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1161 Int) (v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1164 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| Int) (v_ArrVal_1166 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1168 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1161)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_1164) .cse4 v_ArrVal_1166)) |c_~#stored_elements~0.base| v_ArrVal_1167))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| 4) |c_~#queue~0.offset|) v_ArrVal_1168)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1170) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1164) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| (select .cse1 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse2 .cse4) 1) v_ArrVal_1166)))))) is different from false [2022-11-22 00:25:05,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-22 00:25:05,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762981202] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:25:05,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [967803130] [2022-11-22 00:25:05,837 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:25:05,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:25:05,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-22 00:25:05,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99592071] [2022-11-22 00:25:05,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:25:05,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-22 00:25:05,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:25:05,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-22 00:25:05,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=729, Unknown=20, NotChecked=310, Total=1260 [2022-11-22 00:25:05,840 INFO L87 Difference]: Start difference. First operand 994 states and 2461 transitions. Second operand has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:26:00,911 WARN L233 SmtUtils]: Spent 11.36s on a formula simplification. DAG size of input: 236 DAG size of output: 189 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:26:20,980 WARN L233 SmtUtils]: Spent 15.15s on a formula simplification. DAG size of input: 237 DAG size of output: 187 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:26:24,334 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) (.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse8 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (select .cse4 .cse8)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse12 (+ (select .cse3 .cse1) 1)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (exists ((v_ArrVal_1161 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_168| Int) (v_ArrVal_1164 Int) (v_ArrVal_1166 Int) (v_ArrVal_1168 Int)) (let ((.cse0 (store (store (store (store ((as const (Array Int Int)) 0) (+ 1600 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) 0) .cse1 0) .cse2 0) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1161))) (and (<= v_ArrVal_1166 (+ (select .cse0 .cse1) 1)) (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_168| v_ArrVal_1166) (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_167| 0) (<= v_ArrVal_1164 (+ (select .cse0 .cse2) 1)) (= .cse3 (store (store (store .cse0 .cse2 v_ArrVal_1164) .cse1 v_ArrVal_1166) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_168| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1168))))) (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| 5)) (forall ((v_ArrVal_1170 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| Int) (v_ArrVal_1168 Int)) (or (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| 4) |c_~#queue~0.offset|) v_ArrVal_1168)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1170) |c_~#queue~0.base|) .cse5) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| .cse6)))) (forall ((v_ArrVal_1161 Int) (v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1164 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| Int) (v_ArrVal_1166 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1168 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| Int)) (let ((.cse7 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| 4)) v_ArrVal_1161))) (let ((.cse10 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse5 v_ArrVal_1164) .cse8 v_ArrVal_1166)) |c_~#stored_elements~0.base| v_ArrVal_1167))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|))) (or (< (+ (select .cse7 .cse8) 1) v_ArrVal_1166) (< (+ (select .cse7 .cse5) 1) v_ArrVal_1164) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_170| .cse6)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| (select .cse9 .cse8))) (< (select (select (store (store .cse10 |c_~#queue~0.base| (store .cse9 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| 4) |c_~#queue~0.offset|) v_ArrVal_1168)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1170) |c_~#queue~0.base|) .cse5) 2147483647)))))) (= 5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (forall ((v_ArrVal_1170 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| Int) (v_ArrVal_1166 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1168 Int)) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse1 v_ArrVal_1166)) |c_~#stored_elements~0.base| v_ArrVal_1167))) (let ((.cse11 (select .cse13 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| (select .cse11 .cse8))) (< .cse12 v_ArrVal_1166) (< (select (select (store (store .cse13 |c_~#queue~0.base| (store .cse11 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| 4) |c_~#queue~0.offset|) v_ArrVal_1168)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1170) |c_~#queue~0.base|) .cse5) 2147483647))))) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1164 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| Int) (v_ArrVal_1166 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1168 Int)) (let ((.cse14 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 .cse2 v_ArrVal_1164) .cse1 v_ArrVal_1166)) |c_~#stored_elements~0.base| v_ArrVal_1167))) (let ((.cse15 (select .cse14 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse14 |c_~#queue~0.base| (store .cse15 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| 4) |c_~#queue~0.offset|) v_ArrVal_1168)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1170) |c_~#queue~0.base|) .cse5) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| (select .cse15 .cse8))) (< .cse12 v_ArrVal_1166) (< (+ (select .cse3 .cse2) 1) v_ArrVal_1164)))))))) is different from false [2022-11-22 00:26:44,579 WARN L233 SmtUtils]: Spent 9.00s on a formula simplification. DAG size of input: 231 DAG size of output: 163 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:26:47,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:26:49,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:26:53,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:26:56,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:26:57,401 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (and (forall ((v_ArrVal_1170 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| Int) (v_ArrVal_1166 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1168 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1166)) |c_~#stored_elements~0.base| v_ArrVal_1167))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| (select .cse0 .cse1))) (not (<= v_ArrVal_1166 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| 4) |c_~#queue~0.offset|) v_ArrVal_1168)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1170) |c_~#queue~0.base|) .cse3) 2147483647))))) (forall ((v_ArrVal_1170 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| Int) (v_ArrVal_1166 Int) (v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1168 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1166)) |c_~#stored_elements~0.base| v_ArrVal_1167))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| (select .cse6 .cse1))) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1166) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| 4) |c_~#queue~0.offset|) v_ArrVal_1168)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1170) |c_~#queue~0.base|) .cse3) 2147483647))))))) is different from false [2022-11-22 00:26:59,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:27:02,554 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (< (select .cse0 .cse1) 2147483647) (forall ((v_ArrVal_1170 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| Int) (v_ArrVal_1168 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| 4) |c_~#queue~0.offset|) v_ArrVal_1168)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1170) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_169| (select .cse2 (+ |c_~#queue~0.offset| 1604))))))) (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1168 Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1168)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1170) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse1) 2147483647)))) is different from false [2022-11-22 00:27:05,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:27:05,146 INFO L93 Difference]: Finished difference Result 2052 states and 4984 transitions. [2022-11-22 00:27:05,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-22 00:27:05,147 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-22 00:27:05,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:27:05,162 INFO L225 Difference]: With dead ends: 2052 [2022-11-22 00:27:05,163 INFO L226 Difference]: Without dead ends: 2052 [2022-11-22 00:27:05,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 101.2s TimeCoverageRelationStatistics Valid=715, Invalid=2358, Unknown=39, NotChecked=920, Total=4032 [2022-11-22 00:27:05,168 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 961 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 136 mSolverCounterUnsat, 101 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 2572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 101 IncrementalHoareTripleChecker+Unknown, 1020 IncrementalHoareTripleChecker+Unchecked, 31.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:27:05,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [961 Valid, 195 Invalid, 2572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1315 Invalid, 101 Unknown, 1020 Unchecked, 31.1s Time] [2022-11-22 00:27:05,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2052 states. [2022-11-22 00:27:05,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 959. [2022-11-22 00:27:05,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 943 states have (on average 2.5100742311770943) internal successors, (2367), 958 states have internal predecessors, (2367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:27:05,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 2367 transitions. [2022-11-22 00:27:05,208 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 2367 transitions. Word has length 17 [2022-11-22 00:27:05,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:27:05,209 INFO L495 AbstractCegarLoop]: Abstraction has 959 states and 2367 transitions. [2022-11-22 00:27:05,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:27:05,209 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 2367 transitions. [2022-11-22 00:27:05,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 00:27:05,213 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:27:05,213 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:27:05,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-22 00:27:05,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:27:05,421 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-22 00:27:05,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:27:05,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1281233078, now seen corresponding path program 1 times [2022-11-22 00:27:05,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:27:05,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291675322] [2022-11-22 00:27:05,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:27:05,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:27:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:27:06,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:27:06,819 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:27:06,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291675322] [2022-11-22 00:27:06,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291675322] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:27:06,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476149846] [2022-11-22 00:27:06,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:27:06,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:27:06,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:27:06,821 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:27:06,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-22 00:27:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:27:06,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-22 00:27:07,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:27:07,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:27:07,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:27:07,042 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 00:27:07,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-22 00:27:07,068 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-22 00:27:07,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-22 00:27:07,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-22 00:27:07,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-22 00:27:07,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-22 00:27:07,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:27:07,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 45 treesize of output 47 [2022-11-22 00:27:07,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-22 00:27:08,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2022-11-22 00:27:08,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:27:08,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:27:08,903 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1273 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1273) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647)) is different from false [2022-11-22 00:27:09,067 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1272 Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1270 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| Int)) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1270))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| 4) |c_~#queue~0.offset|) v_ArrVal_1272)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1273) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| (select .cse1 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-22 00:27:09,092 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1272 Int) (v_ArrVal_1268 Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1270 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| 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_1268)) |c_~#stored_elements~0.base| v_ArrVal_1270))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1268 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| 4) |c_~#queue~0.offset|) v_ArrVal_1272)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1273) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| (select .cse1 (+ |c_~#queue~0.offset| 1604)))))))) is different from false [2022-11-22 00:27:10,006 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1272 Int) (v_ArrVal_1266 Int) (v_ArrVal_1268 Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1270 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1266) .cse2 v_ArrVal_1268)) |c_~#stored_elements~0.base| v_ArrVal_1270))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1268) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| 4) |c_~#queue~0.offset|) v_ArrVal_1272)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1273) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_1266 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)))))))) is different from false [2022-11-22 00:27:11,063 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1272 Int) (v_ArrVal_1266 Int) (v_ArrVal_1265 Int) (v_ArrVal_1268 Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1270 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1265)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_1266) .cse4 v_ArrVal_1268)) |c_~#stored_elements~0.base| v_ArrVal_1270))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| 4) |c_~#queue~0.offset|) v_ArrVal_1272)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1273) |c_~#queue~0.base|) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1266) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| (select .cse1 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse2 .cse4) 1) v_ArrVal_1268)))))) is different from false [2022-11-22 00:27:17,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-22 00:27:17,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476149846] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:27:17,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [944433882] [2022-11-22 00:27:17,592 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:27:17,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:27:17,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2022-11-22 00:27:17,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115951806] [2022-11-22 00:27:17,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:27:17,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-22 00:27:17,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:27:17,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-22 00:27:17,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=664, Unknown=26, NotChecked=310, Total=1260 [2022-11-22 00:27:17,595 INFO L87 Difference]: Start difference. First operand 959 states and 2367 transitions. Second operand has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 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-11-22 00:27:31,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:27:33,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:27:35,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:27:37,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:27:39,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:27:49,097 WARN L233 SmtUtils]: Spent 8.14s on a formula simplification. DAG size of input: 92 DAG size of output: 87 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:27:49,658 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (+ (select .cse5 .cse7) 1)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse8 (select .cse5 .cse6))) (and (not (= |c_ULTIMATE.start_main_~#id2~0#1.base| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (forall ((v_ArrVal_1272 Int) (v_ArrVal_1266 Int) (v_ArrVal_1268 Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1270 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1266) .cse7 v_ArrVal_1268)) |c_~#stored_elements~0.base| v_ArrVal_1270))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| (select .cse0 .cse1))) (< .cse2 v_ArrVal_1268) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| 4) |c_~#queue~0.offset|) v_ArrVal_1272)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1273) |c_~#queue~0.base|) .cse4) 2147483647) (not (<= v_ArrVal_1266 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))))))) (<= .cse8 1) (forall ((v_ArrVal_1272 Int) (v_ArrVal_1266 Int) (v_ArrVal_1268 Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1270 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| Int)) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_1266) .cse7 v_ArrVal_1268)) |c_~#stored_elements~0.base| v_ArrVal_1270))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| (select .cse9 .cse1))) (< .cse2 v_ArrVal_1268) (< (select (select (store (store .cse10 |c_~#queue~0.base| (store .cse9 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| 4) |c_~#queue~0.offset|) v_ArrVal_1272)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1273) |c_~#queue~0.base|) .cse4) 2147483647) (< (+ .cse8 1) v_ArrVal_1266)))))))) is different from false [2022-11-22 00:27:52,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:27:54,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:27:56,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:27:58,076 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (and (forall ((v_ArrVal_1272 Int) (v_ArrVal_1268 Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1270 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1268)) |c_~#stored_elements~0.base| v_ArrVal_1270))) (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1268) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| 4) |c_~#queue~0.offset|) v_ArrVal_1272)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1273) |c_~#queue~0.base|) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| (select .cse3 .cse5))))))) (forall ((v_ArrVal_1272 Int) (v_ArrVal_1268 Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1270 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| Int)) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1268)) |c_~#stored_elements~0.base| v_ArrVal_1270))) (let ((.cse7 (select .cse6 |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1268 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| 4) |c_~#queue~0.offset|) v_ArrVal_1272)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1273) |c_~#queue~0.base|) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_174| (select .cse7 .cse5))))))))) is different from false [2022-11-22 00:27:59,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:28:02,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:28:04,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-22 00:28:06,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:28:06,871 INFO L93 Difference]: Finished difference Result 2159 states and 5218 transitions. [2022-11-22 00:28:06,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-22 00:28:06,872 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 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-11-22 00:28:06,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:28:06,876 INFO L225 Difference]: With dead ends: 2159 [2022-11-22 00:28:06,877 INFO L226 Difference]: Without dead ends: 2159 [2022-11-22 00:28:06,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 14 SyntacticMatches, 8 SemanticMatches, 55 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 30.0s TimeCoverageRelationStatistics Valid=726, Invalid=1709, Unknown=43, NotChecked=714, Total=3192 [2022-11-22 00:28:06,879 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 517 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 90 mSolverCounterUnsat, 129 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 2003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 129 IncrementalHoareTripleChecker+Unknown, 633 IncrementalHoareTripleChecker+Unchecked, 29.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:28:06,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 170 Invalid, 2003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1151 Invalid, 129 Unknown, 633 Unchecked, 29.1s Time] [2022-11-22 00:28:06,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2159 states. [2022-11-22 00:28:06,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2159 to 1020. [2022-11-22 00:28:06,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 1004 states have (on average 2.5328685258964145) internal successors, (2543), 1019 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:28:06,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2543 transitions. [2022-11-22 00:28:06,917 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2543 transitions. Word has length 18 [2022-11-22 00:28:06,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:28:06,917 INFO L495 AbstractCegarLoop]: Abstraction has 1020 states and 2543 transitions. [2022-11-22 00:28:06,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.542857142857143) internal successors, (54), 35 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-11-22 00:28:06,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2543 transitions. [2022-11-22 00:28:06,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 00:28:06,919 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:28:06,919 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:28:06,926 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-22 00:28:07,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:28:07,126 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-22 00:28:07,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:28:07,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1057914284, now seen corresponding path program 1 times [2022-11-22 00:28:07,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:28:07,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300316707] [2022-11-22 00:28:07,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:28:07,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:28:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:28:07,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:28:07,770 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:28:07,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300316707] [2022-11-22 00:28:07,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300316707] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:28:07,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798717374] [2022-11-22 00:28:07,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:28:07,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:28:07,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:28:07,772 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:28:07,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-22 00:28:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:28:08,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-22 00:28:08,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:28:08,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 00:28:08,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:28:08,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-22 00:28:08,290 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-22 00:28:08,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-11-22 00:28:08,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-22 00:28:08,382 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:28:08,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:28:08,539 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1356 Int)) (or (< (+ v_ArrVal_1356 2147483648) 0) (<= 0 (+ 2147483649 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1354) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_1356) (+ |c_~#queue~0.offset| 1604)))))) is different from false [2022-11-22 00:28:08,553 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:28:08,553 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 31 treesize of output 32 [2022-11-22 00:28:08,565 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:28:08,566 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-11-22 00:28:08,577 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-11-22 00:28:08,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-22 00:28:08,615 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 00:28:08,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 47 treesize of output 47 [2022-11-22 00:28:08,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:28:08,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798717374] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:28:08,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1106206456] [2022-11-22 00:28:08,763 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:28:08,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:28:08,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-11-22 00:28:08,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561873181] [2022-11-22 00:28:08,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:28:08,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-22 00:28:08,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:28:08,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-22 00:28:08,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=282, Unknown=1, NotChecked=34, Total=380 [2022-11-22 00:28:08,765 INFO L87 Difference]: Start difference. First operand 1020 states and 2543 transitions. Second operand has 20 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:28:09,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:28:09,744 INFO L93 Difference]: Finished difference Result 1988 states and 4883 transitions. [2022-11-22 00:28:09,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 00:28:09,745 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-22 00:28:09,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:28:09,748 INFO L225 Difference]: With dead ends: 1988 [2022-11-22 00:28:09,748 INFO L226 Difference]: Without dead ends: 1988 [2022-11-22 00:28:09,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=130, Invalid=425, Unknown=1, NotChecked=44, Total=600 [2022-11-22 00:28:09,749 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 754 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-22 00:28:09,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 60 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 543 Invalid, 0 Unknown, 112 Unchecked, 0.7s Time] [2022-11-22 00:28:09,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2022-11-22 00:28:09,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1240. [2022-11-22 00:28:09,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 1224 states have (on average 2.559640522875817) internal successors, (3133), 1239 states have internal predecessors, (3133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:28:09,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 3133 transitions. [2022-11-22 00:28:09,788 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 3133 transitions. Word has length 19 [2022-11-22 00:28:09,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:28:09,788 INFO L495 AbstractCegarLoop]: Abstraction has 1240 states and 3133 transitions. [2022-11-22 00:28:09,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 19 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:28:09,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 3133 transitions. [2022-11-22 00:28:09,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 00:28:09,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:28:09,790 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:28:09,799 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-22 00:28:09,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:28:09,996 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-22 00:28:09,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:28:09,997 INFO L85 PathProgramCache]: Analyzing trace with hash 576810242, now seen corresponding path program 1 times [2022-11-22 00:28:09,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:28:09,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947514978] [2022-11-22 00:28:09,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:28:09,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:28:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:28:11,084 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:28:11,084 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:28:11,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947514978] [2022-11-22 00:28:11,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947514978] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:28:11,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787186328] [2022-11-22 00:28:11,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:28:11,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:28:11,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:28:11,086 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:28:11,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-22 00:28:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:28:11,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-22 00:28:11,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:28:11,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:28:11,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:28:11,347 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 00:28:11,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-22 00:28:11,375 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-22 00:28:11,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-22 00:28:11,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-22 00:28:11,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-22 00:28:11,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-22 00:28:11,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-22 00:28:12,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:28:12,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-22 00:28:12,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 82 [2022-11-22 00:28:12,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 111 [2022-11-22 00:28:12,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:28:12,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:28:12,513 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1463 (Array Int Int)) (v_ArrVal_1465 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1463) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1465)) .cse1)) 2147483647)) is different from false [2022-11-22 00:28:12,620 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1463 (Array Int Int)) (v_ArrVal_1465 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1463) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1465)) .cse1)) 2147483647)) is different from false [2022-11-22 00:28:12,751 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1463 (Array Int Int)) (v_ArrVal_1465 Int) (v_ArrVal_1460 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1460))) (let ((.cse4 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse4 .cse5))) (or (= 400 .cse0) (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1463) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1465)) .cse2)) 2147483647)))))) is different from false [2022-11-22 00:28:12,774 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1463 (Array Int Int)) (v_ArrVal_1465 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1458 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_1458)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1460))) (let ((.cse4 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse4 .cse5))) (or (= 400 .cse0) (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1463) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1465)) .cse2)) 2147483647)))))) is different from false [2022-11-22 00:28:12,817 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1463 (Array Int Int)) (v_ArrVal_1465 Int) (v_ArrVal_1457 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1458 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_1457) (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1458)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1460))) (let ((.cse4 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse4 .cse5))) (or (= 400 .cse0) (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1463) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1465)) .cse2)) 2147483647)))))) is different from false [2022-11-22 00:28:13,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-22 00:28:13,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787186328] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:28:13,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [880076667] [2022-11-22 00:28:13,040 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:28:13,041 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:28:13,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 31 [2022-11-22 00:28:13,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63017785] [2022-11-22 00:28:13,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:28:13,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-22 00:28:13,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:28:13,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-22 00:28:13,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=577, Unknown=6, NotChecked=280, Total=1056 [2022-11-22 00:28:13,044 INFO L87 Difference]: Start difference. First operand 1240 states and 3133 transitions. Second operand has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:28:18,230 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (select .cse4 .cse5))) (let ((.cse0 (forall ((v_ArrVal_1463 (Array Int Int)) (v_ArrVal_1465 Int)) (< (let ((.cse3 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1463) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_1465)) .cse3)) 2147483647)))) (and .cse0 (or (= 400 .cse1) .cse0))))) is different from false [2022-11-22 00:28:20,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:28:20,765 INFO L93 Difference]: Finished difference Result 2574 states and 6215 transitions. [2022-11-22 00:28:20,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-22 00:28:20,765 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-22 00:28:20,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:28:20,769 INFO L225 Difference]: With dead ends: 2574 [2022-11-22 00:28:20,769 INFO L226 Difference]: Without dead ends: 2574 [2022-11-22 00:28:20,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 19 SyntacticMatches, 10 SemanticMatches, 51 ConstructedPredicates, 6 IntricatePredicates, 5 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=531, Invalid=1645, Unknown=10, NotChecked=570, Total=2756 [2022-11-22 00:28:20,771 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 566 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 64 mSolverCounterUnsat, 53 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 2569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 53 IncrementalHoareTripleChecker+Unknown, 1045 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-22 00:28:20,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 206 Invalid, 2569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1407 Invalid, 53 Unknown, 1045 Unchecked, 4.7s Time] [2022-11-22 00:28:20,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2022-11-22 00:28:20,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 1535. [2022-11-22 00:28:20,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1519 states have (on average 2.554312047399605) internal successors, (3880), 1534 states have internal predecessors, (3880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:28:20,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 3880 transitions. [2022-11-22 00:28:20,819 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 3880 transitions. Word has length 20 [2022-11-22 00:28:20,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:28:20,819 INFO L495 AbstractCegarLoop]: Abstraction has 1535 states and 3880 transitions. [2022-11-22 00:28:20,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:28:20,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 3880 transitions. [2022-11-22 00:28:20,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 00:28:20,822 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:28:20,822 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:28:20,836 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-22 00:28:21,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-22 00:28:21,029 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-22 00:28:21,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:28:21,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1562495948, now seen corresponding path program 2 times [2022-11-22 00:28:21,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:28:21,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175420334] [2022-11-22 00:28:21,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:28:21,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:28:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:28:21,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:28:21,922 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:28:21,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175420334] [2022-11-22 00:28:21,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175420334] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:28:21,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173588710] [2022-11-22 00:28:21,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 00:28:21,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:28:21,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:28:21,924 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:28:21,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-22 00:28:22,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-22 00:28:22,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:28:22,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-22 00:28:22,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:28:22,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:28:22,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:28:22,227 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 00:28:22,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-22 00:28:22,253 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-22 00:28:22,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-22 00:28:22,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-22 00:28:22,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-22 00:28:22,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-22 00:28:22,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:28:22,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-11-22 00:28:23,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 82 [2022-11-22 00:28:23,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 111 [2022-11-22 00:28:23,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 111 [2022-11-22 00:28:23,332 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:28:23,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:28:23,367 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1574 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1574) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 2147483647)) is different from false [2022-11-22 00:28:23,487 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1573 Int) (v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1571 (Array Int Int))) (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1571))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_1573)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1574) |c_~#queue~0.base|) .cse2)) 2147483647)) is different from false [2022-11-22 00:28:24,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-22 00:28:24,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173588710] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:28:24,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [405490801] [2022-11-22 00:28:24,377 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:28:24,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:28:24,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 31 [2022-11-22 00:28:24,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057829121] [2022-11-22 00:28:24,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:28:24,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-22 00:28:24,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:28:24,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-22 00:28:24,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=697, Unknown=29, NotChecked=118, Total=1056 [2022-11-22 00:28:24,379 INFO L87 Difference]: Start difference. First operand 1535 states and 3880 transitions. Second operand has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:28:27,312 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (and (forall ((v_ArrVal_1573 Int) (v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1571 (Array Int Int))) (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 (+ (select .cse3 .cse4) 1))) |c_~#stored_elements~0.base| v_ArrVal_1571))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1573)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1574) |c_~#queue~0.base|) .cse2)) 2147483647)) (= |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 0) (exists ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_186| Int) (v_ArrVal_1573 Int) (v_ArrVal_1567 Int) (v_ArrVal_1566 Int)) (and (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_186| 0) (= .cse3 (let ((.cse6 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store (store (store ((as const (Array Int Int)) 0) (+ 1600 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) 0) .cse4 0) .cse6 0) (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_186| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1566))) (let ((.cse7 (select .cse5 .cse4))) (store (store (store .cse5 .cse6 v_ArrVal_1567) .cse4 (+ .cse7 1)) (+ (* .cse7 4) 4 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1573))))))) (= 5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) is different from false [2022-11-22 00:28:29,276 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1573 Int) (v_ArrVal_1574 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1573))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1574) |c_~#queue~0.base|) .cse1) 2147483647)) (forall ((v_ArrVal_1573 Int) (v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1571 (Array Int Int))) (< (select (select (store (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1571))) (store .cse2 |c_~#queue~0.base| (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_1573)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1574) |c_~#queue~0.base|) .cse1) 2147483647)) (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604)) 2147483647))) is different from false [2022-11-22 00:28:33,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:28:33,101 INFO L93 Difference]: Finished difference Result 2606 states and 6336 transitions. [2022-11-22 00:28:33,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-22 00:28:33,101 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-22 00:28:33,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:28:33,106 INFO L225 Difference]: With dead ends: 2606 [2022-11-22 00:28:33,106 INFO L226 Difference]: Without dead ends: 2606 [2022-11-22 00:28:33,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 4 IntricatePredicates, 3 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=437, Invalid=1344, Unknown=41, NotChecked=340, Total=2162 [2022-11-22 00:28:33,107 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 552 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 98 mSolverCounterUnsat, 149 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 149 IncrementalHoareTripleChecker+Unknown, 304 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:28:33,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 181 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1392 Invalid, 149 Unknown, 304 Unchecked, 6.3s Time] [2022-11-22 00:28:33,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2606 states. [2022-11-22 00:28:33,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2606 to 1662. [2022-11-22 00:28:33,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1662 states, 1646 states have (on average 2.5176184690157957) internal successors, (4144), 1661 states have internal predecessors, (4144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:28:33,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 4144 transitions. [2022-11-22 00:28:33,156 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 4144 transitions. Word has length 20 [2022-11-22 00:28:33,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:28:33,156 INFO L495 AbstractCegarLoop]: Abstraction has 1662 states and 4144 transitions. [2022-11-22 00:28:33,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:28:33,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 4144 transitions. [2022-11-22 00:28:33,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-22 00:28:33,159 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:28:33,159 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:28:33,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-22 00:28:33,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-22 00:28:33,366 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-22 00:28:33,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:28:33,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1390006058, now seen corresponding path program 3 times [2022-11-22 00:28:33,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:28:33,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986826258] [2022-11-22 00:28:33,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:28:33,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:28:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:28:34,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:28:34,432 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:28:34,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986826258] [2022-11-22 00:28:34,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986826258] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:28:34,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045674475] [2022-11-22 00:28:34,433 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 00:28:34,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:28:34,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:28:34,434 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:28:34,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-22 00:28:34,642 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 00:28:34,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:28:34,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-22 00:28:34,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:28:34,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:28:34,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:28:34,697 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 00:28:34,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-11-22 00:28:34,733 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-22 00:28:34,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-22 00:28:34,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-22 00:28:35,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-11-22 00:28:35,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-11-22 00:28:35,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:28:35,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 74 treesize of output 76 [2022-11-22 00:28:35,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 82 [2022-11-22 00:28:35,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 111 [2022-11-22 00:28:35,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 111 [2022-11-22 00:28:35,986 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:28:35,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:28:36,385 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1682 Int) (v_ArrVal_1683 (Array Int Int)) (v_ArrVal_1680 (Array Int Int))) (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (select (store (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) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1680))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_1682)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1683) |c_~#queue~0.base|) .cse2)) 2147483647)) is different from false [2022-11-22 00:28:36,401 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1682 Int) (v_ArrVal_1683 (Array Int Int)) (v_ArrVal_1680 (Array Int Int))) (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1680))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1682)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1683) |c_~#queue~0.base|) .cse2)) 2147483647)) is different from false [2022-11-22 00:28:37,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-22 00:28:37,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045674475] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:28:37,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [224764421] [2022-11-22 00:28:37,186 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:28:37,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:28:37,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 31 [2022-11-22 00:28:37,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866420793] [2022-11-22 00:28:37,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:28:37,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-22 00:28:37,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:28:37,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-22 00:28:37,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=745, Unknown=31, NotChecked=118, Total=1056 [2022-11-22 00:28:37,190 INFO L87 Difference]: Start difference. First operand 1662 states and 4144 transitions. Second operand has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:28:45,338 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_1682 Int) (v_ArrVal_1683 (Array Int Int)) (v_ArrVal_1680 (Array Int Int))) (< (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1680))) (store .cse0 |c_~#queue~0.base| (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1682)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1683) |c_~#queue~0.base|) .cse2) 2147483647)) (forall ((v_ArrVal_1682 Int) (v_ArrVal_1683 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1682))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1683) |c_~#queue~0.base|) .cse2) 2147483647)))) is different from false [2022-11-22 00:28:45,948 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (and (forall ((v_ArrVal_1682 Int) (v_ArrVal_1683 (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_1682)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1683) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) 2147483647)) (forall ((v_ArrVal_1683 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1683) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse0) 2147483647)))) is different from false [2022-11-22 00:28:48,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:28:48,228 INFO L93 Difference]: Finished difference Result 2586 states and 6431 transitions. [2022-11-22 00:28:48,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-22 00:28:48,229 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-22 00:28:48,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:28:48,233 INFO L225 Difference]: With dead ends: 2586 [2022-11-22 00:28:48,233 INFO L226 Difference]: Without dead ends: 2586 [2022-11-22 00:28:48,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=377, Invalid=1394, Unknown=51, NotChecked=340, Total=2162 [2022-11-22 00:28:48,234 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 694 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 126 mSolverCounterUnsat, 132 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 132 IncrementalHoareTripleChecker+Unknown, 222 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:28:48,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 142 Invalid, 1679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1199 Invalid, 132 Unknown, 222 Unchecked, 5.2s Time] [2022-11-22 00:28:48,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2586 states. [2022-11-22 00:28:48,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2586 to 1654. [2022-11-22 00:28:48,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1654 states, 1638 states have (on average 2.56959706959707) internal successors, (4209), 1653 states have internal predecessors, (4209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:28:48,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 4209 transitions. [2022-11-22 00:28:48,275 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 4209 transitions. Word has length 20 [2022-11-22 00:28:48,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:28:48,275 INFO L495 AbstractCegarLoop]: Abstraction has 1654 states and 4209 transitions. [2022-11-22 00:28:48,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:28:48,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 4209 transitions. [2022-11-22 00:28:48,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:28:48,278 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:28:48,279 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-22 00:28:48,286 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-22 00:28:48,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:28:48,485 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-22 00:28:48,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:28:48,486 INFO L85 PathProgramCache]: Analyzing trace with hash -148593879, now seen corresponding path program 1 times [2022-11-22 00:28:48,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:28:48,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687894008] [2022-11-22 00:28:48,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:28:48,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:28:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:28:48,542 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-22 00:28:48,543 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:28:48,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687894008] [2022-11-22 00:28:48,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687894008] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:28:48,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 00:28:48,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 00:28:48,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290303658] [2022-11-22 00:28:48,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:28:48,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 00:28:48,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:28:48,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 00:28:48,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 00:28:48,545 INFO L87 Difference]: Start difference. First operand 1654 states and 4209 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:28:48,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:28:48,710 INFO L93 Difference]: Finished difference Result 1642 states and 4107 transitions. [2022-11-22 00:28:48,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 00:28:48,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-22 00:28:48,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:28:48,713 INFO L225 Difference]: With dead ends: 1642 [2022-11-22 00:28:48,714 INFO L226 Difference]: Without dead ends: 1642 [2022-11-22 00:28:48,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 00:28:48,715 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 23 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 00:28:48,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 15 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 00:28:48,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2022-11-22 00:28:48,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1642. [2022-11-22 00:28:48,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1642 states, 1628 states have (on average 2.522727272727273) internal successors, (4107), 1641 states have internal predecessors, (4107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:28:48,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 4107 transitions. [2022-11-22 00:28:48,743 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 4107 transitions. Word has length 22 [2022-11-22 00:28:48,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:28:48,743 INFO L495 AbstractCegarLoop]: Abstraction has 1642 states and 4107 transitions. [2022-11-22 00:28:48,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:28:48,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 4107 transitions. [2022-11-22 00:28:48,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-22 00:28:48,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:28:48,746 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-22 00:28:48,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-22 00:28:48,747 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-22 00:28:48,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:28:48,748 INFO L85 PathProgramCache]: Analyzing trace with hash -148593699, now seen corresponding path program 1 times [2022-11-22 00:28:48,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:28:48,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194465709] [2022-11-22 00:28:48,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:28:48,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:28:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:28:48,839 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:28:48,839 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:28:48,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194465709] [2022-11-22 00:28:48,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194465709] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:28:48,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369930765] [2022-11-22 00:28:48,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:28:48,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:28:48,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:28:48,843 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:28:48,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-22 00:28:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:28:49,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-22 00:28:49,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:28:49,158 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:28:49,159 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 00:28:49,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369930765] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 00:28:49,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-22 00:28:49,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-22 00:28:49,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030786898] [2022-11-22 00:28:49,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 00:28:49,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 00:28:49,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:28:49,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 00:28:49,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-22 00:28:49,160 INFO L87 Difference]: Start difference. First operand 1642 states and 4107 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:28:49,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:28:49,416 INFO L93 Difference]: Finished difference Result 1630 states and 4005 transitions. [2022-11-22 00:28:49,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 00:28:49,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-22 00:28:49,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:28:49,419 INFO L225 Difference]: With dead ends: 1630 [2022-11-22 00:28:49,419 INFO L226 Difference]: Without dead ends: 1630 [2022-11-22 00:28:49,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-22 00:28:49,420 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 96 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 00:28:49,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 18 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 00:28:49,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1630 states. [2022-11-22 00:28:49,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1630 to 1630. [2022-11-22 00:28:49,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1618 states have (on average 2.4752781211372064) internal successors, (4005), 1629 states have internal predecessors, (4005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:28:49,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 4005 transitions. [2022-11-22 00:28:49,448 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 4005 transitions. Word has length 22 [2022-11-22 00:28:49,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:28:49,448 INFO L495 AbstractCegarLoop]: Abstraction has 1630 states and 4005 transitions. [2022-11-22 00:28:49,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:28:49,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 4005 transitions. [2022-11-22 00:28:49,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 00:28:49,450 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:28:49,450 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 00:28:49,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-22 00:28:49,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-22 00:28:49,651 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-22 00:28:49,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:28:49,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1098079562, now seen corresponding path program 1 times [2022-11-22 00:28:49,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:28:49,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751682815] [2022-11-22 00:28:49,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:28:49,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:28:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:28:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:28:49,731 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:28:49,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751682815] [2022-11-22 00:28:49,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751682815] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:28:49,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255661862] [2022-11-22 00:28:49,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:28:49,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:28:49,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:28:49,734 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:28:49,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-22 00:28:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:28:49,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-22 00:28:49,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:28:49,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:28:49,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:28:50,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:28:50,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255661862] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:28:50,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1202361502] [2022-11-22 00:28:50,047 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:28:50,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:28:50,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-22 00:28:50,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678412075] [2022-11-22 00:28:50,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:28:50,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-22 00:28:50,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:28:50,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-22 00:28:50,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-22 00:28:50,051 INFO L87 Difference]: Start difference. First operand 1630 states and 4005 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:28:50,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 00:28:50,371 INFO L93 Difference]: Finished difference Result 1712 states and 4144 transitions. [2022-11-22 00:28:50,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 00:28:50,372 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-22 00:28:50,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 00:28:50,375 INFO L225 Difference]: With dead ends: 1712 [2022-11-22 00:28:50,375 INFO L226 Difference]: Without dead ends: 1712 [2022-11-22 00:28:50,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-22 00:28:50,376 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 88 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 00:28:50,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 29 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 00:28:50,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2022-11-22 00:28:50,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1668. [2022-11-22 00:28:50,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1668 states, 1656 states have (on average 2.446256038647343) internal successors, (4051), 1667 states have internal predecessors, (4051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:28:50,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 4051 transitions. [2022-11-22 00:28:50,412 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 4051 transitions. Word has length 24 [2022-11-22 00:28:50,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 00:28:50,412 INFO L495 AbstractCegarLoop]: Abstraction has 1668 states and 4051 transitions. [2022-11-22 00:28:50,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:28:50,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 4051 transitions. [2022-11-22 00:28:50,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-22 00:28:50,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 00:28:50,416 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-22 00:28:50,426 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-22 00:28:50,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-22 00:28:50,623 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-11-22 00:28:50,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 00:28:50,624 INFO L85 PathProgramCache]: Analyzing trace with hash 178452746, now seen corresponding path program 5 times [2022-11-22 00:28:50,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 00:28:50,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738297221] [2022-11-22 00:28:50,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 00:28:50,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 00:28:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 00:28:53,679 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:28:53,679 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 00:28:53,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738297221] [2022-11-22 00:28:53,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738297221] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 00:28:53,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763153889] [2022-11-22 00:28:53,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 00:28:53,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 00:28:53,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 00:28:53,681 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 00:28:53,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8537587a-06db-4dac-bb65-edb23ab7e36c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-22 00:28:54,026 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-22 00:28:54,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 00:28:54,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 111 conjunts are in the unsatisfiable core [2022-11-22 00:28:54,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 00:28:54,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:28:54,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:28:54,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-11-22 00:28:54,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 00:28:54,133 INFO L321 Elim1Store]: treesize reduction 44, result has 45.7 percent of original size [2022-11-22 00:28:54,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 62 [2022-11-22 00:28:54,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-11-22 00:28:54,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-11-22 00:28:55,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-11-22 00:28:55,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-11-22 00:28:55,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-11-22 00:28:56,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 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-11-22 00:28:56,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2022-11-22 00:28:58,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 68 [2022-11-22 00:29:02,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 64 [2022-11-22 00:29:04,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 73 [2022-11-22 00:29:15,674 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 00:29:15,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 00:29:15,900 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (v_ArrVal_2015 (Array Int Int)) (v_ArrVal_2017 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2015) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_2017) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-22 00:29:15,922 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (v_ArrVal_2013 Int) (v_ArrVal_2015 (Array Int Int)) (v_ArrVal_2017 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_2013)) |c_~#stored_elements~0.base| v_ArrVal_2015) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_2017) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (not (<= v_ArrVal_2013 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))))) is different from false [2022-11-22 00:29:15,945 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (v_ArrVal_2013 Int) (v_ArrVal_2015 (Array Int Int)) (v_ArrVal_2017 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_2013)) |c_~#stored_elements~0.base| v_ArrVal_2015) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_2017) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2013))))) is different from false [2022-11-22 00:29:16,555 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (v_ArrVal_2011 Int) (v_ArrVal_2013 Int) (v_ArrVal_2015 (Array Int Int)) (v_ArrVal_2017 Int) (v_ArrVal_2010 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2010))) (let ((.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse1 (select .cse4 .cse5)) (.cse0 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 .cse2 v_ArrVal_2011) .cse5 v_ArrVal_2013)) |c_~#stored_elements~0.base| v_ArrVal_2015) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ .cse1 1) v_ArrVal_2013) (= 400 .cse1) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_2017) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse2) 1) v_ArrVal_2011)))))) is different from false [2022-11-22 00:29:16,612 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (v_ArrVal_2011 Int) (v_ArrVal_2013 Int) (v_ArrVal_2015 (Array Int Int)) (v_ArrVal_2017 Int) (v_ArrVal_2009 Int) (v_ArrVal_2010 (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_2009))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| .cse1) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2010))) (let ((.cse2 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse5 .cse6)) (.cse3 (select (store (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse2 v_ArrVal_2011) .cse6 v_ArrVal_2013)) |c_~#stored_elements~0.base| v_ArrVal_2015) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_2013) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2011) (= 400 .cse0) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse3 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_2017) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2022-11-22 00:29:16,656 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| Int) (v_ArrVal_2011 Int) (v_ArrVal_2013 Int) (v_ArrVal_2015 (Array Int Int)) (v_ArrVal_2017 Int) (v_ArrVal_2009 Int) (v_ArrVal_2010 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| 4) |c_~#queue~0.offset|) v_ArrVal_2009))) (let ((.cse7 (store (store |c_#memory_int| |c_~#queue~0.base| .cse5) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2010))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|)) (.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse2 v_ArrVal_2011) .cse1 v_ArrVal_2013)) |c_~#stored_elements~0.base| v_ArrVal_2015) |c_~#queue~0.base|)) (.cse4 (select .cse6 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_2017) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| (select .cse3 .cse1))) (< (+ .cse4 1) v_ArrVal_2013) (= .cse4 400) (< (+ (select .cse5 .cse2) 1) v_ArrVal_2011)))))))) is different from false [2022-11-22 00:29:16,742 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (v_ArrVal_2007 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| Int) (v_ArrVal_2011 Int) (v_ArrVal_2013 Int) (v_ArrVal_2015 (Array Int Int)) (v_ArrVal_2017 Int) (v_ArrVal_2009 Int) (v_ArrVal_2010 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2007))) (let ((.cse0 (select .cse8 |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| 4) |c_~#queue~0.offset|) v_ArrVal_2009))) (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| .cse3) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2010))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_2011) .cse1 v_ArrVal_2013)) |c_~#stored_elements~0.base| v_ArrVal_2015) |c_~#queue~0.base|)) (.cse5 (select .cse6 .cse1))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse2 .cse1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2011) (< (+ .cse5 1) v_ArrVal_2013) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_2017) .cse4) 2147483647) (= .cse5 400))))))))) is different from false [2022-11-22 00:29:16,822 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (v_ArrVal_2007 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| Int) (v_ArrVal_2011 Int) (v_ArrVal_2013 Int) (v_ArrVal_2015 (Array Int Int)) (v_ArrVal_2006 Int) (v_ArrVal_2017 Int) (v_ArrVal_2009 Int) (v_ArrVal_2010 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604) v_ArrVal_2006)) |c_~#stored_elements~0.base| v_ArrVal_2007))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| 4) |c_~#queue~0.offset|) v_ArrVal_2009))) (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| .cse0) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2010))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_2011) .cse5 v_ArrVal_2013)) |c_~#stored_elements~0.base| v_ArrVal_2015) |c_~#queue~0.base|)) (.cse2 (select .cse6 .cse5))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2011) (< (+ .cse2 1) v_ArrVal_2013) (not (<= v_ArrVal_2006 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_2017) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| (select .cse4 .cse5))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse3 .cse5))) (= 400 .cse2))))))))) is different from false [2022-11-22 00:29:16,899 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (v_ArrVal_2007 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| Int) (v_ArrVal_2011 Int) (v_ArrVal_2013 Int) (v_ArrVal_2015 (Array Int Int)) (v_ArrVal_2006 Int) (v_ArrVal_2017 Int) (v_ArrVal_2009 Int) (v_ArrVal_2010 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_2006)) |c_~#stored_elements~0.base| v_ArrVal_2007))) (let ((.cse6 (select .cse10 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| 4) |c_~#queue~0.offset|) v_ArrVal_2009))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| .cse0) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2010))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse7 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse1 v_ArrVal_2011) .cse7 v_ArrVal_2013)) |c_~#stored_elements~0.base| v_ArrVal_2015) |c_~#queue~0.base|)) (.cse2 (select .cse8 .cse7))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2011) (< (+ .cse2 1) v_ArrVal_2013) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_2017) .cse1) 2147483647) (< (+ (select .cse4 .cse5) 1) v_ArrVal_2006) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| (select .cse6 .cse7))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse3 .cse7))) (= 400 .cse2)))))))))) is different from false [2022-11-22 00:29:17,071 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (v_ArrVal_2007 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| Int) (v_ArrVal_2011 Int) (v_ArrVal_2003 Int) (v_ArrVal_2013 Int) (v_ArrVal_2015 (Array Int Int)) (v_ArrVal_2006 Int) (v_ArrVal_2017 Int) (v_ArrVal_2009 Int) (v_ArrVal_2010 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2003) .cse5 v_ArrVal_2006)) |c_~#stored_elements~0.base| v_ArrVal_2007))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse6 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| 4) |c_~#queue~0.offset|) v_ArrVal_2009))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| .cse6) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2010))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse1 v_ArrVal_2011) .cse2 v_ArrVal_2013)) |c_~#stored_elements~0.base| v_ArrVal_2015) |c_~#queue~0.base|)) (.cse3 (select .cse8 .cse2))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_2017) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse0 .cse2))) (not (<= v_ArrVal_2003 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ 1 .cse3) v_ArrVal_2013) (< (+ (select .cse4 .cse5) 1) v_ArrVal_2006) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2011) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| (select .cse7 .cse2))) (= 400 .cse3)))))))))) is different from false [2022-11-22 00:29:17,157 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (v_ArrVal_2007 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| Int) (v_ArrVal_2011 Int) (v_ArrVal_2003 Int) (v_ArrVal_2013 Int) (v_ArrVal_2015 (Array Int Int)) (v_ArrVal_2006 Int) (v_ArrVal_2017 Int) (v_ArrVal_2009 Int) (v_ArrVal_2010 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_2003) .cse6 v_ArrVal_2006)) |c_~#stored_elements~0.base| v_ArrVal_2007))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| 4) |c_~#queue~0.offset|) v_ArrVal_2009))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| .cse7) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2010))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse9 .cse1 v_ArrVal_2011) .cse2 v_ArrVal_2013)) |c_~#stored_elements~0.base| v_ArrVal_2015) |c_~#queue~0.base|)) (.cse5 (select .cse9 .cse2))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_2017) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse0 .cse2))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2003) (< (+ 1 .cse5) v_ArrVal_2013) (< (+ (select .cse3 .cse6) 1) v_ArrVal_2006) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2011) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| (select .cse8 .cse2))) (= 400 .cse5)))))))))) is different from false [2022-11-22 00:29:17,256 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2007 (Array Int Int)) (v_ArrVal_2015 (Array Int Int)) (v_ArrVal_2010 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| Int) (v_ArrVal_2001 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| Int) (v_ArrVal_2011 Int) (v_ArrVal_2003 Int) (v_ArrVal_2013 Int) (v_ArrVal_2006 Int) (v_ArrVal_2017 Int) (v_ArrVal_2009 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_2001)) (.cse7 (+ 1608 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1604))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 .cse7 v_ArrVal_2003) .cse4 v_ArrVal_2006)) |c_~#stored_elements~0.base| v_ArrVal_2007))) (let ((.cse6 (select .cse11 |c_~#queue~0.base|))) (let ((.cse2 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| 4) |c_~#queue~0.offset|) v_ArrVal_2009))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| .cse2) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2010))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse9 .cse1 v_ArrVal_2011) .cse5 v_ArrVal_2013)) |c_~#stored_elements~0.base| v_ArrVal_2015) |c_~#queue~0.base|)) (.cse8 (select .cse9 .cse5))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| 4) |c_~#queue~0.offset|) v_ArrVal_2017) .cse1) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2011) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2006) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_200| (select .cse0 .cse5))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_201| (select .cse6 .cse5))) (< (+ (select .cse3 .cse7) 1) v_ArrVal_2003) (< (+ .cse8 1) v_ArrVal_2013) (= 400 .cse8)))))))))) is different from false [2022-11-22 00:29:26,972 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2022-11-22 00:29:26,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763153889] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 00:29:26,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1178870001] [2022-11-22 00:29:26,972 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:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-22 00:29:26,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 00:29:26,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 19] total 54 [2022-11-22 00:29:26,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358895876] [2022-11-22 00:29:26,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 00:29:26,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-22 00:29:26,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 00:29:26,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-22 00:29:26,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=431, Invalid=1479, Unknown=30, NotChecked=1140, Total=3080 [2022-11-22 00:29:26,976 INFO L87 Difference]: Start difference. First operand 1668 states and 4051 transitions. Second operand has 56 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 00:29:41,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:29:46,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:29:54,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:30:00,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:30:04,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:30:21,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:30:30,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:30:32,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:30:34,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:30:36,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:30:38,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-11-22 00:30:59,868 WARN L233 SmtUtils]: Spent 20.69s on a formula simplification. DAG size of input: 197 DAG size of output: 188 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:31:01,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:31:04,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:31:06,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:31:33,208 WARN L233 SmtUtils]: Spent 11.45s on a formula simplification. DAG size of input: 216 DAG size of output: 156 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:32:15,166 WARN L233 SmtUtils]: Spent 36.45s on a formula simplification. DAG size of input: 210 DAG size of output: 199 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:32:17,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:32:19,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:32:21,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:32:23,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-11-22 00:32:25,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:32:27,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:32:29,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:32:31,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:32:33,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:32:35,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:32:37,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:32:39,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-11-22 00:32:41,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:32:42,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-22 00:33:01,779 WARN L233 SmtUtils]: Spent 17.46s on a formula simplification. DAG size of input: 220 DAG size of output: 204 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 00:33:35,594 WARN L233 SmtUtils]: Spent 9.24s on a formula simplification. DAG size of input: 169 DAG size of output: 167 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)