./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 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_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 14:34:27,926 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 14:34:27,927 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 14:34:27,939 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 14:34:27,940 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 14:34:27,940 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 14:34:27,941 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 14:34:27,942 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 14:34:27,943 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 14:34:27,944 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 14:34:27,945 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 14:34:27,945 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 14:34:27,945 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 14:34:27,946 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 14:34:27,947 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 14:34:27,947 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 14:34:27,948 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 14:34:27,949 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 14:34:27,950 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 14:34:27,951 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 14:34:27,952 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 14:34:27,953 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 14:34:27,954 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 14:34:27,955 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 14:34:27,958 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 14:34:27,958 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 14:34:27,959 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 14:34:27,960 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 14:34:27,960 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 14:34:27,961 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 14:34:27,961 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 14:34:27,962 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 14:34:27,963 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 14:34:27,964 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 14:34:27,965 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 14:34:27,965 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 14:34:27,965 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 14:34:27,965 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 14:34:27,966 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 14:34:27,966 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 14:34:27,967 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 14:34:27,969 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-12-14 14:34:27,991 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 14:34:27,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 14:34:27,992 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 14:34:27,992 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 14:34:27,998 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 14:34:27,998 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 14:34:27,998 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 14:34:27,999 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 14:34:27,999 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 14:34:27,999 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 14:34:27,999 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 14:34:27,999 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 14:34:28,000 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 14:34:28,000 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 14:34:28,000 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 14:34:28,000 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 14:34:28,000 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 14:34:28,001 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 14:34:28,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 14:34:28,002 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 14:34:28,002 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 14:34:28,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 14:34:28,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 14:34:28,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 14:34:28,003 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 14:34:28,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 14:34:28,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 14:34:28,003 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 14:34:28,003 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 14:34:28,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 14:34:28,004 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 14:34:28,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 14:34:28,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 14:34:28,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 14:34:28,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:34:28,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 14:34:28,005 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 14:34:28,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 14:34:28,005 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 14:34:28,005 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 14:34:28,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 14:34:28,006 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 14:34:28,006 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 14:34:28,006 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_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 [2022-12-14 14:34:28,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 14:34:28,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 14:34:28,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 14:34:28,192 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 14:34:28,192 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 14:34:28,193 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread/queue_ok.i [2022-12-14 14:34:30,799 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 14:34:30,978 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 14:34:30,978 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/sv-benchmarks/c/pthread/queue_ok.i [2022-12-14 14:34:30,987 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/data/033ffb771/6166bf85dd9c4a89a02ba7429d2c8eff/FLAG0dc172532 [2022-12-14 14:34:30,998 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/data/033ffb771/6166bf85dd9c4a89a02ba7429d2c8eff [2022-12-14 14:34:31,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 14:34:31,001 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 14:34:31,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 14:34:31,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 14:34:31,005 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 14:34:31,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:34:30" (1/1) ... [2022-12-14 14:34:31,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23ab02f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:34:31, skipping insertion in model container [2022-12-14 14:34:31,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 02:34:30" (1/1) ... [2022-12-14 14:34:31,014 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 14:34:31,057 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 14:34:31,376 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_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-12-14 14:34:31,379 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_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-12-14 14:34:31,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:34:31,390 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 14:34:31,422 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_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-12-14 14:34:31,424 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_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-12-14 14:34:31,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 14:34:31,459 INFO L208 MainTranslator]: Completed translation [2022-12-14 14:34:31,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:34:31 WrapperNode [2022-12-14 14:34:31,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 14:34:31,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 14:34:31,460 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 14:34:31,460 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 14:34:31,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:34:31" (1/1) ... [2022-12-14 14:34:31,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:34:31" (1/1) ... [2022-12-14 14:34:31,496 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 214 [2022-12-14 14:34:31,497 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 14:34:31,497 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 14:34:31,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 14:34:31,497 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 14:34:31,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:34:31" (1/1) ... [2022-12-14 14:34:31,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:34:31" (1/1) ... [2022-12-14 14:34:31,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:34:31" (1/1) ... [2022-12-14 14:34:31,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:34:31" (1/1) ... [2022-12-14 14:34:31,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:34:31" (1/1) ... [2022-12-14 14:34:31,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:34:31" (1/1) ... [2022-12-14 14:34:31,518 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:34:31" (1/1) ... [2022-12-14 14:34:31,519 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:34:31" (1/1) ... [2022-12-14 14:34:31,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 14:34:31,522 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 14:34:31,522 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 14:34:31,522 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 14:34:31,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:34:31" (1/1) ... [2022-12-14 14:34:31,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 14:34:31,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:34:31,546 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 14:34:31,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 14:34:31,575 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-14 14:34:31,575 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-14 14:34:31,575 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-14 14:34:31,575 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-14 14:34:31,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 14:34:31,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 14:34:31,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 14:34:31,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 14:34:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-14 14:34:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 14:34:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 14:34:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 14:34:31,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 14:34:31,577 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 14:34:31,687 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 14:34:31,688 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 14:34:31,977 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 14:34:31,987 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 14:34:31,987 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-14 14:34:31,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:34:31 BoogieIcfgContainer [2022-12-14 14:34:31,989 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 14:34:31,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 14:34:31,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 14:34:31,996 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 14:34:31,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 02:34:30" (1/3) ... [2022-12-14 14:34:31,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df13593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:34:31, skipping insertion in model container [2022-12-14 14:34:31,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 02:34:31" (2/3) ... [2022-12-14 14:34:31,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df13593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 02:34:31, skipping insertion in model container [2022-12-14 14:34:31,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 02:34:31" (3/3) ... [2022-12-14 14:34:31,999 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-12-14 14:34:32,008 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 14:34:32,018 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 14:34:32,018 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-12-14 14:34:32,018 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 14:34:32,106 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-14 14:34:32,142 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 14:34:32,156 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 245 places, 251 transitions, 518 flow [2022-12-14 14:34:32,159 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 245 places, 251 transitions, 518 flow [2022-12-14 14:34:32,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 251 transitions, 518 flow [2022-12-14 14:34:32,245 INFO L130 PetriNetUnfolder]: 13/249 cut-off events. [2022-12-14 14:34:32,246 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-14 14:34:32,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 249 events. 13/249 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 462 event pairs, 0 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2022-12-14 14:34:32,258 INFO L119 LiptonReduction]: Number of co-enabled transitions 14376 [2022-12-14 14:34:40,708 INFO L134 LiptonReduction]: Checked pairs total: 31164 [2022-12-14 14:34:40,708 INFO L136 LiptonReduction]: Total number of compositions: 241 [2022-12-14 14:34:40,714 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 61 places, 61 transitions, 138 flow [2022-12-14 14:34:40,757 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1060 states, 1012 states have (on average 2.7865612648221343) internal successors, (2820), 1059 states have internal predecessors, (2820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:40,770 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 14:34:40,774 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;@4bd762a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 14:34:40,774 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-12-14 14:34:40,777 INFO L276 IsEmpty]: Start isEmpty. Operand has 1060 states, 1012 states have (on average 2.7865612648221343) internal successors, (2820), 1059 states have internal predecessors, (2820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:40,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 14:34:40,781 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:40,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:40,782 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 14:34:40,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:40,785 INFO L85 PathProgramCache]: Analyzing trace with hash 806788440, now seen corresponding path program 1 times [2022-12-14 14:34:40,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:40,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151052901] [2022-12-14 14:34:40,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:40,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:41,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-12-14 14:34:41,611 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:41,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151052901] [2022-12-14 14:34:41,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151052901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:34:41,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:34:41,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:34:41,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415950966] [2022-12-14 14:34:41,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:34:41,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:34:41,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:41,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:34:41,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:34:41,636 INFO L87 Difference]: Start difference. First operand has 1060 states, 1012 states have (on average 2.7865612648221343) internal successors, (2820), 1059 states have internal predecessors, (2820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:41,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:41,780 INFO L93 Difference]: Finished difference Result 1068 states and 2836 transitions. [2022-12-14 14:34:41,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:34:41,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-14 14:34:41,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:41,795 INFO L225 Difference]: With dead ends: 1068 [2022-12-14 14:34:41,795 INFO L226 Difference]: Without dead ends: 1068 [2022-12-14 14:34:41,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:34:41,798 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:41,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 15 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:34:41,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2022-12-14 14:34:41,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1063. [2022-12-14 14:34:41,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 1015 states have (on average 2.7852216748768472) internal successors, (2827), 1062 states have internal predecessors, (2827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:41,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 2827 transitions. [2022-12-14 14:34:41,867 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 2827 transitions. Word has length 7 [2022-12-14 14:34:41,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:41,867 INFO L495 AbstractCegarLoop]: Abstraction has 1063 states and 2827 transitions. [2022-12-14 14:34:41,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:41,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 2827 transitions. [2022-12-14 14:34:41,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 14:34:41,868 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:41,868 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:41,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 14:34:41,868 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 14:34:41,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:41,869 INFO L85 PathProgramCache]: Analyzing trace with hash -280538193, now seen corresponding path program 1 times [2022-12-14 14:34:41,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:41,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381032794] [2022-12-14 14:34:41,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:41,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:42,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:42,390 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:42,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381032794] [2022-12-14 14:34:42,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381032794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:34:42,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:34:42,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 14:34:42,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947166899] [2022-12-14 14:34:42,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:34:42,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 14:34:42,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:42,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 14:34:42,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:34:42,393 INFO L87 Difference]: Start difference. First operand 1063 states and 2827 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:42,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:42,669 INFO L93 Difference]: Finished difference Result 1829 states and 4954 transitions. [2022-12-14 14:34:42,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:34:42,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 14:34:42,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:42,685 INFO L225 Difference]: With dead ends: 1829 [2022-12-14 14:34:42,685 INFO L226 Difference]: Without dead ends: 1829 [2022-12-14 14:34:42,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-14 14:34:42,686 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 131 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:42,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 26 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:34:42,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2022-12-14 14:34:42,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1228. [2022-12-14 14:34:42,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 1180 states have (on average 2.828813559322034) internal successors, (3338), 1227 states have internal predecessors, (3338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:42,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 3338 transitions. [2022-12-14 14:34:42,716 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 3338 transitions. Word has length 8 [2022-12-14 14:34:42,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:42,717 INFO L495 AbstractCegarLoop]: Abstraction has 1228 states and 3338 transitions. [2022-12-14 14:34:42,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:42,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 3338 transitions. [2022-12-14 14:34:42,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 14:34:42,717 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:42,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:42,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 14:34:42,718 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 14:34:42,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:42,718 INFO L85 PathProgramCache]: Analyzing trace with hash -280538192, now seen corresponding path program 1 times [2022-12-14 14:34:42,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:42,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948665471] [2022-12-14 14:34:42,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:42,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:43,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:43,106 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:43,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948665471] [2022-12-14 14:34:43,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948665471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:34:43,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:34:43,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 14:34:43,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201057888] [2022-12-14 14:34:43,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:34:43,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 14:34:43,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:43,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 14:34:43,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:34:43,108 INFO L87 Difference]: Start difference. First operand 1228 states and 3338 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:43,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:43,312 INFO L93 Difference]: Finished difference Result 1437 states and 3797 transitions. [2022-12-14 14:34:43,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:34:43,313 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 14:34:43,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:43,320 INFO L225 Difference]: With dead ends: 1437 [2022-12-14 14:34:43,320 INFO L226 Difference]: Without dead ends: 1437 [2022-12-14 14:34:43,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 14:34:43,322 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 91 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:43,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 26 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:34:43,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2022-12-14 14:34:43,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1228. [2022-12-14 14:34:43,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 1180 states have (on average 2.799152542372881) internal successors, (3303), 1227 states have internal predecessors, (3303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:43,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 3303 transitions. [2022-12-14 14:34:43,359 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 3303 transitions. Word has length 8 [2022-12-14 14:34:43,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:43,359 INFO L495 AbstractCegarLoop]: Abstraction has 1228 states and 3303 transitions. [2022-12-14 14:34:43,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:43,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 3303 transitions. [2022-12-14 14:34:43,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 14:34:43,360 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:43,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:43,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 14:34:43,361 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 14:34:43,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:43,361 INFO L85 PathProgramCache]: Analyzing trace with hash -759260343, now seen corresponding path program 2 times [2022-12-14 14:34:43,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:43,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216780010] [2022-12-14 14:34:43,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:43,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:43,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:43,939 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:43,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216780010] [2022-12-14 14:34:43,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216780010] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:34:43,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:34:43,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 14:34:43,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455627590] [2022-12-14 14:34:43,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:34:43,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 14:34:43,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:43,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 14:34:43,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:34:43,940 INFO L87 Difference]: Start difference. First operand 1228 states and 3303 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:44,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:44,380 INFO L93 Difference]: Finished difference Result 1472 states and 3888 transitions. [2022-12-14 14:34:44,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:34:44,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 14:34:44,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:44,385 INFO L225 Difference]: With dead ends: 1472 [2022-12-14 14:34:44,386 INFO L226 Difference]: Without dead ends: 1472 [2022-12-14 14:34:44,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 14:34:44,386 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 89 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:44,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 26 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 14:34:44,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2022-12-14 14:34:44,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1228. [2022-12-14 14:34:44,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 1180 states have (on average 2.799152542372881) internal successors, (3303), 1227 states have internal predecessors, (3303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 3303 transitions. [2022-12-14 14:34:44,412 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 3303 transitions. Word has length 8 [2022-12-14 14:34:44,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:44,412 INFO L495 AbstractCegarLoop]: Abstraction has 1228 states and 3303 transitions. [2022-12-14 14:34:44,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:44,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 3303 transitions. [2022-12-14 14:34:44,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 14:34:44,413 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:44,413 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:44,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 14:34:44,413 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 14:34:44,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:44,413 INFO L85 PathProgramCache]: Analyzing trace with hash -759359853, now seen corresponding path program 3 times [2022-12-14 14:34:44,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:44,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021240987] [2022-12-14 14:34:44,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:44,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:44,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:44,854 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:44,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021240987] [2022-12-14 14:34:44,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021240987] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:34:44,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:34:44,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 14:34:44,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671997399] [2022-12-14 14:34:44,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:34:44,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 14:34:44,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:44,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 14:34:44,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:34:44,856 INFO L87 Difference]: Start difference. First operand 1228 states and 3303 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:45,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:45,200 INFO L93 Difference]: Finished difference Result 1437 states and 3797 transitions. [2022-12-14 14:34:45,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:34:45,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 14:34:45,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:45,208 INFO L225 Difference]: With dead ends: 1437 [2022-12-14 14:34:45,208 INFO L226 Difference]: Without dead ends: 1437 [2022-12-14 14:34:45,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 14:34:45,209 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 130 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:45,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 21 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 14:34:45,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2022-12-14 14:34:45,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1228. [2022-12-14 14:34:45,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 1180 states have (on average 2.799152542372881) internal successors, (3303), 1227 states have internal predecessors, (3303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:45,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 3303 transitions. [2022-12-14 14:34:45,241 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 3303 transitions. Word has length 8 [2022-12-14 14:34:45,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:45,241 INFO L495 AbstractCegarLoop]: Abstraction has 1228 states and 3303 transitions. [2022-12-14 14:34:45,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:45,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 3303 transitions. [2022-12-14 14:34:45,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 14:34:45,243 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:45,243 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:45,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 14:34:45,243 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 14:34:45,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:45,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1513837204, now seen corresponding path program 1 times [2022-12-14 14:34:45,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:45,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214772726] [2022-12-14 14:34:45,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:45,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:45,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:45,280 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:45,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214772726] [2022-12-14 14:34:45,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214772726] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:34:45,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:34:45,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:34:45,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580346863] [2022-12-14 14:34:45,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:34:45,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:34:45,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:45,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:34:45,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 14:34:45,282 INFO L87 Difference]: Start difference. First operand 1228 states and 3303 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:45,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:45,423 INFO L93 Difference]: Finished difference Result 1990 states and 5370 transitions. [2022-12-14 14:34:45,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 14:34:45,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 14:34:45,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:45,434 INFO L225 Difference]: With dead ends: 1990 [2022-12-14 14:34:45,435 INFO L226 Difference]: Without dead ends: 1990 [2022-12-14 14:34:45,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:34:45,436 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 68 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:45,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 20 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:34:45,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2022-12-14 14:34:45,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1802. [2022-12-14 14:34:45,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1754 states have (on average 2.8916761687571264) internal successors, (5072), 1801 states have internal predecessors, (5072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:45,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 5072 transitions. [2022-12-14 14:34:45,470 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 5072 transitions. Word has length 9 [2022-12-14 14:34:45,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:45,471 INFO L495 AbstractCegarLoop]: Abstraction has 1802 states and 5072 transitions. [2022-12-14 14:34:45,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:45,471 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 5072 transitions. [2022-12-14 14:34:45,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 14:34:45,472 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:45,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:45,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 14:34:45,472 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 14:34:45,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:45,473 INFO L85 PathProgramCache]: Analyzing trace with hash 393815127, now seen corresponding path program 1 times [2022-12-14 14:34:45,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:45,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269514692] [2022-12-14 14:34:45,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:45,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:45,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:45,677 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:45,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269514692] [2022-12-14 14:34:45,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269514692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:34:45,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:34:45,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:34:45,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685015226] [2022-12-14 14:34:45,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:34:45,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 14:34:45,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:45,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 14:34:45,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:34:45,678 INFO L87 Difference]: Start difference. First operand 1802 states and 5072 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:45,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:45,804 INFO L93 Difference]: Finished difference Result 1810 states and 5087 transitions. [2022-12-14 14:34:45,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:34:45,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-14 14:34:45,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:45,810 INFO L225 Difference]: With dead ends: 1810 [2022-12-14 14:34:45,810 INFO L226 Difference]: Without dead ends: 1810 [2022-12-14 14:34:45,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:34:45,811 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:45,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 20 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:34:45,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2022-12-14 14:34:45,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1805. [2022-12-14 14:34:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1805 states, 1757 states have (on average 2.890153671030165) internal successors, (5078), 1804 states have internal predecessors, (5078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:45,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 5078 transitions. [2022-12-14 14:34:45,844 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 5078 transitions. Word has length 10 [2022-12-14 14:34:45,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:45,844 INFO L495 AbstractCegarLoop]: Abstraction has 1805 states and 5078 transitions. [2022-12-14 14:34:45,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:45,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 5078 transitions. [2022-12-14 14:34:45,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 14:34:45,844 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:45,845 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:45,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 14:34:45,845 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 14:34:45,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:45,845 INFO L85 PathProgramCache]: Analyzing trace with hash 489437856, now seen corresponding path program 1 times [2022-12-14 14:34:45,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:45,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525913185] [2022-12-14 14:34:45,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:45,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:46,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:46,182 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:46,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525913185] [2022-12-14 14:34:46,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525913185] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:34:46,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:34:46,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 14:34:46,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735535359] [2022-12-14 14:34:46,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:34:46,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 14:34:46,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:46,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 14:34:46,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:34:46,183 INFO L87 Difference]: Start difference. First operand 1805 states and 5078 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:46,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:46,368 INFO L93 Difference]: Finished difference Result 2308 states and 6366 transitions. [2022-12-14 14:34:46,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:34:46,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 14:34:46,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:46,375 INFO L225 Difference]: With dead ends: 2308 [2022-12-14 14:34:46,375 INFO L226 Difference]: Without dead ends: 2308 [2022-12-14 14:34:46,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 14:34:46,376 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 91 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:46,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 26 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:34:46,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2308 states. [2022-12-14 14:34:46,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2308 to 2050. [2022-12-14 14:34:46,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2050 states, 2002 states have (on average 2.866133866133866) internal successors, (5738), 2049 states have internal predecessors, (5738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:46,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 5738 transitions. [2022-12-14 14:34:46,426 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 5738 transitions. Word has length 11 [2022-12-14 14:34:46,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:46,426 INFO L495 AbstractCegarLoop]: Abstraction has 2050 states and 5738 transitions. [2022-12-14 14:34:46,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:46,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 5738 transitions. [2022-12-14 14:34:46,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 14:34:46,427 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:46,427 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:46,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 14:34:46,427 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 14:34:46,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:46,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1196506376, now seen corresponding path program 1 times [2022-12-14 14:34:46,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:46,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57491504] [2022-12-14 14:34:46,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:46,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:46,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:46,461 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:46,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57491504] [2022-12-14 14:34:46,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57491504] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:34:46,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:34:46,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:34:46,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845795430] [2022-12-14 14:34:46,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:34:46,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:34:46,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:46,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:34:46,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:34:46,463 INFO L87 Difference]: Start difference. First operand 2050 states and 5738 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:46,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:46,514 INFO L93 Difference]: Finished difference Result 590 states and 1369 transitions. [2022-12-14 14:34:46,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:34:46,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 14:34:46,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:46,516 INFO L225 Difference]: With dead ends: 590 [2022-12-14 14:34:46,516 INFO L226 Difference]: Without dead ends: 568 [2022-12-14 14:34:46,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:34:46,516 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 28 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:46,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 6 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 14:34:46,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2022-12-14 14:34:46,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2022-12-14 14:34:46,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 550 states have (on average 2.4127272727272726) internal successors, (1327), 567 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:46,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 1327 transitions. [2022-12-14 14:34:46,529 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 1327 transitions. Word has length 11 [2022-12-14 14:34:46,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:46,529 INFO L495 AbstractCegarLoop]: Abstraction has 568 states and 1327 transitions. [2022-12-14 14:34:46,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:46,529 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 1327 transitions. [2022-12-14 14:34:46,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 14:34:46,530 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:46,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:46,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 14:34:46,530 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 14:34:46,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:46,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1830710074, now seen corresponding path program 2 times [2022-12-14 14:34:46,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:46,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348580234] [2022-12-14 14:34:46,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:46,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:46,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-12-14 14:34:46,907 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:46,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348580234] [2022-12-14 14:34:46,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348580234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:34:46,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:34:46,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 14:34:46,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923590645] [2022-12-14 14:34:46,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:34:46,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 14:34:46,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:46,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 14:34:46,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:34:46,909 INFO L87 Difference]: Start difference. First operand 568 states and 1327 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:47,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:47,067 INFO L93 Difference]: Finished difference Result 796 states and 1848 transitions. [2022-12-14 14:34:47,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:34:47,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 14:34:47,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:47,069 INFO L225 Difference]: With dead ends: 796 [2022-12-14 14:34:47,069 INFO L226 Difference]: Without dead ends: 796 [2022-12-14 14:34:47,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 14:34:47,069 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 38 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:47,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 23 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:34:47,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2022-12-14 14:34:47,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 557. [2022-12-14 14:34:47,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 539 states have (on average 2.4155844155844157) internal successors, (1302), 556 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:47,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1302 transitions. [2022-12-14 14:34:47,081 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 1302 transitions. Word has length 11 [2022-12-14 14:34:47,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:47,081 INFO L495 AbstractCegarLoop]: Abstraction has 557 states and 1302 transitions. [2022-12-14 14:34:47,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:47,081 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 1302 transitions. [2022-12-14 14:34:47,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 14:34:47,082 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:47,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:47,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 14:34:47,082 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 14:34:47,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:47,083 INFO L85 PathProgramCache]: Analyzing trace with hash -674522538, now seen corresponding path program 3 times [2022-12-14 14:34:47,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:47,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837767689] [2022-12-14 14:34:47,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:47,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:47,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:47,370 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:47,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837767689] [2022-12-14 14:34:47,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837767689] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:34:47,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:34:47,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 14:34:47,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554865837] [2022-12-14 14:34:47,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:34:47,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 14:34:47,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:47,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 14:34:47,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 14:34:47,371 INFO L87 Difference]: Start difference. First operand 557 states and 1302 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:47,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:47,570 INFO L93 Difference]: Finished difference Result 774 states and 1798 transitions. [2022-12-14 14:34:47,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:34:47,571 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 14:34:47,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:47,573 INFO L225 Difference]: With dead ends: 774 [2022-12-14 14:34:47,573 INFO L226 Difference]: Without dead ends: 774 [2022-12-14 14:34:47,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 14:34:47,574 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 39 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:47,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 22 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 14:34:47,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2022-12-14 14:34:47,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 546. [2022-12-14 14:34:47,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 528 states have (on average 2.418560606060606) internal successors, (1277), 545 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:47,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1277 transitions. [2022-12-14 14:34:47,582 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1277 transitions. Word has length 11 [2022-12-14 14:34:47,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:47,582 INFO L495 AbstractCegarLoop]: Abstraction has 546 states and 1277 transitions. [2022-12-14 14:34:47,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:47,582 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1277 transitions. [2022-12-14 14:34:47,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 14:34:47,583 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:47,583 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:47,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 14:34:47,583 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 14:34:47,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:47,583 INFO L85 PathProgramCache]: Analyzing trace with hash 499134818, now seen corresponding path program 1 times [2022-12-14 14:34:47,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:47,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503046361] [2022-12-14 14:34:47,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:47,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:47,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-12-14 14:34:47,610 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:47,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503046361] [2022-12-14 14:34:47,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503046361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:34:47,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:34:47,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:34:47,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868502103] [2022-12-14 14:34:47,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:34:47,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:34:47,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:47,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:34:47,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:34:47,611 INFO L87 Difference]: Start difference. First operand 546 states and 1277 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:47,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:47,683 INFO L93 Difference]: Finished difference Result 570 states and 1325 transitions. [2022-12-14 14:34:47,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:34:47,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-14 14:34:47,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:47,687 INFO L225 Difference]: With dead ends: 570 [2022-12-14 14:34:47,687 INFO L226 Difference]: Without dead ends: 570 [2022-12-14 14:34:47,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:34:47,688 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:47,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 9 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:34:47,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2022-12-14 14:34:47,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2022-12-14 14:34:47,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 552 states have (on average 2.4003623188405796) internal successors, (1325), 569 states have internal predecessors, (1325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:47,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1325 transitions. [2022-12-14 14:34:47,695 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 1325 transitions. Word has length 12 [2022-12-14 14:34:47,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:47,695 INFO L495 AbstractCegarLoop]: Abstraction has 570 states and 1325 transitions. [2022-12-14 14:34:47,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:47,695 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 1325 transitions. [2022-12-14 14:34:47,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 14:34:47,696 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:47,696 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:47,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 14:34:47,696 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 14:34:47,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:47,696 INFO L85 PathProgramCache]: Analyzing trace with hash 551037305, now seen corresponding path program 1 times [2022-12-14 14:34:47,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:47,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842279760] [2022-12-14 14:34:47,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:47,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:48,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:48,266 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:48,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842279760] [2022-12-14 14:34:48,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842279760] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:34:48,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432939034] [2022-12-14 14:34:48,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:48,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:34:48,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:34:48,267 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:34:48,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 14:34:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:48,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 67 conjunts are in the unsatisfiable core [2022-12-14 14:34:48,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:34:48,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:34:48,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:34:48,444 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 14:34:48,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-12-14 14:34:48,458 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:34:48,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:34:48,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-12-14 14:34:48,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-12-14 14:34:48,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-12-14 14:34:48,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:34:48,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-12-14 14:34:49,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 63 treesize of output 56 [2022-12-14 14:34:49,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:49,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:34:49,335 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_470 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_89| 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|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_468)) |c_~#stored_elements~0.base| v_ArrVal_470) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_89| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (not (<= v_ArrVal_468 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_89| 4) |c_~#queue~0.offset|) v_ArrVal_472) (+ 88 |c_~#queue~0.offset|))))))) is different from false [2022-12-14 14:34:51,450 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_466 Int) (v_ArrVal_470 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_89| Int) (v_ArrVal_472 Int) (v_ArrVal_468 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_466) .cse2 v_ArrVal_468)) |c_~#stored_elements~0.base| v_ArrVal_470) |c_~#queue~0.base|))) (or (< (+ v_ArrVal_466 2147483648) 0) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_89| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_468) (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_89| 4) |c_~#queue~0.offset|) v_ArrVal_472) (+ 88 |c_~#queue~0.offset|)))))))) is different from false [2022-12-14 14:34:51,492 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_466 Int) (v_ArrVal_464 Int) (v_ArrVal_470 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_89| Int) (v_ArrVal_472 Int) (v_ArrVal_468 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_464)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_466) .cse2 v_ArrVal_468)) |c_~#stored_elements~0.base| v_ArrVal_470) |c_~#queue~0.base|))) (or (< (+ v_ArrVal_466 2147483648) 0) (< 0 (+ (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_89| 4) |c_~#queue~0.offset|) v_ArrVal_472) (+ 88 |c_~#queue~0.offset|)) 2147483650)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_89| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_468))))) is different from false [2022-12-14 14:34:51,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 14:34:51,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432939034] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:34:51,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [803567225] [2022-12-14 14:34:51,762 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:34:51,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:34:51,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-12-14 14:34:51,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014555790] [2022-12-14 14:34:51,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:34:51,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-14 14:34:51,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:34:51,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-14 14:34:51,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=490, Unknown=9, NotChecked=150, Total=812 [2022-12-14 14:34:51,766 INFO L87 Difference]: Start difference. First operand 570 states and 1325 transitions. Second operand has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:54,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:34:54,788 INFO L93 Difference]: Finished difference Result 724 states and 1694 transitions. [2022-12-14 14:34:54,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 14:34:54,788 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 14:34:54,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:34:54,790 INFO L225 Difference]: With dead ends: 724 [2022-12-14 14:34:54,790 INFO L226 Difference]: Without dead ends: 724 [2022-12-14 14:34:54,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=384, Invalid=1023, Unknown=11, NotChecked=222, Total=1640 [2022-12-14 14:34:54,790 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 69 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 24 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 265 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:34:54,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 105 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1029 Invalid, 12 Unknown, 265 Unchecked, 1.1s Time] [2022-12-14 14:34:54,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2022-12-14 14:34:54,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 581. [2022-12-14 14:34:54,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 563 states have (on average 2.4049733570159857) internal successors, (1354), 580 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:54,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 1354 transitions. [2022-12-14 14:34:54,798 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 1354 transitions. Word has length 15 [2022-12-14 14:34:54,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:34:54,798 INFO L495 AbstractCegarLoop]: Abstraction has 581 states and 1354 transitions. [2022-12-14 14:34:54,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:34:54,798 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 1354 transitions. [2022-12-14 14:34:54,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 14:34:54,799 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:34:54,799 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:34:54,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 14:34:55,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:34:55,001 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 14:34:55,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:34:55,002 INFO L85 PathProgramCache]: Analyzing trace with hash 551037306, now seen corresponding path program 1 times [2022-12-14 14:34:55,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:34:55,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406171057] [2022-12-14 14:34:55,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:55,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:34:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:55,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:55,673 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:34:55,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406171057] [2022-12-14 14:34:55,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406171057] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:34:55,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796812543] [2022-12-14 14:34:55,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:34:55,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:34:55,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:34:55,674 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:34:55,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 14:34:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:34:55,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-14 14:34:55,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:34:55,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:34:55,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:34:55,789 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 14:34:55,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-12-14 14:34:55,797 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:34:55,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:34:55,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-12-14 14:34:55,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-12-14 14:34:56,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-12-14 14:34:56,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:34:56,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-12-14 14:34:56,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-12-14 14:34:56,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:34:56,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:34:56,562 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_94| Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_568 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_566) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_94| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_94| 4) |c_~#queue~0.offset|) v_ArrVal_568) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-12-14 14:34:58,761 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_564 Int) (v_ArrVal_562 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_94| Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_568 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_562) .cse2 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))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_94| 4) |c_~#queue~0.offset|) v_ArrVal_568) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_94| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_564))))) is different from false [2022-12-14 14:34:58,785 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_564 Int) (v_ArrVal_562 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_94| Int) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_568 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_562) .cse3 v_ArrVal_564)) |c_~#stored_elements~0.base| v_ArrVal_566) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_562) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_94| 4) |c_~#queue~0.offset|) v_ArrVal_568) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_94| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_564))))) is different from false [2022-12-14 14:34:58,814 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_564 Int) (v_ArrVal_562 Int) (v_ArrVal_561 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_94| Int) (v_ArrVal_566 (Array Int 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)) (.cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse3 v_ArrVal_562) .cse1 v_ArrVal_564)) |c_~#stored_elements~0.base| v_ArrVal_566) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_564) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_94| 4) |c_~#queue~0.offset|) v_ArrVal_568) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_94| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_562))))) is different from false [2022-12-14 14:35:03,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 14:35:03,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796812543] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:35:03,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2136699351] [2022-12-14 14:35:03,076 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:35:03,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:35:03,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-12-14 14:35:03,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608993967] [2022-12-14 14:35:03,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:35:03,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 14:35:03,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:03,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 14:35:03,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=566, Unknown=10, NotChecked=220, Total=992 [2022-12-14 14:35:03,079 INFO L87 Difference]: Start difference. First operand 581 states and 1354 transitions. Second operand has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:06,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:35:08,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:35:10,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:35:10,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:35:10,373 INFO L93 Difference]: Finished difference Result 601 states and 1382 transitions. [2022-12-14 14:35:10,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 14:35:10,373 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 14:35:10,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:35:10,376 INFO L225 Difference]: With dead ends: 601 [2022-12-14 14:35:10,376 INFO L226 Difference]: Without dead ends: 601 [2022-12-14 14:35:10,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=393, Invalid=1169, Unknown=14, NotChecked=316, Total=1892 [2022-12-14 14:35:10,377 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 57 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 16 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 365 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:35:10,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 80 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 653 Invalid, 12 Unknown, 365 Unchecked, 6.3s Time] [2022-12-14 14:35:10,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-12-14 14:35:10,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 581. [2022-12-14 14:35:10,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 563 states have (on average 2.4014209591474245) internal successors, (1352), 580 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:10,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 1352 transitions. [2022-12-14 14:35:10,388 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 1352 transitions. Word has length 15 [2022-12-14 14:35:10,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:35:10,388 INFO L495 AbstractCegarLoop]: Abstraction has 581 states and 1352 transitions. [2022-12-14 14:35:10,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 31 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:10,388 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 1352 transitions. [2022-12-14 14:35:10,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 14:35:10,389 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:35:10,389 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:35:10,393 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-14 14:35:10,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 14:35:10,591 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 14:35:10,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:35:10,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1170958128, now seen corresponding path program 1 times [2022-12-14 14:35:10,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:35:10,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142723569] [2022-12-14 14:35:10,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:10,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:35:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:10,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:10,909 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:10,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142723569] [2022-12-14 14:35:10,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142723569] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:10,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789097139] [2022-12-14 14:35:10,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:10,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:10,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:35:10,910 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:35:10,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 14:35:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:10,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 14:35:10,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:35:11,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:35:11,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 14:35:11,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:35:11,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 14:35:11,210 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 14:35:11,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-12-14 14:35:11,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:11,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:35:11,368 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_653 Int) (v_ArrVal_651 (Array Int Int))) (or (< 0 (+ (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_651) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_653) (+ 88 |c_~#queue~0.offset|)) 2147483650)) (< (+ v_ArrVal_653 2147483648) 0))) is different from false [2022-12-14 14:35:11,468 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:11,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2022-12-14 14:35:11,478 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:11,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 59 [2022-12-14 14:35:11,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-12-14 14:35:11,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-12-14 14:35:11,509 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:11,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 47 [2022-12-14 14:35:11,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:11,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789097139] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:35:11,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [817994679] [2022-12-14 14:35:11,587 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:35:11,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:35:11,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-14 14:35:11,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267018289] [2022-12-14 14:35:11,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:35:11,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 14:35:11,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:11,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 14:35:11,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=4, NotChecked=40, Total=506 [2022-12-14 14:35:11,589 INFO L87 Difference]: Start difference. First operand 581 states and 1352 transitions. Second operand has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:12,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:35:12,105 INFO L93 Difference]: Finished difference Result 1235 states and 2870 transitions. [2022-12-14 14:35:12,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 14:35:12,105 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 14:35:12,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:35:12,107 INFO L225 Difference]: With dead ends: 1235 [2022-12-14 14:35:12,108 INFO L226 Difference]: Without dead ends: 1235 [2022-12-14 14:35:12,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=4, NotChecked=50, Total=756 [2022-12-14 14:35:12,108 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 577 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:35:12,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 46 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 501 Invalid, 0 Unknown, 83 Unchecked, 0.4s Time] [2022-12-14 14:35:12,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2022-12-14 14:35:12,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 712. [2022-12-14 14:35:12,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 694 states have (on average 2.4798270893371757) internal successors, (1721), 711 states have internal predecessors, (1721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:12,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1721 transitions. [2022-12-14 14:35:12,119 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1721 transitions. Word has length 16 [2022-12-14 14:35:12,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:35:12,119 INFO L495 AbstractCegarLoop]: Abstraction has 712 states and 1721 transitions. [2022-12-14 14:35:12,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:12,119 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1721 transitions. [2022-12-14 14:35:12,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 14:35:12,119 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:35:12,120 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:35:12,124 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 14:35:12,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 14:35:12,321 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 14:35:12,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:35:12,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1170958127, now seen corresponding path program 1 times [2022-12-14 14:35:12,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:35:12,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991642103] [2022-12-14 14:35:12,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:12,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:35:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:13,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:13,194 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:13,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991642103] [2022-12-14 14:35:13,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991642103] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:13,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725529715] [2022-12-14 14:35:13,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:13,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:13,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:35:13,195 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:35:13,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 14:35:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:13,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 79 conjunts are in the unsatisfiable core [2022-12-14 14:35:13,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:35:13,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:35:13,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:35:13,307 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 14:35:13,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-12-14 14:35:13,325 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 14:35:13,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 14:35:13,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-12-14 14:35:13,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2022-12-14 14:35:13,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 66 [2022-12-14 14:35:13,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2022-12-14 14:35:13,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:35:13,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 43 [2022-12-14 14:35:13,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2022-12-14 14:35:13,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:13,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:35:13,919 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_754 (Array Int Int)) (v_ArrVal_755 Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_754) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 (+ 84 |c_~#queue~0.offset|))) |c_~#queue~0.offset|) v_ArrVal_755)) (+ 88 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-12-14 14:35:13,988 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_754 (Array Int Int)) (v_ArrVal_755 Int)) (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_754) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4) |c_~#queue~0.offset|) v_ArrVal_755)) (+ 88 |c_~#queue~0.offset|)) 2147483647)) is different from false [2022-12-14 14:35:14,006 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_754 (Array Int Int)) (v_ArrVal_751 Int) (v_ArrVal_755 Int)) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_751) .cse2 (+ (select .cse1 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_754) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_755)) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_751 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))))) is different from false [2022-12-14 14:35:14,020 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_754 (Array Int Int)) (v_ArrVal_751 Int) (v_ArrVal_755 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse1 .cse2 v_ArrVal_751) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_754) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_755)) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_751)))) is different from false [2022-12-14 14:35:14,034 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_754 (Array Int Int)) (v_ArrVal_751 Int) (v_ArrVal_749 Int) (v_ArrVal_755 Int)) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.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_749))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_751) (< (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse0 .cse1 v_ArrVal_751) .cse3 (+ (select .cse0 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_754) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* 4 (select .cse2 (+ 84 |c_~#queue~0.offset|)))) v_ArrVal_755)) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-12-14 14:35:14,137 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_754 (Array Int Int)) (v_ArrVal_751 Int) (v_ArrVal_747 (Array Int Int)) (v_ArrVal_749 Int) (v_ArrVal_755 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_747))) (let ((.cse3 (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_749))) (.cse4 (+ 88 |c_~#queue~0.offset|))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_751) .cse1 (+ (select .cse3 .cse1) 1))) |c_~#stored_elements~0.base| v_ArrVal_754) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_755)) .cse4) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_751))))) is different from false [2022-12-14 14:35:14,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 14:35:14,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725529715] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:35:14,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1988695499] [2022-12-14 14:35:14,148 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:35:14,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:35:14,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-14 14:35:14,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808364665] [2022-12-14 14:35:14,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:35:14,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 14:35:14,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:14,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 14:35:14,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=645, Unknown=6, NotChecked=354, Total=1190 [2022-12-14 14:35:14,149 INFO L87 Difference]: Start difference. First operand 712 states and 1721 transitions. Second operand has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:18,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:35:20,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:35:22,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:35:24,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:35:24,672 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse2 .cse3))) (and (<= .cse0 1) (< 0 (+ |c_t1Thread1of1ForFork1_enqueue_~q#1.offset| 1)) (forall ((v_ArrVal_754 (Array Int Int)) (v_ArrVal_751 Int) (v_ArrVal_755 Int)) (or (< (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 .cse3 v_ArrVal_751) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_754) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 (+ 84 |c_~#queue~0.offset|)) 4)) v_ArrVal_755)) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ .cse0 1) v_ArrVal_751)))))) is different from false [2022-12-14 14:35:24,984 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse4 (+ 88 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_754 (Array Int Int)) (v_ArrVal_755 Int)) (< (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 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_754) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_755)) .cse4) 2147483647)) (forall ((v_ArrVal_755 Int)) (< (select (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_755)) .cse4) 2147483647)))) is different from false [2022-12-14 14:35:26,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:35:26,195 INFO L93 Difference]: Finished difference Result 1605 states and 3844 transitions. [2022-12-14 14:35:26,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-14 14:35:26,195 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 14:35:26,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:35:26,198 INFO L225 Difference]: With dead ends: 1605 [2022-12-14 14:35:26,198 INFO L226 Difference]: Without dead ends: 1605 [2022-12-14 14:35:26,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 9 SyntacticMatches, 7 SemanticMatches, 58 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=557, Invalid=2119, Unknown=8, NotChecked=856, Total=3540 [2022-12-14 14:35:26,199 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 452 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 1584 mSolverCounterSat, 18 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 3372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1584 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 1751 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-12-14 14:35:26,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 246 Invalid, 3372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1584 Invalid, 19 Unknown, 1751 Unchecked, 10.5s Time] [2022-12-14 14:35:26,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2022-12-14 14:35:26,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 991. [2022-12-14 14:35:26,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 973 states have (on average 2.5149023638232273) internal successors, (2447), 990 states have internal predecessors, (2447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:26,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 2447 transitions. [2022-12-14 14:35:26,212 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 2447 transitions. Word has length 16 [2022-12-14 14:35:26,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:35:26,212 INFO L495 AbstractCegarLoop]: Abstraction has 991 states and 2447 transitions. [2022-12-14 14:35:26,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:26,212 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 2447 transitions. [2022-12-14 14:35:26,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 14:35:26,213 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:35:26,213 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:35:26,217 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 14:35:26,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 14:35:26,415 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 14:35:26,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:35:26,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1654629995, now seen corresponding path program 2 times [2022-12-14 14:35:26,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:35:26,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847503718] [2022-12-14 14:35:26,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:26,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:35:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:26,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:26,999 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:26,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847503718] [2022-12-14 14:35:27,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847503718] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:27,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066066589] [2022-12-14 14:35:27,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:35:27,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:27,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:35:27,001 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:35:27,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 14:35:27,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:35:27,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:35:27,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-14 14:35:27,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:35:27,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:35:27,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:35:27,130 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 14:35:27,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-12-14 14:35:27,147 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 14:35:27,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 14:35:27,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2022-12-14 14:35:27,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-12-14 14:35:27,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-12-14 14:35:27,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-12-14 14:35:27,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:35:27,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-12-14 14:35:27,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-12-14 14:35:27,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-12-14 14:35:27,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:35:28,009 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_857 (Array Int Int)) (v_ArrVal_859 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_857) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_859) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse0 (+ 84 |c_~#queue~0.offset|))))))) is different from false [2022-12-14 14:35:29,409 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_852 Int) (v_ArrVal_857 (Array Int Int)) (v_ArrVal_859 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int) (v_ArrVal_850 (Array Int Int)) (v_ArrVal_855 Int) (v_ArrVal_853 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_850))) (let ((.cse1 (store (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_852)) (.cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_853) .cse3 v_ArrVal_855)) |c_~#stored_elements~0.base| v_ArrVal_857) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_859) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_853) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse3) 1) v_ArrVal_855)))))) is different from false [2022-12-14 14:35:31,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:31,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066066589] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:35:31,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1968457117] [2022-12-14 14:35:31,914 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:35:31,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:35:31,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-14 14:35:31,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222508120] [2022-12-14 14:35:31,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:35:31,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 14:35:31,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:31,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 14:35:31,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=785, Unknown=35, NotChecked=126, Total=1190 [2022-12-14 14:35:31,915 INFO L87 Difference]: Start difference. First operand 991 states and 2447 transitions. Second operand has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:36,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:35:40,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:35:40,289 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ (select .cse4 .cse5) 1))) (and (forall ((v_ArrVal_857 (Array Int Int)) (v_ArrVal_859 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int) (v_ArrVal_855 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_855)) |c_~#stored_elements~0.base| v_ArrVal_857) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_859) .cse1) 2147483647) (< .cse2 v_ArrVal_855) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse0 .cse3)))))) (forall ((v_ArrVal_857 (Array Int Int)) (v_ArrVal_859 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| Int) (v_ArrVal_855 Int) (v_ArrVal_853 Int)) (let ((.cse6 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_853) .cse5 v_ArrVal_855)) |c_~#stored_elements~0.base| v_ArrVal_857) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| (select .cse6 .cse3))) (< (select (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_108| 4)) v_ArrVal_859) .cse1) 2147483647) (< .cse2 v_ArrVal_855) (not (<= v_ArrVal_853 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))))))))) is different from false [2022-12-14 14:35:43,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:35:43,468 INFO L93 Difference]: Finished difference Result 1488 states and 3648 transitions. [2022-12-14 14:35:43,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 14:35:43,469 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 14:35:43,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:35:43,471 INFO L225 Difference]: With dead ends: 1488 [2022-12-14 14:35:43,471 INFO L226 Difference]: Without dead ends: 1488 [2022-12-14 14:35:43,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=470, Invalid=1472, Unknown=50, NotChecked=264, Total=2256 [2022-12-14 14:35:43,472 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 410 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 24 mSolverCounterUnsat, 64 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 64 IncrementalHoareTripleChecker+Unknown, 445 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-12-14 14:35:43,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 155 Invalid, 1698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1165 Invalid, 64 Unknown, 445 Unchecked, 7.4s Time] [2022-12-14 14:35:43,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2022-12-14 14:35:43,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 833. [2022-12-14 14:35:43,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 815 states have (on average 2.528834355828221) internal successors, (2061), 832 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:43,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 2061 transitions. [2022-12-14 14:35:43,484 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 2061 transitions. Word has length 16 [2022-12-14 14:35:43,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:35:43,485 INFO L495 AbstractCegarLoop]: Abstraction has 833 states and 2061 transitions. [2022-12-14 14:35:43,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:43,485 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 2061 transitions. [2022-12-14 14:35:43,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 14:35:43,485 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:35:43,485 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:35:43,489 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 14:35:43,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 14:35:43,687 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 14:35:43,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:35:43,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1448019792, now seen corresponding path program 2 times [2022-12-14 14:35:43,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:35:43,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895901717] [2022-12-14 14:35:43,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:43,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:35:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:44,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:44,119 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:44,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895901717] [2022-12-14 14:35:44,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895901717] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:44,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692644048] [2022-12-14 14:35:44,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:35:44,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:44,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:35:44,120 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:35:44,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 14:35:44,236 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:35:44,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:35:44,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 14:35:44,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:35:44,256 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 14:35:44,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 14:35:44,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 14:35:44,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:35:44,380 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-12-14 14:35:44,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-12-14 14:35:44,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:35:44,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 14:35:44,506 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 14:35:44,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2022-12-14 14:35:44,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:44,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:35:44,618 WARN L837 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_#t~mem36#1| Int) (v_ArrVal_945 (Array Int Int)) (v_ArrVal_947 Int)) (or (< (+ v_ArrVal_947 2147483648) 0) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_945) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* 4 |t1Thread1of1ForFork1_enqueue_#t~mem36#1|)) v_ArrVal_947) (+ 88 |c_~#queue~0.offset|)))))) is different from false [2022-12-14 14:35:44,775 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:44,775 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-12-14 14:35:44,785 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:44,785 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 445 treesize of output 443 [2022-12-14 14:35:44,793 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 522 treesize of output 490 [2022-12-14 14:35:44,800 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 764 treesize of output 740 [2022-12-14 14:35:45,438 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-12-14 14:35:45,446 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-12-14 14:35:45,460 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 14:35:45,460 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 457 treesize of output 429 [2022-12-14 14:35:45,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:45,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692644048] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:35:45,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1959438441] [2022-12-14 14:35:45,577 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:35:45,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:35:45,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-14 14:35:45,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218046527] [2022-12-14 14:35:45,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:35:45,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 14:35:45,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:45,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 14:35:45,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=472, Unknown=17, NotChecked=46, Total=650 [2022-12-14 14:35:45,578 INFO L87 Difference]: Start difference. First operand 833 states and 2061 transitions. Second operand has 26 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:45,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:35:45,978 INFO L93 Difference]: Finished difference Result 918 states and 2248 transitions. [2022-12-14 14:35:45,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 14:35:45,979 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 14:35:45,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:35:45,980 INFO L225 Difference]: With dead ends: 918 [2022-12-14 14:35:45,980 INFO L226 Difference]: Without dead ends: 918 [2022-12-14 14:35:45,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=160, Invalid=582, Unknown=18, NotChecked=52, Total=812 [2022-12-14 14:35:45,981 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 377 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:35:45,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 32 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 353 Invalid, 0 Unknown, 71 Unchecked, 0.3s Time] [2022-12-14 14:35:45,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2022-12-14 14:35:45,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 734. [2022-12-14 14:35:45,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 718 states have (on average 2.4582172701949863) internal successors, (1765), 733 states have internal predecessors, (1765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:45,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1765 transitions. [2022-12-14 14:35:45,990 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1765 transitions. Word has length 16 [2022-12-14 14:35:45,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:35:45,990 INFO L495 AbstractCegarLoop]: Abstraction has 734 states and 1765 transitions. [2022-12-14 14:35:45,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.92) internal successors, (48), 25 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:45,990 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1765 transitions. [2022-12-14 14:35:45,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 14:35:45,990 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:35:45,990 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:35:45,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 14:35:46,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 14:35:46,192 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 14:35:46,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:35:46,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1448019791, now seen corresponding path program 3 times [2022-12-14 14:35:46,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:35:46,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184573346] [2022-12-14 14:35:46,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:46,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:35:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:46,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:46,973 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:46,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184573346] [2022-12-14 14:35:46,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184573346] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:46,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198867564] [2022-12-14 14:35:46,973 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:35:46,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:46,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:35:46,974 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:35:46,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 14:35:47,070 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:35:47,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:35:47,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-14 14:35:47,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:35:47,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:35:47,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:35:47,096 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 14:35:47,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-12-14 14:35:47,113 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 14:35:47,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 14:35:47,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-12-14 14:35:47,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-12-14 14:35:47,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-12-14 14:35:47,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-12-14 14:35:47,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:35:47,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-12-14 14:35:47,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-12-14 14:35:48,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:48,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:35:48,409 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1046 Int) (v_ArrVal_1048 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| Int) (v_ArrVal_1049 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|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1046)) |c_~#stored_elements~0.base| v_ArrVal_1048) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| 4) |c_~#queue~0.offset|) v_ArrVal_1049) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (not (<= v_ArrVal_1046 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))))) is different from false [2022-12-14 14:35:48,518 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1046 Int) (v_ArrVal_1048 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| Int) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1049 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1045))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1046)) |c_~#stored_elements~0.base| v_ArrVal_1048) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1046) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| 4) |c_~#queue~0.offset|) v_ArrVal_1049) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| (select .cse2 (+ 84 |c_~#queue~0.offset|))))))))) is different from false [2022-12-14 14:35:48,555 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1044 Int) (v_ArrVal_1046 Int) (v_ArrVal_1048 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| Int) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1049 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|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1044)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1045))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1046)) |c_~#stored_elements~0.base| v_ArrVal_1048) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1044 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse0 .cse1) 1) v_ArrVal_1046) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| 4) |c_~#queue~0.offset|) v_ArrVal_1049) (+ 88 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-12-14 14:35:48,582 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1044 Int) (v_ArrVal_1046 Int) (v_ArrVal_1048 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| Int) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1049 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1044)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1045))) (let ((.cse2 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1046)) |c_~#stored_elements~0.base| v_ArrVal_1048) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1044) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1046) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| (select .cse4 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| 4) |c_~#queue~0.offset|) v_ArrVal_1049) (+ 88 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2022-12-14 14:35:48,613 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1042 Int) (v_ArrVal_1044 Int) (v_ArrVal_1046 Int) (v_ArrVal_1048 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| Int) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1049 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_1042)) (.cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1044)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1045))) (let ((.cse0 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1046)) |c_~#stored_elements~0.base| v_ArrVal_1048) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1046) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_1044) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| 4) |c_~#queue~0.offset|) v_ArrVal_1049) (+ 88 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2022-12-14 14:35:48,641 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1042 Int) (v_ArrVal_1044 Int) (v_ArrVal_1046 Int) (v_ArrVal_1048 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| Int) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1049 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| 4) |c_~#queue~0.offset|) v_ArrVal_1042)) (.cse4 (+ 88 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse5 .cse4 v_ArrVal_1044)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1045))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_1046)) |c_~#stored_elements~0.base| v_ArrVal_1048) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1046) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_118| (select .cse3 .cse1))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_117| 4) |c_~#queue~0.offset|) v_ArrVal_1049) .cse4) 2147483647) (< (+ (select .cse5 .cse4) 1) v_ArrVal_1044)))))))) is different from false [2022-12-14 14:35:48,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-14 14:35:48,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198867564] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:35:48,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1856240468] [2022-12-14 14:35:48,707 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:35:48,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:35:48,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-14 14:35:48,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308128568] [2022-12-14 14:35:48,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:35:48,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 14:35:48,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:35:48,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 14:35:48,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=610, Unknown=12, NotChecked=354, Total=1190 [2022-12-14 14:35:48,708 INFO L87 Difference]: Start difference. First operand 734 states and 1765 transitions. Second operand has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:55,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:35:55,838 INFO L93 Difference]: Finished difference Result 983 states and 2339 transitions. [2022-12-14 14:35:55,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 14:35:55,838 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 14:35:55,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:35:55,840 INFO L225 Difference]: With dead ends: 983 [2022-12-14 14:35:55,840 INFO L226 Difference]: Without dead ends: 983 [2022-12-14 14:35:55,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=477, Invalid=1173, Unknown=14, NotChecked=498, Total=2162 [2022-12-14 14:35:55,841 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 443 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 38 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 772 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:35:55,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 118 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 860 Invalid, 2 Unknown, 772 Unchecked, 1.3s Time] [2022-12-14 14:35:55,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2022-12-14 14:35:55,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 745. [2022-12-14 14:35:55,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 729 states have (on average 2.455418381344307) internal successors, (1790), 744 states have internal predecessors, (1790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:55,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1790 transitions. [2022-12-14 14:35:55,850 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1790 transitions. Word has length 16 [2022-12-14 14:35:55,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:35:55,850 INFO L495 AbstractCegarLoop]: Abstraction has 745 states and 1790 transitions. [2022-12-14 14:35:55,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:35:55,850 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1790 transitions. [2022-12-14 14:35:55,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 14:35:55,851 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:35:55,851 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:35:55,855 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 14:35:56,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:56,053 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 14:35:56,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:35:56,054 INFO L85 PathProgramCache]: Analyzing trace with hash -99715525, now seen corresponding path program 4 times [2022-12-14 14:35:56,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:35:56,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703184344] [2022-12-14 14:35:56,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:35:56,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:35:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:57,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:57,070 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:35:57,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703184344] [2022-12-14 14:35:57,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703184344] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:35:57,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523219216] [2022-12-14 14:35:57,070 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:35:57,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:35:57,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:35:57,071 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:35:57,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 14:35:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:35:57,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-14 14:35:57,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:35:57,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:35:57,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:35:57,199 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 14:35:57,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-12-14 14:35:57,216 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 14:35:57,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 14:35:57,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-12-14 14:35:57,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-12-14 14:35:57,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-12-14 14:35:57,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-12-14 14:35:57,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:35:57,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-12-14 14:35:57,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-12-14 14:35:58,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:35:58,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:35:58,207 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| Int) (v_ArrVal_1153 Int) (v_ArrVal_1151 (Array Int Int)) (v_ArrVal_1150 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1150) |c_~#stored_elements~0.base| v_ArrVal_1151) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| 4) |c_~#queue~0.offset|) v_ArrVal_1153) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| (select .cse0 (+ 84 |c_~#queue~0.offset|))))))) is different from false [2022-12-14 14:36:00,340 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| Int) (v_ArrVal_1153 Int) (v_ArrVal_1148 Int) (v_ArrVal_1151 (Array Int Int)) (v_ArrVal_1150 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1148)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1150) |c_~#stored_elements~0.base| v_ArrVal_1151) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| 4) |c_~#queue~0.offset|) v_ArrVal_1153) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1148))))) is different from false [2022-12-14 14:36:00,555 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| Int) (v_ArrVal_1153 Int) (v_ArrVal_1147 Int) (v_ArrVal_1148 Int) (v_ArrVal_1151 (Array Int Int)) (v_ArrVal_1150 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse3 v_ArrVal_1147) .cse2 v_ArrVal_1148)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1150) |c_~#stored_elements~0.base| v_ArrVal_1151) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_122| 4) |c_~#queue~0.offset|) v_ArrVal_1153) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1148) (< (+ (select .cse1 .cse3) 1) v_ArrVal_1147))))) is different from false [2022-12-14 14:36:10,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 14:36:10,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523219216] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:36:10,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1795462309] [2022-12-14 14:36:10,450 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:36:10,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:36:10,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-14 14:36:10,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846200070] [2022-12-14 14:36:10,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:36:10,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 14:36:10,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:36:10,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 14:36:10,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=758, Unknown=18, NotChecked=186, Total=1190 [2022-12-14 14:36:10,451 INFO L87 Difference]: Start difference. First operand 745 states and 1790 transitions. Second operand has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:36:22,881 WARN L233 SmtUtils]: Spent 8.63s on a formula simplification. DAG size of input: 129 DAG size of output: 126 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:37:19,609 WARN L233 SmtUtils]: Spent 52.95s on a formula simplification. DAG size of input: 109 DAG size of output: 106 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:37:26,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:37:28,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:37:31,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:37:34,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:37:36,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:37:38,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:37:40,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:37:40,102 INFO L93 Difference]: Finished difference Result 1798 states and 4326 transitions. [2022-12-14 14:37:40,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-14 14:37:40,102 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 14:37:40,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:37:40,105 INFO L225 Difference]: With dead ends: 1798 [2022-12-14 14:37:40,105 INFO L226 Difference]: Without dead ends: 1798 [2022-12-14 14:37:40,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 85.7s TimeCoverageRelationStatistics Valid=628, Invalid=1799, Unknown=35, NotChecked=294, Total=2756 [2022-12-14 14:37:40,106 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 787 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 45 mSolverCounterUnsat, 58 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 2065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 58 IncrementalHoareTripleChecker+Unknown, 558 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2022-12-14 14:37:40,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 184 Invalid, 2065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1404 Invalid, 58 Unknown, 558 Unchecked, 16.9s Time] [2022-12-14 14:37:40,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2022-12-14 14:37:40,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 734. [2022-12-14 14:37:40,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 718 states have (on average 2.4582172701949863) internal successors, (1765), 733 states have internal predecessors, (1765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:40,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1765 transitions. [2022-12-14 14:37:40,117 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1765 transitions. Word has length 16 [2022-12-14 14:37:40,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:37:40,118 INFO L495 AbstractCegarLoop]: Abstraction has 734 states and 1765 transitions. [2022-12-14 14:37:40,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:37:40,118 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1765 transitions. [2022-12-14 14:37:40,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 14:37:40,118 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:37:40,118 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:37:40,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 14:37:40,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:40,320 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 14:37:40,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:37:40,321 INFO L85 PathProgramCache]: Analyzing trace with hash -97710445, now seen corresponding path program 5 times [2022-12-14 14:37:40,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:37:40,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116310290] [2022-12-14 14:37:40,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:37:40,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:37:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:37:41,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:41,389 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:37:41,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116310290] [2022-12-14 14:37:41,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116310290] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:37:41,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042857525] [2022-12-14 14:37:41,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 14:37:41,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:37:41,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:37:41,390 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:37:41,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 14:37:41,546 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 14:37:41,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:37:41,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-14 14:37:41,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:37:41,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:37:41,571 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 14:37:41,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-12-14 14:37:41,585 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 14:37:41,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 14:37:41,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-12-14 14:37:41,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-12-14 14:37:41,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-12-14 14:37:42,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-12-14 14:37:42,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-12-14 14:37:42,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 54 [2022-12-14 14:37:42,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:37:42,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:37:42,603 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1255 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_127| Int) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1253 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1253))) (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_127| 4) |c_~#queue~0.offset|) v_ArrVal_1255)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1256) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_127| (select .cse1 (+ 84 |c_~#queue~0.offset|)))))))) is different from false [2022-12-14 14:37:42,618 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1252 Int) (v_ArrVal_1255 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_127| Int) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1253 (Array Int 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|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1252)) |c_~#stored_elements~0.base| v_ArrVal_1253))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1252 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_127| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_127| 4) |c_~#queue~0.offset|) v_ArrVal_1255)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1256) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-12-14 14:37:42,753 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1252 Int) (v_ArrVal_1255 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_127| Int) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1249 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1249) .cse3 v_ArrVal_1252)) |c_~#stored_elements~0.base| v_ArrVal_1253))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1249 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_127| 4) |c_~#queue~0.offset|) v_ArrVal_1255)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1256) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_127| (select .cse1 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1252)))))) is different from false [2022-12-14 14:37:42,896 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1252 Int) (v_ArrVal_1255 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_127| Int) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1247 Int) (v_ArrVal_1249 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_1247)) (.cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse4 v_ArrVal_1249) .cse3 v_ArrVal_1252)) |c_~#stored_elements~0.base| v_ArrVal_1253))) (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_127| 4) |c_~#queue~0.offset|) v_ArrVal_1255)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1256) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1252) (< (+ (select .cse2 .cse4) 1) v_ArrVal_1249) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_127| (select .cse1 (+ 84 |c_~#queue~0.offset|))))))))) is different from false [2022-12-14 14:37:49,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 14:37:49,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042857525] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:37:49,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1363303562] [2022-12-14 14:37:49,998 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:37:49,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:37:49,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-14 14:37:49,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689374611] [2022-12-14 14:37:49,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:37:49,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 14:37:49,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:37:49,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 14:37:49,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=704, Unknown=17, NotChecked=244, Total=1190 [2022-12-14 14:37:49,999 INFO L87 Difference]: Start difference. First operand 734 states and 1765 transitions. Second operand has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:03,603 WARN L233 SmtUtils]: Spent 6.68s on a formula simplification. DAG size of input: 159 DAG size of output: 104 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:38:05,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:38:06,507 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1252 Int) (v_ArrVal_1255 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_127| Int) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1253 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1252)) |c_~#stored_elements~0.base| v_ArrVal_1253))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1252 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_127| (select .cse0 .cse1))) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_127| 4) |c_~#queue~0.offset|) v_ArrVal_1255)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1256) |c_~#queue~0.base|) .cse3) 2147483647))))) (forall ((v_ArrVal_1252 Int) (v_ArrVal_1255 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_127| Int) (v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1253 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1252)) |c_~#stored_elements~0.base| v_ArrVal_1253))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_127| (select .cse6 .cse1))) (< (+ (select .cse4 .cse5) 1) v_ArrVal_1252) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_127| 4) |c_~#queue~0.offset|) v_ArrVal_1255)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1256) |c_~#queue~0.base|) .cse3) 2147483647))))))) is different from false [2022-12-14 14:38:07,480 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1255 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_127| Int) (v_ArrVal_1256 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_127| 4) |c_~#queue~0.offset|) v_ArrVal_1255)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1256) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_127| (select .cse0 (+ 84 |c_~#queue~0.offset|))))))) (forall ((v_ArrVal_1255 Int) (v_ArrVal_1256 (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_1255)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1256) |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647))) is different from false [2022-12-14 14:38:08,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:38:08,525 INFO L93 Difference]: Finished difference Result 1357 states and 3308 transitions. [2022-12-14 14:38:08,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 14:38:08,526 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 14:38:08,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:38:08,529 INFO L225 Difference]: With dead ends: 1357 [2022-12-14 14:38:08,529 INFO L226 Difference]: Without dead ends: 1357 [2022-12-14 14:38:08,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=441, Invalid=1124, Unknown=19, NotChecked=486, Total=2070 [2022-12-14 14:38:08,530 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 741 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 89 mSolverCounterUnsat, 97 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 2069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 97 IncrementalHoareTripleChecker+Unknown, 798 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:38:08,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 158 Invalid, 2069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1085 Invalid, 97 Unknown, 798 Unchecked, 6.0s Time] [2022-12-14 14:38:08,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2022-12-14 14:38:08,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 832. [2022-12-14 14:38:08,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 816 states have (on average 2.5612745098039214) internal successors, (2090), 831 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:08,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 2090 transitions. [2022-12-14 14:38:08,542 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 2090 transitions. Word has length 16 [2022-12-14 14:38:08,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:38:08,542 INFO L495 AbstractCegarLoop]: Abstraction has 832 states and 2090 transitions. [2022-12-14 14:38:08,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:08,542 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 2090 transitions. [2022-12-14 14:38:08,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 14:38:08,542 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:38:08,543 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:38:08,547 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 14:38:08,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:08,743 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 14:38:08,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:38:08,744 INFO L85 PathProgramCache]: Analyzing trace with hash 583735446, now seen corresponding path program 1 times [2022-12-14 14:38:08,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:38:08,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014715208] [2022-12-14 14:38:08,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:38:08,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:38:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:09,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:38:09,057 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:38:09,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014715208] [2022-12-14 14:38:09,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014715208] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:38:09,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606957682] [2022-12-14 14:38:09,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:38:09,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:09,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:38:09,058 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:38:09,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 14:38:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:09,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-14 14:38:09,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:38:09,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:38:09,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:38:09,171 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 14:38:09,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-12-14 14:38:09,179 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-14 14:38:09,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-14 14:38:09,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-12-14 14:38:09,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-12-14 14:38:09,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-12-14 14:38:09,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:38:09,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-12-14 14:38:09,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 85 [2022-12-14 14:38:09,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 83 [2022-12-14 14:38:09,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:38:09,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:38:09,857 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_132| Int) (v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1355 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1354) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< 0 (+ (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_132| 4) |c_~#queue~0.offset|) v_ArrVal_1355) .cse1) 2147483650)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_132| (select .cse0 .cse1)))))) is different from false [2022-12-14 14:38:09,937 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_132| Int) (v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1355 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1354) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_132| 4) |c_~#queue~0.offset|) v_ArrVal_1355) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_132| (select .cse0 .cse1)))))) is different from false [2022-12-14 14:38:09,964 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_132| Int) (v_ArrVal_1351 Int) (v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1355 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1351) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1354) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_132| (select .cse0 .cse1))) (< 0 (+ (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_132| 4) |c_~#queue~0.offset|) v_ArrVal_1355) .cse1) 2147483650))))) is different from false [2022-12-14 14:38:09,995 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_132| Int) (v_ArrVal_1351 Int) (v_ArrVal_1354 (Array Int Int)) (v_ArrVal_1355 Int) (v_ArrVal_1349 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1349)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1351) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1354) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_132| 4) |c_~#queue~0.offset|) v_ArrVal_1355) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_132| (select .cse0 .cse1)))))) is different from false [2022-12-14 14:38:10,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-12-14 14:38:10,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606957682] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:38:10,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1111086952] [2022-12-14 14:38:10,130 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:38:10,130 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:38:10,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 24 [2022-12-14 14:38:10,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527177849] [2022-12-14 14:38:10,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:38:10,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 14:38:10,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:38:10,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 14:38:10,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=364, Unknown=10, NotChecked=172, Total=650 [2022-12-14 14:38:10,132 INFO L87 Difference]: Start difference. First operand 832 states and 2090 transitions. Second operand has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:13,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:38:19,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:38:19,114 INFO L93 Difference]: Finished difference Result 1998 states and 4884 transitions. [2022-12-14 14:38:19,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 14:38:19,115 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-14 14:38:19,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:38:19,118 INFO L225 Difference]: With dead ends: 1998 [2022-12-14 14:38:19,118 INFO L226 Difference]: Without dead ends: 1998 [2022-12-14 14:38:19,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=415, Invalid=1312, Unknown=11, NotChecked=332, Total=2070 [2022-12-14 14:38:19,119 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 412 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 86 mSolverCounterUnsat, 25 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 2296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 25 IncrementalHoareTripleChecker+Unknown, 697 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-12-14 14:38:19,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 167 Invalid, 2296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1488 Invalid, 25 Unknown, 697 Unchecked, 4.8s Time] [2022-12-14 14:38:19,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2022-12-14 14:38:19,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1320. [2022-12-14 14:38:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1304 states have (on average 2.6180981595092025) internal successors, (3414), 1319 states have internal predecessors, (3414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:19,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 3414 transitions. [2022-12-14 14:38:19,139 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 3414 transitions. Word has length 18 [2022-12-14 14:38:19,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:38:19,139 INFO L495 AbstractCegarLoop]: Abstraction has 1320 states and 3414 transitions. [2022-12-14 14:38:19,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:19,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 3414 transitions. [2022-12-14 14:38:19,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 14:38:19,140 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:38:19,140 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:38:19,144 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 14:38:19,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-14 14:38:19,341 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 14:38:19,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:38:19,342 INFO L85 PathProgramCache]: Analyzing trace with hash -292825616, now seen corresponding path program 1 times [2022-12-14 14:38:19,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:38:19,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283510984] [2022-12-14 14:38:19,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:38:19,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:38:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:19,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:38:19,802 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:38:19,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283510984] [2022-12-14 14:38:19,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283510984] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:38:19,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905820450] [2022-12-14 14:38:19,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:38:19,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:38:19,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:38:19,803 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:38:19,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 14:38:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:38:19,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-14 14:38:19,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:38:19,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2022-12-14 14:38:19,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:38:19,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:38:19,944 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 14:38:19,944 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 12 treesize of output 20 [2022-12-14 14:38:19,961 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 14:38:19,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 14:38:20,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 14:38:20,090 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 14:38:20,098 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-14 14:38:20,099 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-12-14 14:38:20,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:38:20,146 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 23 treesize of output 22 [2022-12-14 14:38:20,196 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 34 treesize of output 18 [2022-12-14 14:38:20,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:38:20,219 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 16 treesize of output 18 [2022-12-14 14:38:20,268 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-14 14:38:20,269 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 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-14 14:38:20,291 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 23 treesize of output 22 [2022-12-14 14:38:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:38:20,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:38:20,414 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1459 (Array Int Int)) (v_ArrVal_1461 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_137| Int) (v_ArrVal_1458 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|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1458)) |c_~#stored_elements~0.base| v_ArrVal_1459) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_137| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_137| 4) |c_~#queue~0.offset|) v_ArrVal_1461) .cse1) 2147483647) (not (<= v_ArrVal_1458 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)))))) is different from false [2022-12-14 14:38:27,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:38:27,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905820450] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:38:27,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1882896687] [2022-12-14 14:38:27,388 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:38:27,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:38:27,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 28 [2022-12-14 14:38:27,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206663763] [2022-12-14 14:38:27,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:38:27,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-14 14:38:27,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:38:27,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-14 14:38:27,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=600, Unknown=30, NotChecked=54, Total=870 [2022-12-14 14:38:27,390 INFO L87 Difference]: Start difference. First operand 1320 states and 3414 transitions. Second operand has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 29 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:38:36,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:38:38,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:38:40,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:38:42,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:38:44,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:38:46,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:38:53,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:38:55,896 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 [1] [2022-12-14 14:38:58,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:39:00,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:39:02,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:39:05,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:39:07,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:39:15,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:39:17,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:39:19,018 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (+ (select .cse3 .cse4) 1)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1459 (Array Int Int)) (v_ArrVal_1461 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_137| Int) (v_ArrVal_1458 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse3 .cse4 v_ArrVal_1458)) |c_~#stored_elements~0.base| v_ArrVal_1459) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_137| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_137| 4) |c_~#queue~0.offset|) v_ArrVal_1461) .cse1) 2147483647) (< .cse2 v_ArrVal_1458)))) (forall ((v_ArrVal_1459 (Array Int Int)) (v_ArrVal_1461 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_137| Int) (v_ArrVal_1455 Int) (v_ArrVal_1458 Int)) (let ((.cse5 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1455) .cse4 v_ArrVal_1458)) |c_~#stored_elements~0.base| v_ArrVal_1459) |c_~#queue~0.base|))) (or (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_137| 4) |c_~#queue~0.offset|) v_ArrVal_1461) .cse1) 2147483647) (< .cse2 v_ArrVal_1458) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_137| (select .cse5 .cse1))))))))) is different from false [2022-12-14 14:39:21,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:39:23,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:39:26,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:39:28,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:39:30,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:39:30,344 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (and (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) 2147483647) (forall ((v_ArrVal_1461 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_137| Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_137| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_137| 4) |c_~#queue~0.offset|) v_ArrVal_1461) .cse1) 2147483647)))) (forall ((v_ArrVal_1459 (Array Int Int)) (v_ArrVal_1461 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_137| Int)) (let ((.cse2 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1459) |c_~#queue~0.base|))) (or (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_137| 4) |c_~#queue~0.offset|) v_ArrVal_1461) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_137| (select .cse2 .cse1)))))))) is different from false [2022-12-14 14:39:31,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:39:32,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:39:35,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:39:38,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:38,207 INFO L93 Difference]: Finished difference Result 2067 states and 5203 transitions. [2022-12-14 14:39:38,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 14:39:38,208 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 29 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 14:39:38,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:38,213 INFO L225 Difference]: With dead ends: 2067 [2022-12-14 14:39:38,214 INFO L226 Difference]: Without dead ends: 2067 [2022-12-14 14:39:38,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 25.6s TimeCoverageRelationStatistics Valid=387, Invalid=1072, Unknown=35, NotChecked=228, Total=1722 [2022-12-14 14:39:38,214 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 527 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 63 mSolverCounterUnsat, 80 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 1425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 80 IncrementalHoareTripleChecker+Unknown, 159 IncrementalHoareTripleChecker+Unchecked, 52.3s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:38,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 135 Invalid, 1425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1123 Invalid, 80 Unknown, 159 Unchecked, 52.3s Time] [2022-12-14 14:39:38,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2022-12-14 14:39:38,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1520. [2022-12-14 14:39:38,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1504 states have (on average 2.6023936170212765) internal successors, (3914), 1519 states have internal predecessors, (3914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:38,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 3914 transitions. [2022-12-14 14:39:38,234 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 3914 transitions. Word has length 19 [2022-12-14 14:39:38,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:38,234 INFO L495 AbstractCegarLoop]: Abstraction has 1520 states and 3914 transitions. [2022-12-14 14:39:38,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 29 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:38,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 3914 transitions. [2022-12-14 14:39:38,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 14:39:38,235 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:38,235 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:39:38,240 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 14:39:38,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-14 14:39:38,436 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 14:39:38,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:38,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1488521269, now seen corresponding path program 1 times [2022-12-14 14:39:38,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:38,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108239154] [2022-12-14 14:39:38,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:38,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:38,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:38,897 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:38,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108239154] [2022-12-14 14:39:38,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108239154] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:39:38,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701503961] [2022-12-14 14:39:38,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:38,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:38,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:39:38,898 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:39:38,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 14:39:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:39,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-14 14:39:39,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:39:39,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:39,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:39,048 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 14:39:39,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-12-14 14:39:39,067 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 14:39:39,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-12-14 14:39:39,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-12-14 14:39:39,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2022-12-14 14:39:39,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-12-14 14:39:39,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-12-14 14:39:39,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:39,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 76 [2022-12-14 14:39:39,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 85 [2022-12-14 14:39:39,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 83 [2022-12-14 14:39:39,776 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:39,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:39:39,884 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1570 Int) (v_ArrVal_1568 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1568) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_142| (select .cse0 .cse1))) (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_142| 4) |c_~#queue~0.offset|) v_ArrVal_1570) .cse1)))))) is different from false [2022-12-14 14:39:39,895 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1570 Int) (v_ArrVal_1568 (Array Int Int)) (v_ArrVal_1567 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1567) |c_~#stored_elements~0.base| v_ArrVal_1568) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_142| (select .cse0 .cse1))) (< 0 (+ (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_142| 4) |c_~#queue~0.offset|) v_ArrVal_1570) .cse1) 2147483650))))) is different from false [2022-12-14 14:39:39,910 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1570 Int) (v_ArrVal_1568 (Array Int Int)) (v_ArrVal_1567 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1567) |c_~#stored_elements~0.base| v_ArrVal_1568) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_142| (select .cse0 .cse1))) (< 0 (+ (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_142| 4) |c_~#queue~0.offset|) v_ArrVal_1570) .cse1) 2147483650))))) is different from false [2022-12-14 14:39:39,923 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1570 Int) (v_ArrVal_1568 (Array Int Int)) (v_ArrVal_1567 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1567) |c_~#stored_elements~0.base| v_ArrVal_1568) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_142| (select .cse0 .cse1))) (< 0 (+ (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_142| 4) |c_~#queue~0.offset|) v_ArrVal_1570) .cse1) 2147483650))))) is different from false [2022-12-14 14:39:39,956 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1570 Int) (v_ArrVal_1568 (Array Int Int)) (v_ArrVal_1567 (Array Int Int)) (v_ArrVal_1564 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1564) .cse3 (+ (select .cse2 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1567) |c_~#stored_elements~0.base| v_ArrVal_1568) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_142| 4) |c_~#queue~0.offset|) v_ArrVal_1570) .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_142| (select .cse0 .cse1)))))) is different from false [2022-12-14 14:39:39,986 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1570 Int) (v_ArrVal_1568 (Array Int Int)) (v_ArrVal_1567 (Array Int Int)) (v_ArrVal_1562 Int) (v_ArrVal_1564 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1562)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1564) .cse3 (+ (select .cse2 .cse3) 1)))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1567) |c_~#stored_elements~0.base| v_ArrVal_1568) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_142| (select .cse0 .cse1))) (< 0 (+ 2147483650 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_142| 4) |c_~#queue~0.offset|) v_ArrVal_1570) .cse1)))))) is different from false [2022-12-14 14:39:40,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-12-14 14:39:40,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701503961] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:39:40,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [619748206] [2022-12-14 14:39:40,117 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:39:40,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:39:40,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 27 [2022-12-14 14:39:40,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107618493] [2022-12-14 14:39:40,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:39:40,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-14 14:39:40,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:40,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-14 14:39:40,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=400, Unknown=6, NotChecked=282, Total=812 [2022-12-14 14:39:40,119 INFO L87 Difference]: Start difference. First operand 1520 states and 3914 transitions. Second operand has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 28 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:53,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:39:54,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:54,532 INFO L93 Difference]: Finished difference Result 2992 states and 7403 transitions. [2022-12-14 14:39:54,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 14:39:54,532 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 28 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 14:39:54,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:54,536 INFO L225 Difference]: With dead ends: 2992 [2022-12-14 14:39:54,536 INFO L226 Difference]: Without dead ends: 2992 [2022-12-14 14:39:54,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 16 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=534, Invalid=1531, Unknown=29, NotChecked=558, Total=2652 [2022-12-14 14:39:54,537 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 787 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 74 mSolverCounterUnsat, 69 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 69 IncrementalHoareTripleChecker+Unknown, 695 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:54,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 109 Invalid, 1778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 940 Invalid, 69 Unknown, 695 Unchecked, 5.0s Time] [2022-12-14 14:39:54,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2022-12-14 14:39:54,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 1500. [2022-12-14 14:39:54,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 1484 states have (on average 2.5774932614555257) internal successors, (3825), 1499 states have internal predecessors, (3825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:54,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 3825 transitions. [2022-12-14 14:39:54,561 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 3825 transitions. Word has length 19 [2022-12-14 14:39:54,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:54,561 INFO L495 AbstractCegarLoop]: Abstraction has 1500 states and 3825 transitions. [2022-12-14 14:39:54,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 28 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:54,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 3825 transitions. [2022-12-14 14:39:54,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 14:39:54,562 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:54,562 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 14:39:54,566 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-14 14:39:54,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-14 14:39:54,763 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 14:39:54,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:54,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1671032351, now seen corresponding path program 1 times [2022-12-14 14:39:54,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:54,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202410318] [2022-12-14 14:39:54,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:54,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:54,810 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:54,810 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:54,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202410318] [2022-12-14 14:39:54,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202410318] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:39:54,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473062596] [2022-12-14 14:39:54,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:54,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:54,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:39:54,811 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:39:54,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 14:39:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:54,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 14:39:54,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:39:54,924 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:54,924 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 14:39:54,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473062596] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:39:54,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 14:39:54,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-14 14:39:54,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962358318] [2022-12-14 14:39:54,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:39:54,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 14:39:54,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:54,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 14:39:54,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:39:54,925 INFO L87 Difference]: Start difference. First operand 1500 states and 3825 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:54,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:54,995 INFO L93 Difference]: Finished difference Result 1488 states and 3705 transitions. [2022-12-14 14:39:54,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 14:39:54,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 14:39:54,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:54,997 INFO L225 Difference]: With dead ends: 1488 [2022-12-14 14:39:54,997 INFO L226 Difference]: Without dead ends: 1488 [2022-12-14 14:39:54,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 14:39:54,998 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 80 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:54,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 8 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:39:54,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2022-12-14 14:39:55,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1488. [2022-12-14 14:39:55,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 1474 states have (on average 2.5135685210312078) internal successors, (3705), 1487 states have internal predecessors, (3705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:55,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 3705 transitions. [2022-12-14 14:39:55,013 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 3705 transitions. Word has length 20 [2022-12-14 14:39:55,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:55,013 INFO L495 AbstractCegarLoop]: Abstraction has 1488 states and 3705 transitions. [2022-12-14 14:39:55,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:55,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 3705 transitions. [2022-12-14 14:39:55,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 14:39:55,014 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:55,014 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 14:39:55,018 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 14:39:55,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-14 14:39:55,215 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 14:39:55,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:55,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1671032350, now seen corresponding path program 1 times [2022-12-14 14:39:55,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:55,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095955066] [2022-12-14 14:39:55,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:55,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:55,240 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 14:39:55,240 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:55,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095955066] [2022-12-14 14:39:55,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095955066] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:39:55,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:39:55,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 14:39:55,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821455874] [2022-12-14 14:39:55,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:39:55,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:39:55,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:55,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:39:55,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:39:55,241 INFO L87 Difference]: Start difference. First operand 1488 states and 3705 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:55,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:55,307 INFO L93 Difference]: Finished difference Result 1476 states and 3585 transitions. [2022-12-14 14:39:55,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:39:55,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 14:39:55,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:55,309 INFO L225 Difference]: With dead ends: 1476 [2022-12-14 14:39:55,310 INFO L226 Difference]: Without dead ends: 1476 [2022-12-14 14:39:55,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:39:55,310 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 12 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:55,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 9 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:39:55,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2022-12-14 14:39:55,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1476. [2022-12-14 14:39:55,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1476 states, 1464 states have (on average 2.4487704918032787) internal successors, (3585), 1475 states have internal predecessors, (3585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:55,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 3585 transitions. [2022-12-14 14:39:55,334 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 3585 transitions. Word has length 20 [2022-12-14 14:39:55,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:55,335 INFO L495 AbstractCegarLoop]: Abstraction has 1476 states and 3585 transitions. [2022-12-14 14:39:55,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:55,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 3585 transitions. [2022-12-14 14:39:55,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 14:39:55,337 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:55,337 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:39:55,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-14 14:39:55,338 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 14:39:55,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:55,338 INFO L85 PathProgramCache]: Analyzing trace with hash 329226065, now seen corresponding path program 1 times [2022-12-14 14:39:55,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:55,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348423922] [2022-12-14 14:39:55,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:55,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:55,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:55,400 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:55,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348423922] [2022-12-14 14:39:55,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348423922] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 14:39:55,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 14:39:55,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 14:39:55,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629118492] [2022-12-14 14:39:55,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 14:39:55,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 14:39:55,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:55,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 14:39:55,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:39:55,401 INFO L87 Difference]: Start difference. First operand 1476 states and 3585 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:55,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:55,458 INFO L93 Difference]: Finished difference Result 804 states and 1619 transitions. [2022-12-14 14:39:55,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 14:39:55,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 14:39:55,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:55,461 INFO L225 Difference]: With dead ends: 804 [2022-12-14 14:39:55,462 INFO L226 Difference]: Without dead ends: 802 [2022-12-14 14:39:55,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 14:39:55,462 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:55,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 2 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:39:55,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-12-14 14:39:55,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 781. [2022-12-14 14:39:55,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 770 states have (on average 2.0675324675324673) internal successors, (1592), 780 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:55,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1592 transitions. [2022-12-14 14:39:55,474 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1592 transitions. Word has length 23 [2022-12-14 14:39:55,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:55,474 INFO L495 AbstractCegarLoop]: Abstraction has 781 states and 1592 transitions. [2022-12-14 14:39:55,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:55,474 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1592 transitions. [2022-12-14 14:39:55,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:39:55,476 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:55,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 14:39:55,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-14 14:39:55,476 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 14:39:55,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:55,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1692750139, now seen corresponding path program 1 times [2022-12-14 14:39:55,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:55,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634640516] [2022-12-14 14:39:55,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:55,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:55,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:55,519 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:55,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634640516] [2022-12-14 14:39:55,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634640516] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:39:55,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658418587] [2022-12-14 14:39:55,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:55,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:55,520 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:39:55,521 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:39:55,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 14:39:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:55,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 14:39:55,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:39:55,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:55,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:39:55,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:55,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658418587] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:39:55,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [303933315] [2022-12-14 14:39:55,678 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:39:55,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:39:55,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-14 14:39:55,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245300365] [2022-12-14 14:39:55,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:39:55,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 14:39:55,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:39:55,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 14:39:55,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 14:39:55,679 INFO L87 Difference]: Start difference. First operand 781 states and 1592 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:55,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:39:55,808 INFO L93 Difference]: Finished difference Result 977 states and 1931 transitions. [2022-12-14 14:39:55,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 14:39:55,808 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 14:39:55,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:39:55,810 INFO L225 Difference]: With dead ends: 977 [2022-12-14 14:39:55,810 INFO L226 Difference]: Without dead ends: 977 [2022-12-14 14:39:55,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 14:39:55,811 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 47 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 14:39:55,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 12 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 14:39:55,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2022-12-14 14:39:55,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 916. [2022-12-14 14:39:55,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 905 states have (on average 2.019889502762431) internal successors, (1828), 915 states have internal predecessors, (1828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:55,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1828 transitions. [2022-12-14 14:39:55,823 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1828 transitions. Word has length 24 [2022-12-14 14:39:55,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:39:55,823 INFO L495 AbstractCegarLoop]: Abstraction has 916 states and 1828 transitions. [2022-12-14 14:39:55,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:39:55,823 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1828 transitions. [2022-12-14 14:39:55,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:39:55,824 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:39:55,824 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 14:39:55,829 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-14 14:39:56,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-14 14:39:56,025 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 14:39:56,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:39:56,025 INFO L85 PathProgramCache]: Analyzing trace with hash 496903130, now seen corresponding path program 6 times [2022-12-14 14:39:56,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:39:56,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380860502] [2022-12-14 14:39:56,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:39:56,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:39:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:39:57,049 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:39:57,049 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:39:57,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380860502] [2022-12-14 14:39:57,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380860502] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:39:57,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773525633] [2022-12-14 14:39:57,049 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 14:39:57,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:39:57,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:39:57,050 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:39:57,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 14:39:57,176 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 14:39:57,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 14:39:57,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 95 conjunts are in the unsatisfiable core [2022-12-14 14:39:57,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:39:57,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:57,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:57,211 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 14:39:57,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-12-14 14:39:57,232 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 14:39:57,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 14:39:57,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-12-14 14:39:57,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-12-14 14:39:57,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-12-14 14:39:57,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:57,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-12-14 14:39:57,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-12-14 14:39:58,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 61 [2022-12-14 14:39:58,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-12-14 14:39:59,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 68 [2022-12-14 14:39:59,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:39:59,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 64 [2022-12-14 14:40:04,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 73 [2022-12-14 14:40:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:40:12,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:40:12,563 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1946 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1945) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_1946) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-12-14 14:40:12,580 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1946 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (v_ArrVal_1944 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|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1944)) |c_~#stored_elements~0.base| v_ArrVal_1945) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1944 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_1946) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse0 (+ 84 |c_~#queue~0.offset|))))))) is different from false [2022-12-14 14:40:12,597 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1946 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (v_ArrVal_1944 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_1944)) |c_~#stored_elements~0.base| v_ArrVal_1945) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_1946) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1944) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse0 (+ 84 |c_~#queue~0.offset|)))))))) is different from false [2022-12-14 14:40:12,764 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1946 Int) (v_ArrVal_1940 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (v_ArrVal_1942 Int) (v_ArrVal_1944 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1940))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1942) .cse1 v_ArrVal_1944)) |c_~#stored_elements~0.base| v_ArrVal_1945) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1944) (not (<= v_ArrVal_1942 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_1946) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse2 (+ 84 |c_~#queue~0.offset|))))))))) is different from false [2022-12-14 14:40:12,792 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1946 Int) (v_ArrVal_1940 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (v_ArrVal_1942 Int) (v_ArrVal_1944 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1940))) (let ((.cse0 (select .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (store .cse4 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse2 v_ArrVal_1942) .cse1 v_ArrVal_1944)) |c_~#stored_elements~0.base| v_ArrVal_1945) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1944) (< (+ (select (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) .cse2) 1) v_ArrVal_1942) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_1946) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse3 (+ 84 |c_~#queue~0.offset|))))))))) is different from false [2022-12-14 14:40:12,826 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1946 Int) (v_ArrVal_1938 Int) (v_ArrVal_1940 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (v_ArrVal_1942 Int) (v_ArrVal_1944 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_1938))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| .cse2) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1940))) (let ((.cse0 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse3 v_ArrVal_1942) .cse1 v_ArrVal_1944)) |c_~#stored_elements~0.base| v_ArrVal_1945) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1944) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1942) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse4 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_1946) (+ 88 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2022-12-14 14:40:12,863 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1946 Int) (v_ArrVal_1938 Int) (v_ArrVal_1940 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| Int) (v_ArrVal_1942 Int) (v_ArrVal_1944 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| 4) |c_~#queue~0.offset|) v_ArrVal_1938))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| .cse2) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1940))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse3 v_ArrVal_1942) .cse1 v_ArrVal_1944)) |c_~#stored_elements~0.base| v_ArrVal_1945) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1942) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse4 .cse1))) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_1946) .cse3) 2147483647) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1944)))))))) is different from false [2022-12-14 14:40:12,895 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1946 Int) (v_ArrVal_1938 Int) (v_ArrVal_1940 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (v_ArrVal_1937 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| Int) (v_ArrVal_1942 Int) (v_ArrVal_1944 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1937))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| 4) |c_~#queue~0.offset|) v_ArrVal_1938))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| .cse4) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1940))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1942) .cse1 v_ArrVal_1944)) |c_~#stored_elements~0.base| v_ArrVal_1945) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1944) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_1946) .cse3) 2147483647) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1942) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| (select .cse5 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse2 .cse1))))))))))) is different from false [2022-12-14 14:40:12,938 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1935 Int) (v_ArrVal_1946 Int) (v_ArrVal_1938 Int) (v_ArrVal_1940 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (v_ArrVal_1937 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| Int) (v_ArrVal_1942 Int) (v_ArrVal_1944 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1935)) |c_~#stored_elements~0.base| v_ArrVal_1937))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| 4) |c_~#queue~0.offset|) v_ArrVal_1938))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| .cse5) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1940))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1942) .cse3 v_ArrVal_1944)) |c_~#stored_elements~0.base| v_ArrVal_1945) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_1946) .cse1) 2147483647) (< (+ 1 (select .cse2 .cse3)) v_ArrVal_1944) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| (select .cse4 .cse3))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1942) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse0 .cse3))) (not (<= v_ArrVal_1935 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))))))))))) is different from false [2022-12-14 14:40:12,980 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1935 Int) (v_ArrVal_1946 Int) (v_ArrVal_1938 Int) (v_ArrVal_1940 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (v_ArrVal_1937 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| Int) (v_ArrVal_1942 Int) (v_ArrVal_1944 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1935)) |c_~#stored_elements~0.base| v_ArrVal_1937))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| 4) |c_~#queue~0.offset|) v_ArrVal_1938))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| .cse7) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1940))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse5 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_1942) .cse5 v_ArrVal_1944)) |c_~#stored_elements~0.base| v_ArrVal_1945) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_1946) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1935) (< (+ 1 (select .cse4 .cse5)) v_ArrVal_1944) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| (select .cse6 .cse5))) (< (+ (select .cse7 .cse1) 1) v_ArrVal_1942) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse0 .cse5)))))))))))) is different from false [2022-12-14 14:40:13,075 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1935 Int) (v_ArrVal_1946 Int) (v_ArrVal_1938 Int) (v_ArrVal_1940 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (v_ArrVal_1937 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| Int) (v_ArrVal_1942 Int) (v_ArrVal_1934 Int) (v_ArrVal_1944 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1934) .cse6 v_ArrVal_1935)) |c_~#stored_elements~0.base| v_ArrVal_1937))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| 4) |c_~#queue~0.offset|) v_ArrVal_1938))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| .cse7) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1940))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1942) .cse3 v_ArrVal_1944)) |c_~#stored_elements~0.base| v_ArrVal_1945) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_1946) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1944) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| (select .cse4 .cse3))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1935) (not (<= v_ArrVal_1934 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse7 .cse1) 1) v_ArrVal_1942) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse0 .cse3)))))))))))) is different from false [2022-12-14 14:40:13,135 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1935 Int) (v_ArrVal_1946 Int) (v_ArrVal_1938 Int) (v_ArrVal_1940 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (v_ArrVal_1937 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| Int) (v_ArrVal_1942 Int) (v_ArrVal_1934 Int) (v_ArrVal_1944 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse5 .cse7 v_ArrVal_1934) .cse6 v_ArrVal_1935)) |c_~#stored_elements~0.base| v_ArrVal_1937))) (let ((.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| 4) |c_~#queue~0.offset|) v_ArrVal_1938))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| .cse8) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1940))) (let ((.cse2 (select .cse9 |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1942) .cse3 v_ArrVal_1944)) |c_~#stored_elements~0.base| v_ArrVal_1945) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_1946) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1944) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| (select .cse4 .cse3))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_1935) (< (+ (select .cse5 .cse7) 1) v_ArrVal_1934) (< (+ (select .cse8 .cse1) 1) v_ArrVal_1942) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse0 .cse3)))))))))))) is different from false [2022-12-14 14:40:13,202 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1935 Int) (v_ArrVal_1946 Int) (v_ArrVal_1938 Int) (v_ArrVal_1940 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (v_ArrVal_1932 Int) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1942 Int) (v_ArrVal_1934 Int) (v_ArrVal_1944 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_1932)) (.cse6 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse6 v_ArrVal_1934) .cse1 v_ArrVal_1935)) |c_~#stored_elements~0.base| v_ArrVal_1937))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| 4) |c_~#queue~0.offset|) v_ArrVal_1938))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| .cse7) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1940))) (let ((.cse2 (select .cse9 |c_~#queue~0.base|)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse2 .cse5 v_ArrVal_1942) .cse3 v_ArrVal_1944)) |c_~#stored_elements~0.base| v_ArrVal_1945) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1935) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1944) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_1946) .cse5) 2147483647) (< (+ (select .cse0 .cse6) 1) v_ArrVal_1934) (< (+ (select .cse7 .cse5) 1) v_ArrVal_1942) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse4 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| (select .cse8 .cse3)))))))))))) is different from false [2022-12-14 14:40:17,587 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-12-14 14:40:17,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773525633] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:40:17,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1581423343] [2022-12-14 14:40:17,587 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:40:17,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:40:17,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 52 [2022-12-14 14:40:17,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107857873] [2022-12-14 14:40:17,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:40:17,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-12-14 14:40:17,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:40:17,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-12-14 14:40:17,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=1268, Unknown=19, NotChecked=1170, Total=2862 [2022-12-14 14:40:17,590 INFO L87 Difference]: Start difference. First operand 916 states and 1828 transitions. Second operand has 54 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:40:54,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:40:56,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:40:58,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:41:00,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:41:02,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:41:04,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:41:06,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:41:08,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:41:18,771 WARN L233 SmtUtils]: Spent 8.23s on a formula simplification. DAG size of input: 168 DAG size of output: 154 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:41:29,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:41:31,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:41:33,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:41:43,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:41:45,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:42:08,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:42:21,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:42:26,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:42:55,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:43:00,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 14:43:30,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:43:55,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:43:57,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:44:49,030 WARN L233 SmtUtils]: Spent 6.13s on a formula simplification that was a NOOP. DAG size: 185 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 14:45:21,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:45:23,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:45:25,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:45:25,454 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1946 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (v_ArrVal_1944 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1944)) |c_~#stored_elements~0.base| v_ArrVal_1945) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_1946) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1944) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse0 .cse4))))))) (forall ((v_ArrVal_1946 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int)) (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_1946) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse5 .cse4)))))))) is different from false [2022-12-14 14:45:53,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:45:53,216 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse2 (+ (select .cse4 .cse5) 1))) (and (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1946 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (v_ArrVal_1944 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1944)) |c_~#stored_elements~0.base| v_ArrVal_1945) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_1946) .cse1) 2147483647) (< .cse2 v_ArrVal_1944) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse0 .cse3)))))) (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1935 Int) (v_ArrVal_1946 Int) (v_ArrVal_1938 Int) (v_ArrVal_1940 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (v_ArrVal_1937 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| Int) (v_ArrVal_1942 Int) (v_ArrVal_1944 Int)) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1935)) |c_~#stored_elements~0.base| v_ArrVal_1937))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse9 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| 4) |c_~#queue~0.offset|) v_ArrVal_1938))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| .cse9) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1940))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse6 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse7 .cse1 v_ArrVal_1942) .cse3 v_ArrVal_1944)) |c_~#stored_elements~0.base| v_ArrVal_1945) |c_~#queue~0.base|))) (or (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_1946) .cse1) 2147483647) (< .cse2 v_ArrVal_1935) (< (+ 1 (select .cse7 .cse3)) v_ArrVal_1944) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| (select .cse8 .cse3))) (< (+ (select .cse9 .cse1) 1) v_ArrVal_1942) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse6 .cse3))))))))))) (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1946 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (v_ArrVal_1942 Int) (v_ArrVal_1944 Int)) (let ((.cse12 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1942) .cse5 v_ArrVal_1944)) |c_~#stored_elements~0.base| v_ArrVal_1945) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1942 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse12 .cse3))) (< (select (store .cse12 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_1946) .cse1) 2147483647) (< .cse2 v_ArrVal_1944))))))) is different from false [2022-12-14 14:45:55,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:45:57,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:46:04,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:46:19,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:46:21,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:46:21,229 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (+ (select .cse4 .cse5) 1)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1946 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (v_ArrVal_1944 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1944)) |c_~#stored_elements~0.base| v_ArrVal_1945) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_1946) .cse1) 2147483647) (< .cse2 v_ArrVal_1944) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse0 .cse3)))))) (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1935 Int) (v_ArrVal_1946 Int) (v_ArrVal_1938 Int) (v_ArrVal_1940 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (v_ArrVal_1937 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| Int) (v_ArrVal_1942 Int) (v_ArrVal_1944 Int)) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_1935)) |c_~#stored_elements~0.base| v_ArrVal_1937))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse9 (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| 4) |c_~#queue~0.offset|) v_ArrVal_1938))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| .cse9) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1940))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse6 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse7 .cse1 v_ArrVal_1942) .cse3 v_ArrVal_1944)) |c_~#stored_elements~0.base| v_ArrVal_1945) |c_~#queue~0.base|))) (or (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_1946) .cse1) 2147483647) (< .cse2 v_ArrVal_1935) (< (+ 1 (select .cse7 .cse3)) v_ArrVal_1944) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| (select .cse8 .cse3))) (< (+ (select .cse9 .cse1) 1) v_ArrVal_1942) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse6 .cse3)))))))))))))) is different from false [2022-12-14 14:46:24,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:46:26,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 14:46:26,397 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1935 Int) (v_ArrVal_1946 Int) (v_ArrVal_1938 Int) (v_ArrVal_1940 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (v_ArrVal_1937 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| Int) (v_ArrVal_1942 Int) (v_ArrVal_1944 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse9 .cse10 v_ArrVal_1935)) |c_~#stored_elements~0.base| v_ArrVal_1937))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| 4) |c_~#queue~0.offset|) v_ArrVal_1938))) (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| .cse5) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1940))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_1942) .cse3 v_ArrVal_1944)) |c_~#stored_elements~0.base| v_ArrVal_1945) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_1946) .cse1) 2147483647) (< (+ 1 (select .cse2 .cse3)) v_ArrVal_1944) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| (select .cse4 .cse3))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_1942) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse0 .cse3))) (not (<= v_ArrVal_1935 .cse6)))))))))) (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1946 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (v_ArrVal_1944 Int)) (let ((.cse11 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse9 .cse10 v_ArrVal_1944)) |c_~#stored_elements~0.base| v_ArrVal_1945) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_1944 .cse6)) (< (select (store .cse11 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_1946) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse11 .cse3)))))))) is different from false [2022-12-14 14:46:26,526 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (+ 88 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1946 Int) (v_ArrVal_1938 Int) (v_ArrVal_1940 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (v_ArrVal_1937 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| Int) (v_ArrVal_1942 Int) (v_ArrVal_1944 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1937))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| 4) |c_~#queue~0.offset|) v_ArrVal_1938))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| .cse4) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1940))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_1942) .cse1 v_ArrVal_1944)) |c_~#stored_elements~0.base| v_ArrVal_1945) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1944) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_1946) .cse3) 2147483647) (< (+ (select .cse4 .cse3) 1) v_ArrVal_1942) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| (select .cse5 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse2 .cse1))))))))))) (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1946 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int)) (let ((.cse8 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1945) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse8 .cse1))) (< (select (store .cse8 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_1946) .cse3) 2147483647)))))) is different from false [2022-12-14 14:46:26,582 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse7 .cse4))) (and (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1946 Int) (v_ArrVal_1938 Int) (v_ArrVal_1940 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| Int) (v_ArrVal_1942 Int) (v_ArrVal_1944 Int)) (let ((.cse1 (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| 4) |c_~#queue~0.offset|) v_ArrVal_1938))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| .cse1) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1940))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse2 v_ArrVal_1942) .cse4 v_ArrVal_1944)) |c_~#stored_elements~0.base| v_ArrVal_1945) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_150| .cse0)) (< (+ (select .cse1 .cse2) 1) v_ArrVal_1942) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse3 .cse4))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_1946) .cse2) 2147483647) (< (+ (select .cse5 .cse4) 1) v_ArrVal_1944))))))) (forall ((v_ArrVal_1946 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int)) (or (< (select (store .cse7 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_1946) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| .cse0))))))) is different from false [2022-12-14 14:46:28,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 14:46:28,096 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1946 Int) (v_ArrVal_1938 Int) (v_ArrVal_1940 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| Int) (v_ArrVal_1942 Int) (v_ArrVal_1944 Int)) (let ((.cse2 (store .cse6 .cse7 v_ArrVal_1938))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| .cse2) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_1940))) (let ((.cse0 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse3 v_ArrVal_1942) .cse1 v_ArrVal_1944)) |c_~#stored_elements~0.base| v_ArrVal_1945) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1944) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1942) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| (select .cse4 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_149| 4) |c_~#queue~0.offset|) v_ArrVal_1946) (+ 88 |c_~#queue~0.offset|)) 2147483647))))))) (forall ((v_ArrVal_1946 Int)) (< (select (store .cse6 .cse7 v_ArrVal_1946) .cse3) 2147483647)))) is different from false [2022-12-14 14:46:55,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 14:46:55,862 INFO L93 Difference]: Finished difference Result 1397 states and 2647 transitions. [2022-12-14 14:46:55,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-12-14 14:46:55,862 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 14:46:55,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 14:46:55,864 INFO L225 Difference]: With dead ends: 1397 [2022-12-14 14:46:55,864 INFO L226 Difference]: Without dead ends: 1397 [2022-12-14 14:46:55,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 15 SyntacticMatches, 11 SemanticMatches, 97 ConstructedPredicates, 20 IntricatePredicates, 5 DeprecatedPredicates, 2564 ImplicationChecksByTransitivity, 345.5s TimeCoverageRelationStatistics Valid=1353, Invalid=4696, Unknown=193, NotChecked=3460, Total=9702 [2022-12-14 14:46:55,866 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 395 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 81 mSolverCounterUnsat, 136 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 71.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 3178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 136 IncrementalHoareTripleChecker+Unknown, 1895 IncrementalHoareTripleChecker+Unchecked, 71.6s IncrementalHoareTripleChecker+Time [2022-12-14 14:46:55,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 85 Invalid, 3178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1066 Invalid, 136 Unknown, 1895 Unchecked, 71.6s Time] [2022-12-14 14:46:55,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2022-12-14 14:46:55,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 1040. [2022-12-14 14:46:55,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1040 states, 1029 states have (on average 2.0359572400388726) internal successors, (2095), 1039 states have internal predecessors, (2095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:46:55,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 2095 transitions. [2022-12-14 14:46:55,877 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 2095 transitions. Word has length 24 [2022-12-14 14:46:55,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 14:46:55,877 INFO L495 AbstractCegarLoop]: Abstraction has 1040 states and 2095 transitions. [2022-12-14 14:46:55,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:46:55,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 2095 transitions. [2022-12-14 14:46:55,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 14:46:55,878 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 14:46:55,878 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 14:46:55,883 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-14 14:46:56,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-14 14:46:56,080 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2022-12-14 14:46:56,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 14:46:56,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1453030992, now seen corresponding path program 7 times [2022-12-14 14:46:56,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 14:46:56,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244877410] [2022-12-14 14:46:56,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 14:46:56,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 14:46:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:46:57,453 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:46:57,453 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 14:46:57,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244877410] [2022-12-14 14:46:57,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244877410] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 14:46:57,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743395296] [2022-12-14 14:46:57,453 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 14:46:57,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 14:46:57,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 14:46:57,454 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 14:46:57,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_83c227d5-6ee8-4158-bbe8-594a8e4a3d46/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 14:46:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 14:46:57,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 96 conjunts are in the unsatisfiable core [2022-12-14 14:46:57,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 14:46:57,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:46:57,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:46:57,605 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 14:46:57,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-12-14 14:46:57,619 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-12-14 14:46:57,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 14:46:57,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2022-12-14 14:46:57,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2022-12-14 14:46:58,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2022-12-14 14:46:58,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:46:58,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2022-12-14 14:46:58,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2022-12-14 14:46:58,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2022-12-14 14:47:00,544 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 57 treesize of output 59 [2022-12-14 14:47:01,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 68 [2022-12-14 14:47:01,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 14:47:01,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 64 [2022-12-14 14:47:04,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 73 [2022-12-14 14:47:14,689 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 14:47:14,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 14:47:14,804 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2071 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| Int) (v_ArrVal_2072 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2071) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| 4) |c_~#queue~0.offset|) v_ArrVal_2072) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-12-14 14:47:14,822 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2071 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| Int) (v_ArrVal_2069 Int) (v_ArrVal_2072 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|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2069)) |c_~#stored_elements~0.base| v_ArrVal_2071) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_2069 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| 4) |c_~#queue~0.offset|) v_ArrVal_2072) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| (select .cse0 (+ 84 |c_~#queue~0.offset|))))))) is different from false [2022-12-14 14:47:14,840 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2071 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| Int) (v_ArrVal_2069 Int) (v_ArrVal_2072 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse1 .cse2 v_ArrVal_2069)) |c_~#stored_elements~0.base| v_ArrVal_2071) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| 4) |c_~#queue~0.offset|) v_ArrVal_2072) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_2069))))) is different from false [2022-12-14 14:47:14,858 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2071 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| Int) (v_ArrVal_2069 Int) (v_ArrVal_2068 (Array Int Int)) (v_ArrVal_2072 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2068))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2069)) |c_~#stored_elements~0.base| v_ArrVal_2071) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2069) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| 4) |c_~#queue~0.offset|) v_ArrVal_2072) (+ 88 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-12-14 14:47:14,900 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2071 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| Int) (v_ArrVal_2066 Int) (v_ArrVal_2069 Int) (v_ArrVal_2068 (Array Int Int)) (v_ArrVal_2072 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|) (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2066)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2068))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2069)) |c_~#stored_elements~0.base| v_ArrVal_2071) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2069) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| 4) |c_~#queue~0.offset|) v_ArrVal_2072) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_2066 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)))))))) is different from false [2022-12-14 14:47:14,933 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2071 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| Int) (v_ArrVal_2066 Int) (v_ArrVal_2069 Int) (v_ArrVal_2068 (Array Int Int)) (v_ArrVal_2072 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2066)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2068))) (let ((.cse2 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_2069)) |c_~#stored_elements~0.base| v_ArrVal_2071) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2066) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2069) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| (select .cse4 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| 4) |c_~#queue~0.offset|) v_ArrVal_2072) (+ 88 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2022-12-14 14:47:14,967 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2071 (Array Int Int)) (v_ArrVal_2064 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| Int) (v_ArrVal_2066 Int) (v_ArrVal_2069 Int) (v_ArrVal_2068 (Array Int Int)) (v_ArrVal_2072 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_2064)) (.cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_2066)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2068))) (let ((.cse0 (select .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (select (store (store .cse5 |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2069)) |c_~#stored_elements~0.base| v_ArrVal_2071) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2069) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2066) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| 4) |c_~#queue~0.offset|) v_ArrVal_2072) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| (select .cse4 (+ 84 |c_~#queue~0.offset|)))))))))) is different from false [2022-12-14 14:47:14,999 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2071 (Array Int Int)) (v_ArrVal_2064 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_157| Int) (v_ArrVal_2066 Int) (v_ArrVal_2069 Int) (v_ArrVal_2068 (Array Int Int)) (v_ArrVal_2072 Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_157| 4)) v_ArrVal_2064)) (.cse4 (+ 88 |c_~#queue~0.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse5 .cse4 v_ArrVal_2066)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2068))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_2069)) |c_~#stored_elements~0.base| v_ArrVal_2071) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2069) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_157| (select .cse2 .cse1))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| 4) |c_~#queue~0.offset|) v_ArrVal_2072) .cse4) 2147483647) (< (+ (select .cse5 .cse4) 1) v_ArrVal_2066) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| (select .cse3 .cse1)))))))))) is different from false [2022-12-14 14:47:15,029 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2071 (Array Int Int)) (v_ArrVal_2064 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_157| Int) (v_ArrVal_2066 Int) (v_ArrVal_2069 Int) (v_ArrVal_2068 (Array Int Int)) (v_ArrVal_2063 (Array Int Int)) (v_ArrVal_2072 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2063))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_157| 4)) v_ArrVal_2064)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse4 .cse1 v_ArrVal_2066)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2068))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store .cse5 .cse3 v_ArrVal_2069)) |c_~#stored_elements~0.base| v_ArrVal_2071) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| 4) |c_~#queue~0.offset|) v_ArrVal_2072) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_157| (select .cse2 .cse3))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2066) (< (+ (select .cse5 .cse3) 1) v_ArrVal_2069) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| (select .cse0 .cse3))))))))))) is different from false [2022-12-14 14:47:15,070 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2062 Int) (v_ArrVal_2071 (Array Int Int)) (v_ArrVal_2064 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_157| Int) (v_ArrVal_2066 Int) (v_ArrVal_2069 Int) (v_ArrVal_2068 (Array Int Int)) (v_ArrVal_2063 (Array Int Int)) (v_ArrVal_2072 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2062)) |c_~#stored_elements~0.base| v_ArrVal_2063))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_157| 4)) v_ArrVal_2064)) (.cse4 (+ 88 |c_~#queue~0.offset|))) (let ((.cse6 (store (store .cse7 |c_~#queue~0.base| (store .cse5 .cse4 v_ArrVal_2066)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2068))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store .cse2 .cse1 v_ArrVal_2069)) |c_~#stored_elements~0.base| v_ArrVal_2071) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| (select .cse0 .cse1))) (not (<= v_ArrVal_2062 (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2069) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_157| (select .cse3 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| 4) |c_~#queue~0.offset|) v_ArrVal_2072) .cse4) 2147483647) (< (+ (select .cse5 .cse4) 1) v_ArrVal_2066))))))))) is different from false [2022-12-14 14:47:15,128 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2062 Int) (v_ArrVal_2071 (Array Int Int)) (v_ArrVal_2064 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_157| Int) (v_ArrVal_2066 Int) (v_ArrVal_2069 Int) (v_ArrVal_2068 (Array Int Int)) (v_ArrVal_2063 (Array Int Int)) (v_ArrVal_2072 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2062)) |c_~#stored_elements~0.base| v_ArrVal_2063))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_157| 4)) v_ArrVal_2064)) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store .cse7 .cse6 v_ArrVal_2066)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2068))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse8 |c_~#queue~0.base| (store .cse4 .cse3 v_ArrVal_2069)) |c_~#stored_elements~0.base| v_ArrVal_2071) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2062) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| (select .cse2 .cse3))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_2069) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_157| (select .cse5 .cse3))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| 4) |c_~#queue~0.offset|) v_ArrVal_2072) .cse6) 2147483647) (< (+ (select .cse7 .cse6) 1) v_ArrVal_2066)))))))))) is different from false [2022-12-14 14:47:15,231 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2062 Int) (v_ArrVal_2071 (Array Int Int)) (v_ArrVal_2064 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_157| Int) (v_ArrVal_2066 Int) (v_ArrVal_2069 Int) (v_ArrVal_2059 Int) (v_ArrVal_2068 (Array Int Int)) (v_ArrVal_2063 (Array Int Int)) (v_ArrVal_2072 Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2059) .cse4 v_ArrVal_2062)) |c_~#stored_elements~0.base| v_ArrVal_2063))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse5 (store .cse7 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_157| 4)) v_ArrVal_2064)) (.cse2 (+ 88 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse9 |c_~#queue~0.base| (store .cse5 .cse2 v_ArrVal_2066)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2068))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store .cse6 .cse1 v_ArrVal_2069)) |c_~#stored_elements~0.base| v_ArrVal_2071) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| 4) |c_~#queue~0.offset|) v_ArrVal_2072) .cse2) 2147483647) (not (<= v_ArrVal_2059 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_2062) (< (+ (select .cse5 .cse2) 1) v_ArrVal_2066) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2069) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_157| (select .cse7 .cse1)))))))))))) is different from false [2022-12-14 14:47:15,310 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2062 Int) (v_ArrVal_2071 (Array Int Int)) (v_ArrVal_2064 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_157| Int) (v_ArrVal_2066 Int) (v_ArrVal_2069 Int) (v_ArrVal_2059 Int) (v_ArrVal_2068 (Array Int Int)) (v_ArrVal_2063 (Array Int Int)) (v_ArrVal_2072 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_2059) .cse5 v_ArrVal_2062)) |c_~#stored_elements~0.base| v_ArrVal_2063))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse6 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_157| 4)) v_ArrVal_2064)) (.cse4 (+ 88 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store .cse6 .cse4 v_ArrVal_2066)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2068))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse9 |c_~#queue~0.base| (store .cse7 .cse1 v_ArrVal_2069)) |c_~#stored_elements~0.base| v_ArrVal_2071) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2059) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| 4) |c_~#queue~0.offset|) v_ArrVal_2072) .cse4) 2147483647) (< (+ (select .cse2 .cse5) 1) v_ArrVal_2062) (< (+ (select .cse6 .cse4) 1) v_ArrVal_2066) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2069) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_157| (select .cse8 .cse1)))))))))))) is different from false [2022-12-14 14:47:15,380 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2068 (Array Int Int)) (v_ArrVal_2063 (Array Int Int)) (v_ArrVal_2072 Int) (v_ArrVal_2062 Int) (v_ArrVal_2071 (Array Int Int)) (v_ArrVal_2064 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_157| Int) (v_ArrVal_2066 Int) (v_ArrVal_2069 Int) (v_ArrVal_2057 Int) (v_ArrVal_2059 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_2057)) (.cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_2059) .cse5 v_ArrVal_2062)) |c_~#stored_elements~0.base| v_ArrVal_2063))) (let ((.cse6 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_157| 4)) v_ArrVal_2064)) (.cse7 (+ 88 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store .cse8 .cse7 v_ArrVal_2066)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_2068))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse9 |c_~#queue~0.base| (store .cse0 .cse1 v_ArrVal_2069)) |c_~#stored_elements~0.base| v_ArrVal_2071) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2069) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| (select .cse2 .cse1))) (< (+ 1 (select .cse3 .cse4)) v_ArrVal_2059) (< (+ (select .cse3 .cse5) 1) v_ArrVal_2062) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_157| (select .cse6 .cse1))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_156| 4) |c_~#queue~0.offset|) v_ArrVal_2072) .cse7) 2147483647) (< (+ (select .cse8 .cse7) 1) v_ArrVal_2066)))))))))) is different from false [2022-12-14 14:47:18,642 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-12-14 14:47:18,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743395296] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 14:47:18,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [901191733] [2022-12-14 14:47:18,642 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 14:47:18,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 14:47:18,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 52 [2022-12-14 14:47:18,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962250809] [2022-12-14 14:47:18,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 14:47:18,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-12-14 14:47:18,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 14:47:18,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-12-14 14:47:18,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1229, Unknown=20, NotChecked=1246, Total=2862 [2022-12-14 14:47:18,644 INFO L87 Difference]: Start difference. First operand 1040 states and 2095 transitions. Second operand has 54 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 14:47:43,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 14:47:50,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 14:47:59,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:48:20,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 14:49:12,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 14:49:16,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]