./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c --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_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/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_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/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_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/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 4018a1168c08743b2a9b9283b6137e1dcc53bdf8ab8362348f4bbe02762305c3 --- 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 10:26:17,707 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 10:26:17,709 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 10:26:17,726 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 10:26:17,726 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 10:26:17,727 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 10:26:17,728 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 10:26:17,729 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 10:26:17,731 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 10:26:17,732 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 10:26:17,732 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 10:26:17,733 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 10:26:17,734 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 10:26:17,735 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 10:26:17,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 10:26:17,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 10:26:17,738 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 10:26:17,738 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 10:26:17,740 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 10:26:17,742 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 10:26:17,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 10:26:17,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 10:26:17,745 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 10:26:17,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 10:26:17,747 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 10:26:17,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 10:26:17,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 10:26:17,748 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 10:26:17,748 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 10:26:17,749 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 10:26:17,749 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 10:26:17,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 10:26:17,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 10:26:17,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 10:26:17,751 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 10:26:17,751 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 10:26:17,751 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 10:26:17,751 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 10:26:17,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 10:26:17,752 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 10:26:17,752 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 10:26:17,753 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-12-14 10:26:17,773 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 10:26:17,773 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 10:26:17,774 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 10:26:17,774 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 10:26:17,775 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 10:26:17,775 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 10:26:17,775 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 10:26:17,775 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 10:26:17,775 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 10:26:17,775 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 10:26:17,775 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 10:26:17,776 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 10:26:17,776 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 10:26:17,776 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 10:26:17,776 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 10:26:17,776 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 10:26:17,776 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 10:26:17,776 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 10:26:17,777 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 10:26:17,777 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 10:26:17,777 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 10:26:17,777 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 10:26:17,777 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 10:26:17,777 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 10:26:17,777 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 10:26:17,778 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 10:26:17,778 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 10:26:17,778 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 10:26:17,778 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 10:26:17,778 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 10:26:17,778 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 10:26:17,778 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 10:26:17,778 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 10:26:17,778 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 10:26:17,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 10:26:17,779 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 10:26:17,779 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 10:26:17,779 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 10:26:17,779 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 10:26:17,779 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 10:26:17,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 10:26:17,779 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 10:26:17,780 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 10:26:17,780 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_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/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_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/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 -> 4018a1168c08743b2a9b9283b6137e1dcc53bdf8ab8362348f4bbe02762305c3 [2022-12-14 10:26:17,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 10:26:17,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 10:26:17,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 10:26:17,983 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 10:26:17,984 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 10:26:17,985 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c [2022-12-14 10:26:20,546 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 10:26:20,668 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 10:26:20,668 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c [2022-12-14 10:26:20,673 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/data/9722ea46d/d7fed0a5107a46f5954814ff91e55c49/FLAG812322408 [2022-12-14 10:26:20,684 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/data/9722ea46d/d7fed0a5107a46f5954814ff91e55c49 [2022-12-14 10:26:20,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 10:26:20,687 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 10:26:20,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 10:26:20,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 10:26:20,691 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 10:26:20,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:26:20" (1/1) ... [2022-12-14 10:26:20,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a7d6b9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:26:20, skipping insertion in model container [2022-12-14 10:26:20,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 10:26:20" (1/1) ... [2022-12-14 10:26:20,698 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 10:26:20,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 10:26:20,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:26:20,828 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:26:20,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:26:20,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:26:20,833 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:26:20,834 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:26:20,839 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_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c[2525,2538] [2022-12-14 10:26:20,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 10:26:20,853 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 10:26:20,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:26:20,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:26:20,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:26:20,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:26:20,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 10:26:20,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 10:26:20,872 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_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/sv-benchmarks/c/weaver/popl20-more-array-sum-alt2.wvr.c[2525,2538] [2022-12-14 10:26:20,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 10:26:20,887 INFO L208 MainTranslator]: Completed translation [2022-12-14 10:26:20,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:26:20 WrapperNode [2022-12-14 10:26:20,887 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 10:26:20,888 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 10:26:20,888 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 10:26:20,888 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 10:26:20,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:26:20" (1/1) ... [2022-12-14 10:26:20,900 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:26:20" (1/1) ... [2022-12-14 10:26:20,919 INFO L138 Inliner]: procedures = 25, calls = 45, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 241 [2022-12-14 10:26:20,919 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 10:26:20,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 10:26:20,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 10:26:20,920 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 10:26:20,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:26:20" (1/1) ... [2022-12-14 10:26:20,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:26:20" (1/1) ... [2022-12-14 10:26:20,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:26:20" (1/1) ... [2022-12-14 10:26:20,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:26:20" (1/1) ... [2022-12-14 10:26:20,934 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:26:20" (1/1) ... [2022-12-14 10:26:20,937 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:26:20" (1/1) ... [2022-12-14 10:26:20,939 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:26:20" (1/1) ... [2022-12-14 10:26:20,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:26:20" (1/1) ... [2022-12-14 10:26:20,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 10:26:20,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 10:26:20,943 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 10:26:20,943 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 10:26:20,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:26:20" (1/1) ... [2022-12-14 10:26:20,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 10:26:20,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:26:20,971 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 10:26:20,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 10:26:21,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 10:26:21,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 10:26:21,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 10:26:21,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 10:26:21,002 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-14 10:26:21,002 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-14 10:26:21,002 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-14 10:26:21,002 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-14 10:26:21,003 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-14 10:26:21,003 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-14 10:26:21,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 10:26:21,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-14 10:26:21,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-14 10:26:21,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 10:26:21,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 10:26:21,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 10:26:21,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 10:26:21,005 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 10:26:21,096 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 10:26:21,098 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 10:26:21,433 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 10:26:21,793 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 10:26:21,793 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-14 10:26:21,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:26:21 BoogieIcfgContainer [2022-12-14 10:26:21,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 10:26:21,798 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 10:26:21,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 10:26:21,800 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 10:26:21,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 10:26:20" (1/3) ... [2022-12-14 10:26:21,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a0c0a27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 10:26:21, skipping insertion in model container [2022-12-14 10:26:21,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 10:26:20" (2/3) ... [2022-12-14 10:26:21,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a0c0a27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 10:26:21, skipping insertion in model container [2022-12-14 10:26:21,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 10:26:21" (3/3) ... [2022-12-14 10:26:21,803 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt2.wvr.c [2022-12-14 10:26:21,811 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 10:26:21,819 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 10:26:21,819 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2022-12-14 10:26:21,819 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 10:26:21,961 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-14 10:26:21,994 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 10:26:22,007 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 186 transitions, 396 flow [2022-12-14 10:26:22,009 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 186 transitions, 396 flow [2022-12-14 10:26:22,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 186 transitions, 396 flow [2022-12-14 10:26:22,077 INFO L130 PetriNetUnfolder]: 12/183 cut-off events. [2022-12-14 10:26:22,077 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-14 10:26:22,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 183 events. 12/183 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 233 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 136. Up to 2 conditions per place. [2022-12-14 10:26:22,083 INFO L119 LiptonReduction]: Number of co-enabled transitions 3840 [2022-12-14 10:26:36,963 INFO L134 LiptonReduction]: Checked pairs total: 5535 [2022-12-14 10:26:36,963 INFO L136 LiptonReduction]: Total number of compositions: 193 [2022-12-14 10:26:36,969 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 59 places, 53 transitions, 130 flow [2022-12-14 10:26:37,051 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3189 states, 2459 states have (on average 4.410736071573811) internal successors, (10846), 3188 states have internal predecessors, (10846), 0 states have call successors, (0), 0 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 10:26:37,065 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 10:26:37,069 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;@3a889cc1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 10:26:37,069 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2022-12-14 10:26:37,077 INFO L276 IsEmpty]: Start isEmpty. Operand has 3189 states, 2459 states have (on average 4.410736071573811) internal successors, (10846), 3188 states have internal predecessors, (10846), 0 states have call successors, (0), 0 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 10:26:37,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 10:26:37,081 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:26:37,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 10:26:37,081 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:26:37,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:26:37,085 INFO L85 PathProgramCache]: Analyzing trace with hash 35564, now seen corresponding path program 1 times [2022-12-14 10:26:37,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:26:37,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280340217] [2022-12-14 10:26:37,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:37,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:26:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:37,316 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 10:26:37,316 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:26:37,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280340217] [2022-12-14 10:26:37,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280340217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:26:37,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:26:37,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 10:26:37,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060332158] [2022-12-14 10:26:37,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:26:37,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:26:37,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:26:37,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:26:37,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:26:37,356 INFO L87 Difference]: Start difference. First operand has 3189 states, 2459 states have (on average 4.410736071573811) internal successors, (10846), 3188 states have internal predecessors, (10846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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 10:26:37,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:26:37,544 INFO L93 Difference]: Finished difference Result 3631 states and 12269 transitions. [2022-12-14 10:26:37,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:26:37,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-12-14 10:26:37,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:26:37,576 INFO L225 Difference]: With dead ends: 3631 [2022-12-14 10:26:37,576 INFO L226 Difference]: Without dead ends: 3631 [2022-12-14 10:26:37,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 10:26:37,579 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 38 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:26:37,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 6 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:26:37,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3631 states. [2022-12-14 10:26:37,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3631 to 1818. [2022-12-14 10:26:37,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1818 states, 1474 states have (on average 4.164179104477612) internal successors, (6138), 1817 states have internal predecessors, (6138), 0 states have call successors, (0), 0 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 10:26:37,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 6138 transitions. [2022-12-14 10:26:37,713 INFO L78 Accepts]: Start accepts. Automaton has 1818 states and 6138 transitions. Word has length 2 [2022-12-14 10:26:37,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:26:37,714 INFO L495 AbstractCegarLoop]: Abstraction has 1818 states and 6138 transitions. [2022-12-14 10:26:37,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 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 10:26:37,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 6138 transitions. [2022-12-14 10:26:37,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 10:26:37,715 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:26:37,715 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 10:26:37,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 10:26:37,715 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:26:37,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:26:37,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1103576, now seen corresponding path program 1 times [2022-12-14 10:26:37,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:26:37,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831544907] [2022-12-14 10:26:37,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:37,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:26:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:37,800 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 10:26:37,800 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:26:37,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831544907] [2022-12-14 10:26:37,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831544907] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:26:37,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76431479] [2022-12-14 10:26:37,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:37,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:26:37,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:26:37,802 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:26:37,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 10:26:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:37,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 10:26:37,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:26:37,935 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 10:26:37,936 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:26:37,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76431479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:26:37,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:26:37,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2022-12-14 10:26:37,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408609355] [2022-12-14 10:26:37,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:26:37,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 10:26:37,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:26:37,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 10:26:37,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:26:37,939 INFO L87 Difference]: Start difference. First operand 1818 states and 6138 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 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 10:26:38,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:26:38,110 INFO L93 Difference]: Finished difference Result 3630 states and 12268 transitions. [2022-12-14 10:26:38,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 10:26:38,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-12-14 10:26:38,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:26:38,127 INFO L225 Difference]: With dead ends: 3630 [2022-12-14 10:26:38,127 INFO L226 Difference]: Without dead ends: 3630 [2022-12-14 10:26:38,127 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 10:26:38,128 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 78 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:26:38,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 9 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:26:38,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3630 states. [2022-12-14 10:26:38,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3630 to 1817. [2022-12-14 10:26:38,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1817 states, 1474 states have (on average 4.163500678426051) internal successors, (6137), 1816 states have internal predecessors, (6137), 0 states have call successors, (0), 0 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 10:26:38,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 6137 transitions. [2022-12-14 10:26:38,183 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 6137 transitions. Word has length 3 [2022-12-14 10:26:38,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:26:38,183 INFO L495 AbstractCegarLoop]: Abstraction has 1817 states and 6137 transitions. [2022-12-14 10:26:38,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 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 10:26:38,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 6137 transitions. [2022-12-14 10:26:38,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 10:26:38,184 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:26:38,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 10:26:38,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 10:26:38,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:26:38,385 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:26:38,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:26:38,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1103578, now seen corresponding path program 1 times [2022-12-14 10:26:38,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:26:38,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243286735] [2022-12-14 10:26:38,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:38,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:26:38,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:38,430 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 10:26:38,430 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:26:38,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243286735] [2022-12-14 10:26:38,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243286735] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:26:38,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365226803] [2022-12-14 10:26:38,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:38,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:26:38,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:26:38,432 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:26:38,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 10:26:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:38,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 10:26:38,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:26:38,559 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 10:26:38,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:26:38,573 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 10:26:38,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365226803] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:26:38,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [446600574] [2022-12-14 10:26:38,582 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:243) 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 10:26:38,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:26:38,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2022-12-14 10:26:38,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712871959] [2022-12-14 10:26:38,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:26:38,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 10:26:38,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:26:38,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 10:26:38,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:26:38,586 INFO L87 Difference]: Start difference. First operand 1817 states and 6137 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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 10:26:38,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:26:38,939 INFO L93 Difference]: Finished difference Result 9072 states and 30667 transitions. [2022-12-14 10:26:38,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 10:26:38,939 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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 3 [2022-12-14 10:26:38,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:26:38,993 INFO L225 Difference]: With dead ends: 9072 [2022-12-14 10:26:38,993 INFO L226 Difference]: Without dead ends: 9072 [2022-12-14 10:26:38,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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 10:26:38,995 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 304 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:26:38,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 18 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 10:26:39,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9072 states. [2022-12-14 10:26:39,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9072 to 1820. [2022-12-14 10:26:39,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1820 states, 1477 states have (on average 4.159106296547055) internal successors, (6143), 1819 states have internal predecessors, (6143), 0 states have call successors, (0), 0 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 10:26:39,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 6143 transitions. [2022-12-14 10:26:39,128 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 6143 transitions. Word has length 3 [2022-12-14 10:26:39,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:26:39,129 INFO L495 AbstractCegarLoop]: Abstraction has 1820 states and 6143 transitions. [2022-12-14 10:26:39,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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 10:26:39,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 6143 transitions. [2022-12-14 10:26:39,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 10:26:39,129 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:26:39,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 10:26:39,135 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 10:26:39,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:26:39,331 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:26:39,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:26:39,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1060809896, now seen corresponding path program 1 times [2022-12-14 10:26:39,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:26:39,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18446114] [2022-12-14 10:26:39,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:39,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:26:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:39,504 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 10:26:39,504 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:26:39,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18446114] [2022-12-14 10:26:39,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18446114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:26:39,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:26:39,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 10:26:39,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864932752] [2022-12-14 10:26:39,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:26:39,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:26:39,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:26:39,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:26:39,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:26:39,506 INFO L87 Difference]: Start difference. First operand 1820 states and 6143 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:26:39,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:26:39,685 INFO L93 Difference]: Finished difference Result 2467 states and 8113 transitions. [2022-12-14 10:26:39,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:26:39,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 10:26:39,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:26:39,711 INFO L225 Difference]: With dead ends: 2467 [2022-12-14 10:26:39,711 INFO L226 Difference]: Without dead ends: 2463 [2022-12-14 10:26:39,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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 10:26:39,713 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 84 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:26:39,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 13 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:26:39,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2463 states. [2022-12-14 10:26:39,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2463 to 2241. [2022-12-14 10:26:39,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2241 states, 1898 states have (on average 4.067439409905163) internal successors, (7720), 2240 states have internal predecessors, (7720), 0 states have call successors, (0), 0 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 10:26:39,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 2241 states and 7720 transitions. [2022-12-14 10:26:39,775 INFO L78 Accepts]: Start accepts. Automaton has 2241 states and 7720 transitions. Word has length 5 [2022-12-14 10:26:39,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:26:39,776 INFO L495 AbstractCegarLoop]: Abstraction has 2241 states and 7720 transitions. [2022-12-14 10:26:39,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:26:39,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 7720 transitions. [2022-12-14 10:26:39,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 10:26:39,777 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:26:39,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 10:26:39,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 10:26:39,778 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:26:39,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:26:39,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1481782980, now seen corresponding path program 1 times [2022-12-14 10:26:39,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:26:39,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496190457] [2022-12-14 10:26:39,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:39,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:26:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:40,079 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 10:26:40,079 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:26:40,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496190457] [2022-12-14 10:26:40,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496190457] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:26:40,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705081817] [2022-12-14 10:26:40,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:40,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:26:40,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:26:40,081 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:26:40,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 10:26:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:40,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 10:26:40,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:26:40,259 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 11 treesize of output 7 [2022-12-14 10:26:40,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:26:40,297 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 10:26:40,319 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 10:26:40,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:26:40,382 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:26:40,382 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 24 treesize of output 25 [2022-12-14 10:26:40,389 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:26:40,390 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 39 treesize of output 37 [2022-12-14 10:26:40,394 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 7 treesize of output 5 [2022-12-14 10:26:40,424 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 10:26:40,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705081817] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:26:40,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2112745781] [2022-12-14 10:26:40,425 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 10:26:40,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:26:40,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-14 10:26:40,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390443838] [2022-12-14 10:26:40,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:26:40,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 10:26:40,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:26:40,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 10:26:40,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=99, Unknown=2, NotChecked=0, Total=132 [2022-12-14 10:26:40,428 INFO L87 Difference]: Start difference. First operand 2241 states and 7720 transitions. Second operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 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 10:26:40,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:26:40,888 INFO L93 Difference]: Finished difference Result 3373 states and 10321 transitions. [2022-12-14 10:26:40,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 10:26:40,888 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 10:26:40,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:26:40,903 INFO L225 Difference]: With dead ends: 3373 [2022-12-14 10:26:40,903 INFO L226 Difference]: Without dead ends: 3373 [2022-12-14 10:26:40,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=150, Unknown=2, NotChecked=0, Total=210 [2022-12-14 10:26:40,904 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 109 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 10:26:40,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 47 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 10:26:40,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2022-12-14 10:26:40,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 2242. [2022-12-14 10:26:40,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2242 states, 1899 states have (on average 4.068457082675092) internal successors, (7726), 2241 states have internal predecessors, (7726), 0 states have call successors, (0), 0 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 10:26:40,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 7726 transitions. [2022-12-14 10:26:40,953 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 7726 transitions. Word has length 6 [2022-12-14 10:26:40,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:26:40,954 INFO L495 AbstractCegarLoop]: Abstraction has 2242 states and 7726 transitions. [2022-12-14 10:26:40,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 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 10:26:40,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 7726 transitions. [2022-12-14 10:26:40,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 10:26:40,955 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:26:40,955 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 10:26:40,960 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 10:26:41,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:26:41,156 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:26:41,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:26:41,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1481782979, now seen corresponding path program 1 times [2022-12-14 10:26:41,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:26:41,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149375743] [2022-12-14 10:26:41,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:41,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:26:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:41,432 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 10:26:41,432 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:26:41,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149375743] [2022-12-14 10:26:41,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149375743] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:26:41,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198170644] [2022-12-14 10:26:41,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:41,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:26:41,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:26:41,433 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:26:41,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 10:26:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:41,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 10:26:41,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:26:41,568 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 11 treesize of output 7 [2022-12-14 10:26:41,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:26:41,594 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 14 treesize of output 16 [2022-12-14 10:26:41,626 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 10:26:41,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:26:41,656 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_182 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_182) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)) is different from false [2022-12-14 10:26:41,667 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:26:41,667 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 22 treesize of output 23 [2022-12-14 10:26:41,674 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:26:41,674 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 33 treesize of output 31 [2022-12-14 10:26:41,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 10:26:41,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 10:26:41,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198170644] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:26:41,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1218325877] [2022-12-14 10:26:41,700 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 10:26:41,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:26:41,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-14 10:26:41,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705446990] [2022-12-14 10:26:41,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:26:41,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 10:26:41,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:26:41,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 10:26:41,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=102, Unknown=1, NotChecked=20, Total=156 [2022-12-14 10:26:41,702 INFO L87 Difference]: Start difference. First operand 2242 states and 7726 transitions. Second operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 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 10:26:42,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:26:42,081 INFO L93 Difference]: Finished difference Result 3372 states and 10319 transitions. [2022-12-14 10:26:42,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 10:26:42,081 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 10:26:42,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:26:42,095 INFO L225 Difference]: With dead ends: 3372 [2022-12-14 10:26:42,096 INFO L226 Difference]: Without dead ends: 3372 [2022-12-14 10:26:42,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=155, Unknown=1, NotChecked=26, Total=240 [2022-12-14 10:26:42,097 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 152 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:26:42,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 32 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 421 Invalid, 0 Unknown, 73 Unchecked, 0.3s Time] [2022-12-14 10:26:42,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3372 states. [2022-12-14 10:26:42,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3372 to 2242. [2022-12-14 10:26:42,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2242 states, 1899 states have (on average 4.067930489731437) internal successors, (7725), 2241 states have internal predecessors, (7725), 0 states have call successors, (0), 0 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 10:26:42,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 7725 transitions. [2022-12-14 10:26:42,167 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 7725 transitions. Word has length 6 [2022-12-14 10:26:42,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:26:42,167 INFO L495 AbstractCegarLoop]: Abstraction has 2242 states and 7725 transitions. [2022-12-14 10:26:42,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 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 10:26:42,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 7725 transitions. [2022-12-14 10:26:42,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 10:26:42,168 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:26:42,168 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 10:26:42,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-14 10:26:42,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-14 10:26:42,369 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:26:42,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:26:42,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1481782977, now seen corresponding path program 1 times [2022-12-14 10:26:42,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:26:42,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828028808] [2022-12-14 10:26:42,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:42,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:26:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:42,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 10:26:42,534 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:26:42,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828028808] [2022-12-14 10:26:42,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828028808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:26:42,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:26:42,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 10:26:42,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143542838] [2022-12-14 10:26:42,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:26:42,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:26:42,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:26:42,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:26:42,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:26:42,536 INFO L87 Difference]: Start difference. First operand 2242 states and 7725 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:26:42,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:26:42,650 INFO L93 Difference]: Finished difference Result 3141 states and 11265 transitions. [2022-12-14 10:26:42,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:26:42,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 10:26:42,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:26:42,667 INFO L225 Difference]: With dead ends: 3141 [2022-12-14 10:26:42,667 INFO L226 Difference]: Without dead ends: 3141 [2022-12-14 10:26:42,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 10:26:42,669 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 32 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:26:42,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 5 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:26:42,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3141 states. [2022-12-14 10:26:42,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3141 to 2423. [2022-12-14 10:26:42,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2423 states, 2080 states have (on average 4.534134615384615) internal successors, (9431), 2422 states have internal predecessors, (9431), 0 states have call successors, (0), 0 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 10:26:42,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 9431 transitions. [2022-12-14 10:26:42,758 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 9431 transitions. Word has length 6 [2022-12-14 10:26:42,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:26:42,759 INFO L495 AbstractCegarLoop]: Abstraction has 2423 states and 9431 transitions. [2022-12-14 10:26:42,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:26:42,759 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 9431 transitions. [2022-12-14 10:26:42,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 10:26:42,759 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:26:42,759 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 10:26:42,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 10:26:42,760 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:26:42,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:26:42,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1481782976, now seen corresponding path program 1 times [2022-12-14 10:26:42,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:26:42,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990343612] [2022-12-14 10:26:42,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:42,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:26:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:42,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 10:26:42,822 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:26:42,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990343612] [2022-12-14 10:26:42,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990343612] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:26:42,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:26:42,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 10:26:42,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789770972] [2022-12-14 10:26:42,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:26:42,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:26:42,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:26:42,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:26:42,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:26:42,824 INFO L87 Difference]: Start difference. First operand 2423 states and 9431 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:26:42,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:26:42,935 INFO L93 Difference]: Finished difference Result 3141 states and 11083 transitions. [2022-12-14 10:26:42,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:26:42,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 10:26:42,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:26:42,947 INFO L225 Difference]: With dead ends: 3141 [2022-12-14 10:26:42,947 INFO L226 Difference]: Without dead ends: 3141 [2022-12-14 10:26:42,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 10:26:42,948 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 31 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:26:42,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 5 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:26:42,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3141 states. [2022-12-14 10:26:42,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3141 to 2423. [2022-12-14 10:26:42,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2423 states, 2080 states have (on average 4.446634615384616) internal successors, (9249), 2422 states have internal predecessors, (9249), 0 states have call successors, (0), 0 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 10:26:42,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 9249 transitions. [2022-12-14 10:26:42,997 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 9249 transitions. Word has length 6 [2022-12-14 10:26:42,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:26:42,997 INFO L495 AbstractCegarLoop]: Abstraction has 2423 states and 9249 transitions. [2022-12-14 10:26:42,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:26:42,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 9249 transitions. [2022-12-14 10:26:42,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 10:26:42,998 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:26:42,998 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1] [2022-12-14 10:26:42,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 10:26:42,998 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:26:42,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:26:42,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1482021394, now seen corresponding path program 2 times [2022-12-14 10:26:42,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:26:42,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87993182] [2022-12-14 10:26:42,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:42,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:26:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:43,056 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:26:43,057 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:26:43,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87993182] [2022-12-14 10:26:43,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87993182] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:26:43,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393816178] [2022-12-14 10:26:43,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:26:43,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:26:43,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:26:43,058 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:26:43,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 10:26:43,185 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 10:26:43,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:26:43,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 10:26:43,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:26:43,196 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 10:26:43,197 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:26:43,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393816178] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:26:43,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:26:43,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2022-12-14 10:26:43,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155400134] [2022-12-14 10:26:43,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:26:43,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:26:43,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:26:43,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:26:43,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-14 10:26:43,198 INFO L87 Difference]: Start difference. First operand 2423 states and 9249 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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 10:26:43,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:26:43,263 INFO L93 Difference]: Finished difference Result 2422 states and 9248 transitions. [2022-12-14 10:26:43,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:26:43,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 10:26:43,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:26:43,270 INFO L225 Difference]: With dead ends: 2422 [2022-12-14 10:26:43,270 INFO L226 Difference]: Without dead ends: 2422 [2022-12-14 10:26:43,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-14 10:26:43,271 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:26:43,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 3 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:26:43,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2022-12-14 10:26:43,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2419. [2022-12-14 10:26:43,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2419 states, 2077 states have (on average 4.449687048627829) internal successors, (9242), 2418 states have internal predecessors, (9242), 0 states have call successors, (0), 0 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 10:26:43,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2419 states and 9242 transitions. [2022-12-14 10:26:43,315 INFO L78 Accepts]: Start accepts. Automaton has 2419 states and 9242 transitions. Word has length 6 [2022-12-14 10:26:43,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:26:43,315 INFO L495 AbstractCegarLoop]: Abstraction has 2419 states and 9242 transitions. [2022-12-14 10:26:43,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 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 10:26:43,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 9242 transitions. [2022-12-14 10:26:43,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 10:26:43,316 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:26:43,316 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:26:43,322 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 10:26:43,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:26:43,517 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:26:43,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:26:43,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1537836013, now seen corresponding path program 1 times [2022-12-14 10:26:43,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:26:43,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504031361] [2022-12-14 10:26:43,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:43,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:26:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:43,655 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 10:26:43,655 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:26:43,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504031361] [2022-12-14 10:26:43,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504031361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:26:43,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:26:43,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 10:26:43,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480210149] [2022-12-14 10:26:43,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:26:43,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:26:43,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:26:43,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:26:43,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:26:43,657 INFO L87 Difference]: Start difference. First operand 2419 states and 9242 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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 10:26:43,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:26:43,751 INFO L93 Difference]: Finished difference Result 3187 states and 12734 transitions. [2022-12-14 10:26:43,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:26:43,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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 10:26:43,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:26:43,760 INFO L225 Difference]: With dead ends: 3187 [2022-12-14 10:26:43,760 INFO L226 Difference]: Without dead ends: 3187 [2022-12-14 10:26:43,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 10:26:43,761 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 24 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:26:43,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 6 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:26:43,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3187 states. [2022-12-14 10:26:43,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3187 to 2957. [2022-12-14 10:26:43,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2957 states, 2615 states have (on average 4.707839388145316) internal successors, (12311), 2956 states have internal predecessors, (12311), 0 states have call successors, (0), 0 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 10:26:43,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2957 states to 2957 states and 12311 transitions. [2022-12-14 10:26:43,824 INFO L78 Accepts]: Start accepts. Automaton has 2957 states and 12311 transitions. Word has length 7 [2022-12-14 10:26:43,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:26:43,824 INFO L495 AbstractCegarLoop]: Abstraction has 2957 states and 12311 transitions. [2022-12-14 10:26:43,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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 10:26:43,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2957 states and 12311 transitions. [2022-12-14 10:26:43,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 10:26:43,825 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:26:43,825 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:26:43,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 10:26:43,825 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:26:43,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:26:43,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1537836132, now seen corresponding path program 1 times [2022-12-14 10:26:43,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:26:43,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545414146] [2022-12-14 10:26:43,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:43,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:26:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:43,868 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 10:26:43,868 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:26:43,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545414146] [2022-12-14 10:26:43,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545414146] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:26:43,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:26:43,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:26:43,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991437324] [2022-12-14 10:26:43,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:26:43,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:26:43,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:26:43,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:26:43,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:26:43,870 INFO L87 Difference]: Start difference. First operand 2957 states and 12311 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:26:44,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:26:44,013 INFO L93 Difference]: Finished difference Result 4213 states and 16918 transitions. [2022-12-14 10:26:44,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:26:44,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-14 10:26:44,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:26:44,035 INFO L225 Difference]: With dead ends: 4213 [2022-12-14 10:26:44,035 INFO L226 Difference]: Without dead ends: 4213 [2022-12-14 10:26:44,035 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 10:26:44,036 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 30 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:26:44,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 7 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:26:44,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4213 states. [2022-12-14 10:26:44,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4213 to 3165. [2022-12-14 10:26:44,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3165 states, 2823 states have (on average 4.901168969181722) internal successors, (13836), 3164 states have internal predecessors, (13836), 0 states have call successors, (0), 0 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 10:26:44,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3165 states to 3165 states and 13836 transitions. [2022-12-14 10:26:44,146 INFO L78 Accepts]: Start accepts. Automaton has 3165 states and 13836 transitions. Word has length 7 [2022-12-14 10:26:44,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:26:44,146 INFO L495 AbstractCegarLoop]: Abstraction has 3165 states and 13836 transitions. [2022-12-14 10:26:44,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:26:44,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3165 states and 13836 transitions. [2022-12-14 10:26:44,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 10:26:44,146 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:26:44,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:26:44,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 10:26:44,147 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:26:44,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:26:44,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1537836010, now seen corresponding path program 1 times [2022-12-14 10:26:44,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:26:44,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467470064] [2022-12-14 10:26:44,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:44,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:26:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:44,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:26:44,220 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:26:44,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467470064] [2022-12-14 10:26:44,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467470064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:26:44,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:26:44,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 10:26:44,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808018073] [2022-12-14 10:26:44,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:26:44,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:26:44,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:26:44,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:26:44,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:26:44,222 INFO L87 Difference]: Start difference. First operand 3165 states and 13836 transitions. 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 10:26:44,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:26:44,397 INFO L93 Difference]: Finished difference Result 2885 states and 12274 transitions. [2022-12-14 10:26:44,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 10:26:44,398 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 10:26:44,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:26:44,407 INFO L225 Difference]: With dead ends: 2885 [2022-12-14 10:26:44,407 INFO L226 Difference]: Without dead ends: 2853 [2022-12-14 10:26:44,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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 10:26:44,408 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 59 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:26:44,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 8 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:26:44,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2022-12-14 10:26:44,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 2791. [2022-12-14 10:26:44,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2791 states, 2449 states have (on average 4.939567170273581) internal successors, (12097), 2790 states have internal predecessors, (12097), 0 states have call successors, (0), 0 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 10:26:44,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2791 states and 12097 transitions. [2022-12-14 10:26:44,463 INFO L78 Accepts]: Start accepts. Automaton has 2791 states and 12097 transitions. Word has length 7 [2022-12-14 10:26:44,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:26:44,464 INFO L495 AbstractCegarLoop]: Abstraction has 2791 states and 12097 transitions. [2022-12-14 10:26:44,464 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 10:26:44,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2791 states and 12097 transitions. [2022-12-14 10:26:44,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 10:26:44,464 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:26:44,464 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:26:44,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 10:26:44,464 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:26:44,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:26:44,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1309372435, now seen corresponding path program 1 times [2022-12-14 10:26:44,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:26:44,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136448389] [2022-12-14 10:26:44,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:44,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:26:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:44,659 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 10:26:44,659 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:26:44,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136448389] [2022-12-14 10:26:44,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136448389] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:26:44,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690497103] [2022-12-14 10:26:44,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:44,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:26:44,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:26:44,661 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:26:44,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 10:26:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:44,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-14 10:26:44,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:26:44,810 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 11 treesize of output 7 [2022-12-14 10:26:44,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:26:44,840 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 10:26:44,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:26:44,884 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 10:26:44,893 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 10:26:44,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:26:44,929 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_364 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_364) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-12-14 10:26:44,968 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:26:44,969 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 27 treesize of output 28 [2022-12-14 10:26:44,976 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:26:44,976 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 143 treesize of output 137 [2022-12-14 10:26:44,981 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 122 treesize of output 114 [2022-12-14 10:26:44,985 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 114 treesize of output 110 [2022-12-14 10:26:45,039 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 10:26:45,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690497103] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:26:45,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [617651635] [2022-12-14 10:26:45,039 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 10:26:45,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:26:45,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-14 10:26:45,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438724615] [2022-12-14 10:26:45,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:26:45,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 10:26:45,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:26:45,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 10:26:45,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=162, Unknown=5, NotChecked=26, Total=240 [2022-12-14 10:26:45,041 INFO L87 Difference]: Start difference. First operand 2791 states and 12097 transitions. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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 10:26:45,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:26:45,603 INFO L93 Difference]: Finished difference Result 3955 states and 15545 transitions. [2022-12-14 10:26:45,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 10:26:45,603 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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 7 [2022-12-14 10:26:45,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:26:45,617 INFO L225 Difference]: With dead ends: 3955 [2022-12-14 10:26:45,617 INFO L226 Difference]: Without dead ends: 3955 [2022-12-14 10:26:45,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=227, Unknown=5, NotChecked=32, Total=342 [2022-12-14 10:26:45,618 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 185 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 10:26:45,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 54 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 586 Invalid, 0 Unknown, 89 Unchecked, 0.4s Time] [2022-12-14 10:26:45,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3955 states. [2022-12-14 10:26:45,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3955 to 2791. [2022-12-14 10:26:45,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2791 states, 2449 states have (on average 4.922417313189057) internal successors, (12055), 2790 states have internal predecessors, (12055), 0 states have call successors, (0), 0 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 10:26:45,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2791 states and 12055 transitions. [2022-12-14 10:26:45,681 INFO L78 Accepts]: Start accepts. Automaton has 2791 states and 12055 transitions. Word has length 7 [2022-12-14 10:26:45,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:26:45,682 INFO L495 AbstractCegarLoop]: Abstraction has 2791 states and 12055 transitions. [2022-12-14 10:26:45,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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 10:26:45,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2791 states and 12055 transitions. [2022-12-14 10:26:45,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 10:26:45,682 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:26:45,682 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:26:45,688 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 10:26:45,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:26:45,883 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:26:45,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:26:45,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1309372436, now seen corresponding path program 1 times [2022-12-14 10:26:45,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:26:45,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572573406] [2022-12-14 10:26:45,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:45,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:26:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:46,148 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 10:26:46,148 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:26:46,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572573406] [2022-12-14 10:26:46,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572573406] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:26:46,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339495265] [2022-12-14 10:26:46,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:46,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:26:46,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:26:46,150 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:26:46,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 10:26:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:46,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-14 10:26:46,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:26:46,315 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 11 treesize of output 7 [2022-12-14 10:26:46,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:26:46,352 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 14 treesize of output 16 [2022-12-14 10:26:46,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:26:46,404 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 14 treesize of output 16 [2022-12-14 10:26:46,420 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 10:26:46,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:26:46,463 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_408 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_408) c_~A~0.base) c_~A~0.offset) 4294967296)) is different from false [2022-12-14 10:26:46,514 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:26:46,515 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 25 treesize of output 26 [2022-12-14 10:26:46,522 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:26:46,523 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 125 treesize of output 119 [2022-12-14 10:26:46,529 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 53 treesize of output 49 [2022-12-14 10:26:46,534 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 102 treesize of output 94 [2022-12-14 10:26:46,578 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 10:26:46,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339495265] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:26:46,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1115839547] [2022-12-14 10:26:46,578 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 10:26:46,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:26:46,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-14 10:26:46,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004669245] [2022-12-14 10:26:46,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:26:46,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 10:26:46,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:26:46,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 10:26:46,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=187, Unknown=5, NotChecked=28, Total=272 [2022-12-14 10:26:46,580 INFO L87 Difference]: Start difference. First operand 2791 states and 12055 transitions. Second operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:26:47,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:26:47,164 INFO L93 Difference]: Finished difference Result 3941 states and 15504 transitions. [2022-12-14 10:26:47,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 10:26:47,165 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-14 10:26:47,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:26:47,174 INFO L225 Difference]: With dead ends: 3941 [2022-12-14 10:26:47,174 INFO L226 Difference]: Without dead ends: 3941 [2022-12-14 10:26:47,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=257, Unknown=5, NotChecked=34, Total=380 [2022-12-14 10:26:47,175 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 148 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 10:26:47,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 62 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 707 Invalid, 0 Unknown, 83 Unchecked, 0.5s Time] [2022-12-14 10:26:47,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3941 states. [2022-12-14 10:26:47,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3941 to 2791. [2022-12-14 10:26:47,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2791 states, 2449 states have (on average 4.916700694160882) internal successors, (12041), 2790 states have internal predecessors, (12041), 0 states have call successors, (0), 0 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 10:26:47,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2791 states and 12041 transitions. [2022-12-14 10:26:47,231 INFO L78 Accepts]: Start accepts. Automaton has 2791 states and 12041 transitions. Word has length 7 [2022-12-14 10:26:47,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:26:47,231 INFO L495 AbstractCegarLoop]: Abstraction has 2791 states and 12041 transitions. [2022-12-14 10:26:47,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:26:47,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2791 states and 12041 transitions. [2022-12-14 10:26:47,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 10:26:47,231 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:26:47,231 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:26:47,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 10:26:47,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 10:26:47,433 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:26:47,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:26:47,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1309372962, now seen corresponding path program 1 times [2022-12-14 10:26:47,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:26:47,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196856299] [2022-12-14 10:26:47,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:47,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:26:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:47,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:26:47,531 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:26:47,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196856299] [2022-12-14 10:26:47,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196856299] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:26:47,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166273870] [2022-12-14 10:26:47,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:47,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:26:47,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:26:47,533 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:26:47,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 10:26:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:47,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 10:26:47,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:26:47,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:26:47,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:26:47,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:26:47,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166273870] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:26:47,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [929017250] [2022-12-14 10:26:47,749 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 10:26:47,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:26:47,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-14 10:26:47,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392674309] [2022-12-14 10:26:47,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:26:47,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 10:26:47,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:26:47,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 10:26:47,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-12-14 10:26:47,750 INFO L87 Difference]: Start difference. First operand 2791 states and 12041 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 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 10:26:48,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:26:48,184 INFO L93 Difference]: Finished difference Result 4709 states and 19153 transitions. [2022-12-14 10:26:48,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 10:26:48,184 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 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 10:26:48,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:26:48,196 INFO L225 Difference]: With dead ends: 4709 [2022-12-14 10:26:48,196 INFO L226 Difference]: Without dead ends: 4707 [2022-12-14 10:26:48,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2022-12-14 10:26:48,197 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 382 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:26:48,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 44 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 10:26:48,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4707 states. [2022-12-14 10:26:48,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4707 to 3687. [2022-12-14 10:26:48,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3687 states, 3345 states have (on average 4.926158445440957) internal successors, (16478), 3686 states have internal predecessors, (16478), 0 states have call successors, (0), 0 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 10:26:48,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3687 states to 3687 states and 16478 transitions. [2022-12-14 10:26:48,284 INFO L78 Accepts]: Start accepts. Automaton has 3687 states and 16478 transitions. Word has length 7 [2022-12-14 10:26:48,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:26:48,284 INFO L495 AbstractCegarLoop]: Abstraction has 3687 states and 16478 transitions. [2022-12-14 10:26:48,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 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 10:26:48,284 INFO L276 IsEmpty]: Start isEmpty. Operand 3687 states and 16478 transitions. [2022-12-14 10:26:48,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 10:26:48,284 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:26:48,284 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:26:48,289 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 10:26:48,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 10:26:48,487 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:26:48,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:26:48,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1942473598, now seen corresponding path program 1 times [2022-12-14 10:26:48,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:26:48,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895491152] [2022-12-14 10:26:48,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:48,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:26:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:48,679 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 10:26:48,679 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:26:48,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895491152] [2022-12-14 10:26:48,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895491152] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:26:48,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965067843] [2022-12-14 10:26:48,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:48,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:26:48,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:26:48,680 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:26:48,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 10:26:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:48,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-14 10:26:48,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:26:48,845 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 11 treesize of output 7 [2022-12-14 10:26:48,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:26:48,876 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 10:26:48,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:26:48,905 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 10:26:48,925 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 10:26:48,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:26:49,026 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:26:49,027 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 27 treesize of output 28 [2022-12-14 10:26:49,034 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:26:49,034 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 143 treesize of output 137 [2022-12-14 10:26:49,039 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 122 treesize of output 114 [2022-12-14 10:26:49,044 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 59 treesize of output 55 [2022-12-14 10:26:49,093 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 10:26:49,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965067843] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:26:49,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1575882138] [2022-12-14 10:26:49,094 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 10:26:49,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:26:49,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-14 10:26:49,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737889003] [2022-12-14 10:26:49,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:26:49,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 10:26:49,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:26:49,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 10:26:49,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=164, Unknown=1, NotChecked=0, Total=210 [2022-12-14 10:26:49,095 INFO L87 Difference]: Start difference. First operand 3687 states and 16478 transitions. Second operand has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:26:49,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:26:49,512 INFO L93 Difference]: Finished difference Result 5219 states and 21267 transitions. [2022-12-14 10:26:49,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 10:26:49,513 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 10:26:49,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:26:49,526 INFO L225 Difference]: With dead ends: 5219 [2022-12-14 10:26:49,526 INFO L226 Difference]: Without dead ends: 5219 [2022-12-14 10:26:49,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=224, Unknown=1, NotChecked=0, Total=306 [2022-12-14 10:26:49,527 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 204 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:26:49,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 37 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 10:26:49,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5219 states. [2022-12-14 10:26:49,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5219 to 3673. [2022-12-14 10:26:49,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3673 states, 3331 states have (on average 4.933953767637346) internal successors, (16435), 3672 states have internal predecessors, (16435), 0 states have call successors, (0), 0 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 10:26:49,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3673 states to 3673 states and 16435 transitions. [2022-12-14 10:26:49,632 INFO L78 Accepts]: Start accepts. Automaton has 3673 states and 16435 transitions. Word has length 8 [2022-12-14 10:26:49,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:26:49,632 INFO L495 AbstractCegarLoop]: Abstraction has 3673 states and 16435 transitions. [2022-12-14 10:26:49,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.5) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:26:49,633 INFO L276 IsEmpty]: Start isEmpty. Operand 3673 states and 16435 transitions. [2022-12-14 10:26:49,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 10:26:49,633 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:26:49,633 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:26:49,639 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 10:26:49,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 10:26:49,835 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:26:49,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:26:49,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1942473599, now seen corresponding path program 1 times [2022-12-14 10:26:49,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:26:49,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423721792] [2022-12-14 10:26:49,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:49,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:26:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:50,063 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 10:26:50,063 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:26:50,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423721792] [2022-12-14 10:26:50,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423721792] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:26:50,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869007851] [2022-12-14 10:26:50,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:50,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:26:50,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:26:50,065 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:26:50,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 10:26:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:50,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-14 10:26:50,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:26:50,225 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 11 treesize of output 7 [2022-12-14 10:26:50,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:26:50,254 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 14 treesize of output 16 [2022-12-14 10:26:50,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:26:50,278 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 14 treesize of output 16 [2022-12-14 10:26:50,302 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 10:26:50,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:26:50,328 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_532 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_532) c_~A~0.base) c_~A~0.offset) 4294967296)) is different from false [2022-12-14 10:26:50,335 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_531 (Array Int Int)) (v_ArrVal_532 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_531) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_532) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4294967296)) is different from false [2022-12-14 10:26:50,343 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:26:50,343 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 25 treesize of output 26 [2022-12-14 10:26:50,348 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:26:50,349 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 63 treesize of output 61 [2022-12-14 10:26:50,352 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 24 treesize of output 22 [2022-12-14 10:26:50,356 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 46 treesize of output 42 [2022-12-14 10:26:50,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 10:26:50,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869007851] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:26:50,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1442110516] [2022-12-14 10:26:50,398 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 10:26:50,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:26:50,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-14 10:26:50,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069849753] [2022-12-14 10:26:50,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:26:50,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 10:26:50,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:26:50,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 10:26:50,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=144, Unknown=2, NotChecked=50, Total=240 [2022-12-14 10:26:50,399 INFO L87 Difference]: Start difference. First operand 3673 states and 16435 transitions. Second operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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 10:26:50,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:26:50,855 INFO L93 Difference]: Finished difference Result 5117 states and 20825 transitions. [2022-12-14 10:26:50,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 10:26:50,856 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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 8 [2022-12-14 10:26:50,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:26:50,868 INFO L225 Difference]: With dead ends: 5117 [2022-12-14 10:26:50,868 INFO L226 Difference]: Without dead ends: 5117 [2022-12-14 10:26:50,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=203, Unknown=2, NotChecked=62, Total=342 [2022-12-14 10:26:50,869 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 151 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 161 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:26:50,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 45 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 508 Invalid, 0 Unknown, 161 Unchecked, 0.3s Time] [2022-12-14 10:26:50,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5117 states. [2022-12-14 10:26:50,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5117 to 3659. [2022-12-14 10:26:50,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3659 states, 3317 states have (on average 4.9418148929755805) internal successors, (16392), 3658 states have internal predecessors, (16392), 0 states have call successors, (0), 0 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 10:26:50,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3659 states to 3659 states and 16392 transitions. [2022-12-14 10:26:50,939 INFO L78 Accepts]: Start accepts. Automaton has 3659 states and 16392 transitions. Word has length 8 [2022-12-14 10:26:50,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:26:50,939 INFO L495 AbstractCegarLoop]: Abstraction has 3659 states and 16392 transitions. [2022-12-14 10:26:50,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 15 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 10:26:50,939 INFO L276 IsEmpty]: Start isEmpty. Operand 3659 states and 16392 transitions. [2022-12-14 10:26:50,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 10:26:50,940 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:26:50,940 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-12-14 10:26:50,945 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 10:26:51,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 10:26:51,141 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:26:51,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:26:51,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1714010550, now seen corresponding path program 2 times [2022-12-14 10:26:51,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:26:51,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170135143] [2022-12-14 10:26:51,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:51,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:26:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:51,367 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:26:51,367 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:26:51,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170135143] [2022-12-14 10:26:51,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170135143] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:26:51,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772973833] [2022-12-14 10:26:51,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:26:51,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:26:51,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:26:51,369 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:26:51,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 10:26:51,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 10:26:51,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:26:51,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-14 10:26:51,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:26:51,568 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 10:26:51,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:26:51,594 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 10:26:51,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:26:51,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:26:51,693 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:26:51,694 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 26 treesize of output 27 [2022-12-14 10:26:51,699 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:26:51,700 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 43 treesize of output 39 [2022-12-14 10:26:51,703 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 10:26:51,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:26:51,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772973833] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:26:51,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1424250842] [2022-12-14 10:26:51,736 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 10:26:51,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:26:51,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-14 10:26:51,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188709106] [2022-12-14 10:26:51,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:26:51,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 10:26:51,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:26:51,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 10:26:51,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=254, Unknown=1, NotChecked=0, Total=306 [2022-12-14 10:26:51,737 INFO L87 Difference]: Start difference. First operand 3659 states and 16392 transitions. Second operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:26:52,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:26:52,334 INFO L93 Difference]: Finished difference Result 5432 states and 21251 transitions. [2022-12-14 10:26:52,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 10:26:52,335 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 10:26:52,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:26:52,349 INFO L225 Difference]: With dead ends: 5432 [2022-12-14 10:26:52,349 INFO L226 Difference]: Without dead ends: 5432 [2022-12-14 10:26:52,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=443, Unknown=1, NotChecked=0, Total=552 [2022-12-14 10:26:52,350 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 207 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 10:26:52,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 87 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 10:26:52,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5432 states. [2022-12-14 10:26:52,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5432 to 3660. [2022-12-14 10:26:52,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3660 states, 3318 states have (on average 4.942133815551537) internal successors, (16398), 3659 states have internal predecessors, (16398), 0 states have call successors, (0), 0 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 10:26:52,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3660 states to 3660 states and 16398 transitions. [2022-12-14 10:26:52,438 INFO L78 Accepts]: Start accepts. Automaton has 3660 states and 16398 transitions. Word has length 8 [2022-12-14 10:26:52,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:26:52,438 INFO L495 AbstractCegarLoop]: Abstraction has 3660 states and 16398 transitions. [2022-12-14 10:26:52,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:26:52,438 INFO L276 IsEmpty]: Start isEmpty. Operand 3660 states and 16398 transitions. [2022-12-14 10:26:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 10:26:52,438 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:26:52,439 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-12-14 10:26:52,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 10:26:52,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 10:26:52,640 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:26:52,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:26:52,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1714010551, now seen corresponding path program 1 times [2022-12-14 10:26:52,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:26:52,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556624503] [2022-12-14 10:26:52,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:52,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:26:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:52,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:26:52,864 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:26:52,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556624503] [2022-12-14 10:26:52,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556624503] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:26:52,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661062463] [2022-12-14 10:26:52,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:52,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:26:52,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:26:52,865 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:26:52,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 10:26:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:53,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-14 10:26:53,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:26:53,037 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 10:26:53,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:26:53,058 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 10:26:53,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:26:53,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:26:53,133 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_618 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_618) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-12-14 10:26:53,141 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:26:53,142 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 24 treesize of output 25 [2022-12-14 10:26:53,146 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:26:53,147 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 37 treesize of output 33 [2022-12-14 10:26:53,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 10:26:53,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661062463] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:26:53,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1253562660] [2022-12-14 10:26:53,174 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 10:26:53,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:26:53,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-14 10:26:53,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090101783] [2022-12-14 10:26:53,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:26:53,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 10:26:53,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:26:53,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 10:26:53,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=289, Unknown=1, NotChecked=34, Total=380 [2022-12-14 10:26:53,175 INFO L87 Difference]: Start difference. First operand 3660 states and 16398 transitions. Second operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 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 10:26:53,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:26:53,804 INFO L93 Difference]: Finished difference Result 5431 states and 21249 transitions. [2022-12-14 10:26:53,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 10:26:53,804 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 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 10:26:53,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:26:53,821 INFO L225 Difference]: With dead ends: 5431 [2022-12-14 10:26:53,821 INFO L226 Difference]: Without dead ends: 5431 [2022-12-14 10:26:53,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=626, Unknown=1, NotChecked=52, Total=812 [2022-12-14 10:26:53,822 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 253 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 10:26:53,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 70 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 800 Invalid, 0 Unknown, 121 Unchecked, 0.4s Time] [2022-12-14 10:26:53,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5431 states. [2022-12-14 10:26:53,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5431 to 3660. [2022-12-14 10:26:53,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3660 states, 3318 states have (on average 4.941832429174202) internal successors, (16397), 3659 states have internal predecessors, (16397), 0 states have call successors, (0), 0 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 10:26:53,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3660 states to 3660 states and 16397 transitions. [2022-12-14 10:26:53,894 INFO L78 Accepts]: Start accepts. Automaton has 3660 states and 16397 transitions. Word has length 8 [2022-12-14 10:26:53,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:26:53,894 INFO L495 AbstractCegarLoop]: Abstraction has 3660 states and 16397 transitions. [2022-12-14 10:26:53,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 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 10:26:53,894 INFO L276 IsEmpty]: Start isEmpty. Operand 3660 states and 16397 transitions. [2022-12-14 10:26:53,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 10:26:53,894 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:26:53,894 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-12-14 10:26:53,899 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 10:26:54,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:26:54,096 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:26:54,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:26:54,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1714010553, now seen corresponding path program 1 times [2022-12-14 10:26:54,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:26:54,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909394648] [2022-12-14 10:26:54,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:54,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:26:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:54,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 10:26:54,230 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:26:54,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909394648] [2022-12-14 10:26:54,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909394648] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:26:54,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512690705] [2022-12-14 10:26:54,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:54,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:26:54,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:26:54,232 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:26:54,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 10:26:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:54,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 10:26:54,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:26:54,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 10:26:54,448 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:26:54,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512690705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:26:54,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:26:54,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2022-12-14 10:26:54,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115948501] [2022-12-14 10:26:54,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:26:54,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:26:54,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:26:54,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:26:54,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:26:54,450 INFO L87 Difference]: Start difference. First operand 3660 states and 16397 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:26:56,457 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 10:26:58,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:26:58,536 INFO L93 Difference]: Finished difference Result 5638 states and 24360 transitions. [2022-12-14 10:26:58,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:26:58,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 10:26:58,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:26:58,551 INFO L225 Difference]: With dead ends: 5638 [2022-12-14 10:26:58,551 INFO L226 Difference]: Without dead ends: 5638 [2022-12-14 10:26:58,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:26:58,552 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 28 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:26:58,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 8 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 3 Unknown, 0 Unchecked, 4.1s Time] [2022-12-14 10:26:58,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5638 states. [2022-12-14 10:26:58,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5638 to 3670. [2022-12-14 10:26:58,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3670 states, 3328 states have (on average 4.953725961538462) internal successors, (16486), 3669 states have internal predecessors, (16486), 0 states have call successors, (0), 0 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 10:26:58,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3670 states to 3670 states and 16486 transitions. [2022-12-14 10:26:58,623 INFO L78 Accepts]: Start accepts. Automaton has 3670 states and 16486 transitions. Word has length 8 [2022-12-14 10:26:58,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:26:58,623 INFO L495 AbstractCegarLoop]: Abstraction has 3670 states and 16486 transitions. [2022-12-14 10:26:58,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:26:58,623 INFO L276 IsEmpty]: Start isEmpty. Operand 3670 states and 16486 transitions. [2022-12-14 10:26:58,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 10:26:58,624 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:26:58,624 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:26:58,629 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 10:26:58,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:26:58,825 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:26:58,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:26:58,826 INFO L85 PathProgramCache]: Analyzing trace with hash 397899243, now seen corresponding path program 1 times [2022-12-14 10:26:58,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:26:58,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459907089] [2022-12-14 10:26:58,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:58,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:26:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:58,874 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 10:26:58,874 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:26:58,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459907089] [2022-12-14 10:26:58,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459907089] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:26:58,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:26:58,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:26:58,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953771921] [2022-12-14 10:26:58,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:26:58,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 10:26:58,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:26:58,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 10:26:58,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 10:26:58,876 INFO L87 Difference]: Start difference. First operand 3670 states and 16486 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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 10:26:58,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:26:58,971 INFO L93 Difference]: Finished difference Result 3370 states and 14873 transitions. [2022-12-14 10:26:58,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 10:26:58,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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 10:26:58,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:26:58,981 INFO L225 Difference]: With dead ends: 3370 [2022-12-14 10:26:58,981 INFO L226 Difference]: Without dead ends: 3370 [2022-12-14 10:26:58,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 10:26:58,982 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 61 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 6 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 10:26:58,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 6 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:26:58,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3370 states. [2022-12-14 10:26:59,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3370 to 3370. [2022-12-14 10:26:59,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3370 states, 3077 states have (on average 4.8336041598960025) internal successors, (14873), 3369 states have internal predecessors, (14873), 0 states have call successors, (0), 0 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 10:26:59,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3370 states to 3370 states and 14873 transitions. [2022-12-14 10:26:59,052 INFO L78 Accepts]: Start accepts. Automaton has 3370 states and 14873 transitions. Word has length 9 [2022-12-14 10:26:59,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:26:59,052 INFO L495 AbstractCegarLoop]: Abstraction has 3370 states and 14873 transitions. [2022-12-14 10:26:59,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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 10:26:59,053 INFO L276 IsEmpty]: Start isEmpty. Operand 3370 states and 14873 transitions. [2022-12-14 10:26:59,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 10:26:59,053 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:26:59,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:26:59,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-14 10:26:59,053 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:26:59,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:26:59,054 INFO L85 PathProgramCache]: Analyzing trace with hash 397899182, now seen corresponding path program 1 times [2022-12-14 10:26:59,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:26:59,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544818877] [2022-12-14 10:26:59,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:59,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:26:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:59,114 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 10:26:59,114 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:26:59,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544818877] [2022-12-14 10:26:59,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544818877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:26:59,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:26:59,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 10:26:59,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510490916] [2022-12-14 10:26:59,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:26:59,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 10:26:59,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:26:59,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 10:26:59,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:26:59,116 INFO L87 Difference]: Start difference. First operand 3370 states and 14873 transitions. Second operand has 5 states, 4 states have (on average 2.25) 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 10:26:59,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:26:59,314 INFO L93 Difference]: Finished difference Result 3300 states and 14574 transitions. [2022-12-14 10:26:59,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 10:26:59,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) 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 10:26:59,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:26:59,323 INFO L225 Difference]: With dead ends: 3300 [2022-12-14 10:26:59,323 INFO L226 Difference]: Without dead ends: 3223 [2022-12-14 10:26:59,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 10:26:59,324 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 56 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:26:59,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 14 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:26:59,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3223 states. [2022-12-14 10:26:59,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3223 to 3223. [2022-12-14 10:26:59,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3223 states, 2930 states have (on average 4.9160409556313995) internal successors, (14404), 3222 states have internal predecessors, (14404), 0 states have call successors, (0), 0 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 10:26:59,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3223 states to 3223 states and 14404 transitions. [2022-12-14 10:26:59,380 INFO L78 Accepts]: Start accepts. Automaton has 3223 states and 14404 transitions. Word has length 9 [2022-12-14 10:26:59,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:26:59,380 INFO L495 AbstractCegarLoop]: Abstraction has 3223 states and 14404 transitions. [2022-12-14 10:26:59,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) 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 10:26:59,381 INFO L276 IsEmpty]: Start isEmpty. Operand 3223 states and 14404 transitions. [2022-12-14 10:26:59,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 10:26:59,381 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:26:59,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:26:59,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-14 10:26:59,381 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:26:59,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:26:59,381 INFO L85 PathProgramCache]: Analyzing trace with hash -118518417, now seen corresponding path program 1 times [2022-12-14 10:26:59,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:26:59,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756884902] [2022-12-14 10:26:59,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:59,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:26:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:59,572 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 10:26:59,572 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:26:59,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756884902] [2022-12-14 10:26:59,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756884902] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:26:59,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037530237] [2022-12-14 10:26:59,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:26:59,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:26:59,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:26:59,573 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:26:59,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 10:26:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:26:59,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-14 10:26:59,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:26:59,733 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 11 treesize of output 7 [2022-12-14 10:26:59,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:26:59,762 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 10:26:59,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:26:59,819 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 10:26:59,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:26:59,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 10:26:59,857 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 10:26:59,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:26:59,955 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_746 (Array Int Int)) (v_ArrVal_745 (Array Int Int)) (v_ArrVal_747 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_745) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_746) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_747) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 9223372039002259456))) is different from false [2022-12-14 10:26:59,963 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:26:59,963 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 30 treesize of output 31 [2022-12-14 10:26:59,972 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:26:59,972 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 2211 treesize of output 2149 [2022-12-14 10:26:59,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2134 treesize of output 2070 [2022-12-14 10:27:00,003 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 1035 treesize of output 1003 [2022-12-14 10:27:00,016 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 2038 treesize of output 1910 [2022-12-14 10:27:01,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 10:27:01,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037530237] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:27:01,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2142660854] [2022-12-14 10:27:01,082 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 10:27:01,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:27:01,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-14 10:27:01,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895777707] [2022-12-14 10:27:01,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:27:01,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 10:27:01,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:27:01,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 10:27:01,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=229, Unknown=14, NotChecked=32, Total=342 [2022-12-14 10:27:01,083 INFO L87 Difference]: Start difference. First operand 3223 states and 14404 transitions. Second operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 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 10:27:01,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:27:01,476 INFO L93 Difference]: Finished difference Result 4118 states and 17735 transitions. [2022-12-14 10:27:01,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 10:27:01,476 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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 10:27:01,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:27:01,486 INFO L225 Difference]: With dead ends: 4118 [2022-12-14 10:27:01,486 INFO L226 Difference]: Without dead ends: 4118 [2022-12-14 10:27:01,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=308, Unknown=14, NotChecked=38, Total=462 [2022-12-14 10:27:01,487 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 241 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:27:01,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 30 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 382 Invalid, 0 Unknown, 49 Unchecked, 0.3s Time] [2022-12-14 10:27:01,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4118 states. [2022-12-14 10:27:01,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4118 to 3355. [2022-12-14 10:27:01,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3355 states, 3062 states have (on average 4.941214892227302) internal successors, (15130), 3354 states have internal predecessors, (15130), 0 states have call successors, (0), 0 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 10:27:01,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3355 states to 3355 states and 15130 transitions. [2022-12-14 10:27:01,543 INFO L78 Accepts]: Start accepts. Automaton has 3355 states and 15130 transitions. Word has length 9 [2022-12-14 10:27:01,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:27:01,544 INFO L495 AbstractCegarLoop]: Abstraction has 3355 states and 15130 transitions. [2022-12-14 10:27:01,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 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 10:27:01,544 INFO L276 IsEmpty]: Start isEmpty. Operand 3355 states and 15130 transitions. [2022-12-14 10:27:01,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 10:27:01,544 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:27:01,544 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:27:01,549 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-14 10:27:01,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-14 10:27:01,746 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:27:01,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:27:01,747 INFO L85 PathProgramCache]: Analyzing trace with hash -118518416, now seen corresponding path program 1 times [2022-12-14 10:27:01,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:27:01,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092196186] [2022-12-14 10:27:01,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:01,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:27:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:01,980 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 10:27:01,980 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:27:01,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092196186] [2022-12-14 10:27:01,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092196186] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:27:01,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905274147] [2022-12-14 10:27:01,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:01,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:01,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:27:01,981 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:27:01,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 10:27:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:02,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-14 10:27:02,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:27:02,161 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 11 treesize of output 7 [2022-12-14 10:27:02,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:02,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 10:27:02,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:02,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 10:27:02,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:02,272 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 14 treesize of output 16 [2022-12-14 10:27:02,282 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 10:27:02,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:27:02,299 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_796 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_796) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset)) 4294967296)) is different from false [2022-12-14 10:27:02,384 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:02,384 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 28 treesize of output 29 [2022-12-14 10:27:02,392 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:02,393 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 977 treesize of output 947 [2022-12-14 10:27:02,402 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 934 treesize of output 918 [2022-12-14 10:27:02,410 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 918 treesize of output 886 [2022-12-14 10:27:02,418 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 886 treesize of output 822 [2022-12-14 10:27:04,358 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 10:27:04,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905274147] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:27:04,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [503663098] [2022-12-14 10:27:04,359 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 10:27:04,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:27:04,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-14 10:27:04,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801042336] [2022-12-14 10:27:04,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:27:04,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 10:27:04,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:27:04,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 10:27:04,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=236, Unknown=9, NotChecked=32, Total=342 [2022-12-14 10:27:04,360 INFO L87 Difference]: Start difference. First operand 3355 states and 15130 transitions. Second operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 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 10:27:04,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:27:04,844 INFO L93 Difference]: Finished difference Result 3848 states and 16435 transitions. [2022-12-14 10:27:04,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 10:27:04,845 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 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 10:27:04,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:27:04,854 INFO L225 Difference]: With dead ends: 3848 [2022-12-14 10:27:04,854 INFO L226 Difference]: Without dead ends: 3844 [2022-12-14 10:27:04,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=314, Unknown=9, NotChecked=38, Total=462 [2022-12-14 10:27:04,855 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 196 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:27:04,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 30 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 379 Invalid, 0 Unknown, 87 Unchecked, 0.3s Time] [2022-12-14 10:27:04,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3844 states. [2022-12-14 10:27:04,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3844 to 3282. [2022-12-14 10:27:04,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3282 states, 2989 states have (on average 4.823686851789896) internal successors, (14418), 3281 states have internal predecessors, (14418), 0 states have call successors, (0), 0 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 10:27:04,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3282 states to 3282 states and 14418 transitions. [2022-12-14 10:27:04,908 INFO L78 Accepts]: Start accepts. Automaton has 3282 states and 14418 transitions. Word has length 9 [2022-12-14 10:27:04,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:27:04,908 INFO L495 AbstractCegarLoop]: Abstraction has 3282 states and 14418 transitions. [2022-12-14 10:27:04,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 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 10:27:04,908 INFO L276 IsEmpty]: Start isEmpty. Operand 3282 states and 14418 transitions. [2022-12-14 10:27:04,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 10:27:04,909 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:27:04,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:27:04,913 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-14 10:27:05,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-14 10:27:05,110 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:27:05,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:27:05,111 INFO L85 PathProgramCache]: Analyzing trace with hash 87145467, now seen corresponding path program 1 times [2022-12-14 10:27:05,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:27:05,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061647805] [2022-12-14 10:27:05,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:05,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:27:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:05,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 10:27:05,198 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:27:05,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061647805] [2022-12-14 10:27:05,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061647805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:27:05,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:27:05,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:27:05,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647672295] [2022-12-14 10:27:05,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:27:05,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:27:05,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:27:05,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:27:05,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:27:05,200 INFO L87 Difference]: Start difference. First operand 3282 states and 14418 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 10:27:05,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:27:05,252 INFO L93 Difference]: Finished difference Result 2738 states and 11921 transitions. [2022-12-14 10:27:05,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:27:05,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 10:27:05,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:27:05,260 INFO L225 Difference]: With dead ends: 2738 [2022-12-14 10:27:05,260 INFO L226 Difference]: Without dead ends: 2738 [2022-12-14 10:27:05,260 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 10:27:05,260 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:27:05,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:27:05,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2738 states. [2022-12-14 10:27:05,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2738 to 2738. [2022-12-14 10:27:05,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2738 states, 2529 states have (on average 4.713720838275998) internal successors, (11921), 2737 states have internal predecessors, (11921), 0 states have call successors, (0), 0 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 10:27:05,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 11921 transitions. [2022-12-14 10:27:05,304 INFO L78 Accepts]: Start accepts. Automaton has 2738 states and 11921 transitions. Word has length 9 [2022-12-14 10:27:05,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:27:05,304 INFO L495 AbstractCegarLoop]: Abstraction has 2738 states and 11921 transitions. [2022-12-14 10:27:05,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 10:27:05,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 11921 transitions. [2022-12-14 10:27:05,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 10:27:05,304 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:27:05,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:27:05,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-14 10:27:05,305 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:27:05,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:27:05,305 INFO L85 PathProgramCache]: Analyzing trace with hash 87145468, now seen corresponding path program 1 times [2022-12-14 10:27:05,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:27:05,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112629027] [2022-12-14 10:27:05,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:05,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:27:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:05,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 10:27:05,349 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:27:05,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112629027] [2022-12-14 10:27:05,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112629027] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:27:05,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:27:05,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:27:05,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131954609] [2022-12-14 10:27:05,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:27:05,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:27:05,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:27:05,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:27:05,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:27:05,350 INFO L87 Difference]: Start difference. First operand 2738 states and 11921 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 10:27:05,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:27:05,399 INFO L93 Difference]: Finished difference Result 2254 states and 9728 transitions. [2022-12-14 10:27:05,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:27:05,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 10:27:05,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:27:05,405 INFO L225 Difference]: With dead ends: 2254 [2022-12-14 10:27:05,405 INFO L226 Difference]: Without dead ends: 2254 [2022-12-14 10:27:05,406 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 10:27:05,406 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:27:05,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:27:05,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2022-12-14 10:27:05,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 1734. [2022-12-14 10:27:05,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1595 states have (on average 4.529153605015674) internal successors, (7224), 1733 states have internal predecessors, (7224), 0 states have call successors, (0), 0 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 10:27:05,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 7224 transitions. [2022-12-14 10:27:05,435 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 7224 transitions. Word has length 9 [2022-12-14 10:27:05,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:27:05,435 INFO L495 AbstractCegarLoop]: Abstraction has 1734 states and 7224 transitions. [2022-12-14 10:27:05,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 10:27:05,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 7224 transitions. [2022-12-14 10:27:05,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 10:27:05,435 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:27:05,435 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:27:05,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-14 10:27:05,435 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:27:05,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:27:05,436 INFO L85 PathProgramCache]: Analyzing trace with hash 87145586, now seen corresponding path program 1 times [2022-12-14 10:27:05,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:27:05,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525629515] [2022-12-14 10:27:05,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:05,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:27:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:05,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 10:27:05,465 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:27:05,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525629515] [2022-12-14 10:27:05,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525629515] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:27:05,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:27:05,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:27:05,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415592124] [2022-12-14 10:27:05,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:27:05,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:27:05,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:27:05,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:27:05,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:27:05,467 INFO L87 Difference]: Start difference. First operand 1734 states and 7224 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 10:27:05,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:27:05,546 INFO L93 Difference]: Finished difference Result 1522 states and 6403 transitions. [2022-12-14 10:27:05,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:27:05,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 10:27:05,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:27:05,551 INFO L225 Difference]: With dead ends: 1522 [2022-12-14 10:27:05,551 INFO L226 Difference]: Without dead ends: 1522 [2022-12-14 10:27:05,551 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 10:27:05,551 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 26 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:27:05,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 7 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:27:05,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2022-12-14 10:27:05,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1522. [2022-12-14 10:27:05,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1522 states, 1411 states have (on average 4.5379163713678246) internal successors, (6403), 1521 states have internal predecessors, (6403), 0 states have call successors, (0), 0 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 10:27:05,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 6403 transitions. [2022-12-14 10:27:05,572 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 6403 transitions. Word has length 9 [2022-12-14 10:27:05,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:27:05,572 INFO L495 AbstractCegarLoop]: Abstraction has 1522 states and 6403 transitions. [2022-12-14 10:27:05,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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 10:27:05,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 6403 transitions. [2022-12-14 10:27:05,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 10:27:05,572 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:27:05,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:27:05,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-14 10:27:05,573 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:27:05,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:27:05,573 INFO L85 PathProgramCache]: Analyzing trace with hash 87145464, now seen corresponding path program 1 times [2022-12-14 10:27:05,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:27:05,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655250999] [2022-12-14 10:27:05,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:05,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:27:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:05,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:05,668 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:27:05,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655250999] [2022-12-14 10:27:05,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655250999] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:27:05,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943360073] [2022-12-14 10:27:05,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:05,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:05,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:27:05,670 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:27:05,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 10:27:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:05,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 10:27:05,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:27:05,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:05,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:27:05,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:05,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943360073] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:27:05,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [202970231] [2022-12-14 10:27:05,925 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 10:27:05,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:27:05,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-14 10:27:05,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683829261] [2022-12-14 10:27:05,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:27:05,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 10:27:05,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:27:05,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 10:27:05,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-12-14 10:27:05,927 INFO L87 Difference]: Start difference. First operand 1522 states and 6403 transitions. Second operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 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 10:27:06,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:27:06,279 INFO L93 Difference]: Finished difference Result 1596 states and 6323 transitions. [2022-12-14 10:27:06,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 10:27:06,280 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 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 9 [2022-12-14 10:27:06,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:27:06,283 INFO L225 Difference]: With dead ends: 1596 [2022-12-14 10:27:06,283 INFO L226 Difference]: Without dead ends: 1586 [2022-12-14 10:27:06,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2022-12-14 10:27:06,284 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 183 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:27:06,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 38 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 10:27:06,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2022-12-14 10:27:06,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1494. [2022-12-14 10:27:06,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1494 states, 1383 states have (on average 4.434562545191612) internal successors, (6133), 1493 states have internal predecessors, (6133), 0 states have call successors, (0), 0 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 10:27:06,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 6133 transitions. [2022-12-14 10:27:06,305 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 6133 transitions. Word has length 9 [2022-12-14 10:27:06,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:27:06,306 INFO L495 AbstractCegarLoop]: Abstraction has 1494 states and 6133 transitions. [2022-12-14 10:27:06,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 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 10:27:06,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 6133 transitions. [2022-12-14 10:27:06,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 10:27:06,306 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:27:06,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:27:06,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 10:27:06,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:06,507 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:27:06,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:27:06,508 INFO L85 PathProgramCache]: Analyzing trace with hash 87145154, now seen corresponding path program 1 times [2022-12-14 10:27:06,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:27:06,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100445980] [2022-12-14 10:27:06,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:06,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:27:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:06,723 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 10:27:06,724 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:27:06,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100445980] [2022-12-14 10:27:06,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100445980] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:27:06,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302433744] [2022-12-14 10:27:06,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:06,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:06,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:27:06,725 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:27:06,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 10:27:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:06,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-14 10:27:06,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:27:06,875 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 11 treesize of output 7 [2022-12-14 10:27:06,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:06,900 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 10:27:06,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:06,929 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 10:27:06,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:06,971 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 10:27:06,983 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 10:27:06,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:27:06,997 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_945 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_945) c_~A~0.base) (+ (* |c_thread2Thread1of1ForFork2_~i~1#1| 4) c_~A~0.offset)) 9223372039002259456))) is different from false [2022-12-14 10:27:07,001 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_945 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_945) c_~A~0.base) c_~A~0.offset) 9223372039002259456))) is different from false [2022-12-14 10:27:09,105 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:09,105 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 30 treesize of output 31 [2022-12-14 10:27:09,112 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:09,112 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 279 treesize of output 273 [2022-12-14 10:27:09,117 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 258 treesize of output 250 [2022-12-14 10:27:09,121 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 250 treesize of output 234 [2022-12-14 10:27:09,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 114 [2022-12-14 10:27:09,264 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 10:27:09,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302433744] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:27:09,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1825452206] [2022-12-14 10:27:09,265 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 10:27:09,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:27:09,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-14 10:27:09,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572979662] [2022-12-14 10:27:09,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:27:09,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 10:27:09,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:27:09,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 10:27:09,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=246, Unknown=7, NotChecked=66, Total=380 [2022-12-14 10:27:09,266 INFO L87 Difference]: Start difference. First operand 1494 states and 6133 transitions. Second operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:27:09,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:27:09,694 INFO L93 Difference]: Finished difference Result 1823 states and 6866 transitions. [2022-12-14 10:27:09,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 10:27:09,695 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 10:27:09,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:27:09,699 INFO L225 Difference]: With dead ends: 1823 [2022-12-14 10:27:09,699 INFO L226 Difference]: Without dead ends: 1823 [2022-12-14 10:27:09,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=100, Invalid=321, Unknown=7, NotChecked=78, Total=506 [2022-12-14 10:27:09,699 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 143 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:27:09,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 33 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 389 Invalid, 0 Unknown, 147 Unchecked, 0.3s Time] [2022-12-14 10:27:09,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2022-12-14 10:27:09,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1452. [2022-12-14 10:27:09,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1452 states, 1341 states have (on average 4.328859060402684) internal successors, (5805), 1451 states have internal predecessors, (5805), 0 states have call successors, (0), 0 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 10:27:09,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 5805 transitions. [2022-12-14 10:27:09,721 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 5805 transitions. Word has length 9 [2022-12-14 10:27:09,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:27:09,721 INFO L495 AbstractCegarLoop]: Abstraction has 1452 states and 5805 transitions. [2022-12-14 10:27:09,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:27:09,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 5805 transitions. [2022-12-14 10:27:09,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 10:27:09,721 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:27:09,721 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:27:09,726 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-14 10:27:09,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-14 10:27:09,922 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:27:09,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:27:09,923 INFO L85 PathProgramCache]: Analyzing trace with hash 87145155, now seen corresponding path program 1 times [2022-12-14 10:27:09,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:27:09,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330528073] [2022-12-14 10:27:09,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:09,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:27:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:10,145 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 10:27:10,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:27:10,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330528073] [2022-12-14 10:27:10,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330528073] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:27:10,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577283773] [2022-12-14 10:27:10,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:10,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:10,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:27:10,147 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:27:10,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-14 10:27:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:10,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-14 10:27:10,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:27:10,267 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 18 treesize of output 16 [2022-12-14 10:27:10,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 10:27:10,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 14 treesize of output 16 [2022-12-14 10:27:10,302 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 14 treesize of output 16 [2022-12-14 10:27:10,324 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 14 treesize of output 16 [2022-12-14 10:27:10,337 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 10:27:10,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:27:10,450 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:10,450 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 28 treesize of output 29 [2022-12-14 10:27:10,457 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:10,458 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 245 treesize of output 239 [2022-12-14 10:27:10,465 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 113 treesize of output 105 [2022-12-14 10:27:10,470 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 218 treesize of output 202 [2022-12-14 10:27:10,475 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 202 treesize of output 198 [2022-12-14 10:27:10,590 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 10:27:10,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577283773] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:27:10,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [76076668] [2022-12-14 10:27:10,591 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 10:27:10,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:27:10,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-14 10:27:10,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455058384] [2022-12-14 10:27:10,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:27:10,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 10:27:10,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:27:10,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 10:27:10,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=180, Unknown=10, NotChecked=0, Total=240 [2022-12-14 10:27:10,593 INFO L87 Difference]: Start difference. First operand 1452 states and 5805 transitions. Second operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:27:10,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:27:10,943 INFO L93 Difference]: Finished difference Result 1646 states and 6126 transitions. [2022-12-14 10:27:10,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 10:27:10,944 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 10:27:10,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:27:10,947 INFO L225 Difference]: With dead ends: 1646 [2022-12-14 10:27:10,947 INFO L226 Difference]: Without dead ends: 1626 [2022-12-14 10:27:10,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=271, Unknown=11, NotChecked=0, Total=380 [2022-12-14 10:27:10,948 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 209 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 16 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:27:10,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 22 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 246 Invalid, 2 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 10:27:10,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1626 states. [2022-12-14 10:27:10,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1626 to 1390. [2022-12-14 10:27:10,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1279 states have (on average 4.236903831118061) internal successors, (5419), 1389 states have internal predecessors, (5419), 0 states have call successors, (0), 0 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 10:27:10,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 5419 transitions. [2022-12-14 10:27:10,967 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 5419 transitions. Word has length 9 [2022-12-14 10:27:10,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:27:10,967 INFO L495 AbstractCegarLoop]: Abstraction has 1390 states and 5419 transitions. [2022-12-14 10:27:10,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:27:10,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 5419 transitions. [2022-12-14 10:27:10,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 10:27:10,967 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:27:10,967 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:27:10,972 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-14 10:27:11,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:11,168 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:27:11,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:27:11,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1594708247, now seen corresponding path program 1 times [2022-12-14 10:27:11,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:27:11,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410286970] [2022-12-14 10:27:11,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:11,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:27:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:11,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:11,428 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:27:11,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410286970] [2022-12-14 10:27:11,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410286970] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:27:11,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020482277] [2022-12-14 10:27:11,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:11,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:11,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:27:11,430 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:27:11,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-14 10:27:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:11,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-14 10:27:11,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:27:11,606 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 10:27:11,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:11,636 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 10:27:11,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:11,684 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 10:27:11,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:11,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:27:11,740 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1045 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1045) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 4))))) is different from false [2022-12-14 10:27:11,744 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1045 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1045) c_~A~0.base) (+ c_~A~0.offset 4)) 9223372039002259456))) is different from false [2022-12-14 10:27:11,782 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:11,783 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 29 treesize of output 30 [2022-12-14 10:27:11,789 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:11,789 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 159 treesize of output 149 [2022-12-14 10:27:11,794 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 67 treesize of output 59 [2022-12-14 10:27:11,797 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 126 treesize of output 110 [2022-12-14 10:27:11,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:11,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020482277] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:27:11,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [495380931] [2022-12-14 10:27:11,886 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 10:27:11,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:27:11,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-12-14 10:27:11,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315873918] [2022-12-14 10:27:11,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:27:11,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 10:27:11,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:27:11,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 10:27:11,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=319, Unknown=6, NotChecked=74, Total=462 [2022-12-14 10:27:11,888 INFO L87 Difference]: Start difference. First operand 1390 states and 5419 transitions. Second operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:27:12,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:27:12,328 INFO L93 Difference]: Finished difference Result 1915 states and 6792 transitions. [2022-12-14 10:27:12,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 10:27:12,329 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 10:27:12,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:27:12,333 INFO L225 Difference]: With dead ends: 1915 [2022-12-14 10:27:12,333 INFO L226 Difference]: Without dead ends: 1915 [2022-12-14 10:27:12,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=451, Unknown=6, NotChecked=90, Total=650 [2022-12-14 10:27:12,334 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 181 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:27:12,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 61 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 565 Invalid, 0 Unknown, 206 Unchecked, 0.3s Time] [2022-12-14 10:27:12,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2022-12-14 10:27:12,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1406. [2022-12-14 10:27:12,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1295 states have (on average 4.258687258687258) internal successors, (5515), 1405 states have internal predecessors, (5515), 0 states have call successors, (0), 0 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 10:27:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 5515 transitions. [2022-12-14 10:27:12,362 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 5515 transitions. Word has length 9 [2022-12-14 10:27:12,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:27:12,362 INFO L495 AbstractCegarLoop]: Abstraction has 1406 states and 5515 transitions. [2022-12-14 10:27:12,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:27:12,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 5515 transitions. [2022-12-14 10:27:12,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 10:27:12,362 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:27:12,362 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:27:12,367 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-14 10:27:12,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:12,564 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:27:12,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:27:12,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1594708248, now seen corresponding path program 1 times [2022-12-14 10:27:12,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:27:12,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204622716] [2022-12-14 10:27:12,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:12,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:27:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:12,802 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:12,802 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:27:12,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204622716] [2022-12-14 10:27:12,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204622716] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:27:12,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588153617] [2022-12-14 10:27:12,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:12,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:12,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:27:12,803 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:27:12,804 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-14 10:27:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:12,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-14 10:27:12,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:27:12,959 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 10:27:12,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:12,986 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 10:27:13,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:13,032 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 10:27:13,065 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:13,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:27:13,160 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1093 (Array Int Int)) (v_ArrVal_1092 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1092) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1093) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-12-14 10:27:13,167 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:13,168 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 27 treesize of output 28 [2022-12-14 10:27:13,174 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:13,174 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 141 treesize of output 131 [2022-12-14 10:27:13,179 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 59 treesize of output 51 [2022-12-14 10:27:13,183 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 110 treesize of output 94 [2022-12-14 10:27:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 10:27:13,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588153617] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:27:13,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [648262616] [2022-12-14 10:27:13,305 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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 10:27:13,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:27:13,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-14 10:27:13,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214772726] [2022-12-14 10:27:13,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:27:13,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 10:27:13,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:27:13,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 10:27:13,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=391, Unknown=8, NotChecked=40, Total=506 [2022-12-14 10:27:13,307 INFO L87 Difference]: Start difference. First operand 1406 states and 5515 transitions. Second operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:27:14,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:27:14,195 INFO L93 Difference]: Finished difference Result 1907 states and 6760 transitions. [2022-12-14 10:27:14,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 10:27:14,196 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 10:27:14,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:27:14,200 INFO L225 Difference]: With dead ends: 1907 [2022-12-14 10:27:14,200 INFO L226 Difference]: Without dead ends: 1907 [2022-12-14 10:27:14,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=725, Unknown=9, NotChecked=56, Total=930 [2022-12-14 10:27:14,200 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 212 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 10:27:14,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 104 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 984 Invalid, 0 Unknown, 84 Unchecked, 0.5s Time] [2022-12-14 10:27:14,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1907 states. [2022-12-14 10:27:14,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1907 to 1406. [2022-12-14 10:27:14,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 1295 states have (on average 4.246332046332046) internal successors, (5499), 1405 states have internal predecessors, (5499), 0 states have call successors, (0), 0 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 10:27:14,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 5499 transitions. [2022-12-14 10:27:14,220 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 5499 transitions. Word has length 9 [2022-12-14 10:27:14,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:27:14,221 INFO L495 AbstractCegarLoop]: Abstraction has 1406 states and 5499 transitions. [2022-12-14 10:27:14,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:27:14,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 5499 transitions. [2022-12-14 10:27:14,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 10:27:14,221 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:27:14,221 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:27:14,226 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-14 10:27:14,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:14,422 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:27:14,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:27:14,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1594724060, now seen corresponding path program 1 times [2022-12-14 10:27:14,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:27:14,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769922544] [2022-12-14 10:27:14,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:14,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:27:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:14,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 10:27:14,545 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:27:14,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769922544] [2022-12-14 10:27:14,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769922544] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:27:14,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062985037] [2022-12-14 10:27:14,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:14,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:14,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:27:14,546 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:27:14,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-14 10:27:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:14,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 10:27:14,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:27:14,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 26 treesize of output 10 [2022-12-14 10:27:14,737 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-14 10:27:14,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 10:27:14,745 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:27:14,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062985037] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:27:14,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:27:14,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2022-12-14 10:27:14,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242152751] [2022-12-14 10:27:14,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:27:14,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:27:14,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:27:14,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:27:14,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:27:14,747 INFO L87 Difference]: Start difference. First operand 1406 states and 5499 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:27:14,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:27:14,795 INFO L93 Difference]: Finished difference Result 1208 states and 4779 transitions. [2022-12-14 10:27:14,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:27:14,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 10:27:14,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:27:14,798 INFO L225 Difference]: With dead ends: 1208 [2022-12-14 10:27:14,798 INFO L226 Difference]: Without dead ends: 1208 [2022-12-14 10:27:14,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 10:27:14,799 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 10:27:14,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 10:27:14,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2022-12-14 10:27:14,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1101. [2022-12-14 10:27:14,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 1022 states have (on average 3.8180039138943247) internal successors, (3902), 1100 states have internal predecessors, (3902), 0 states have call successors, (0), 0 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 10:27:14,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 3902 transitions. [2022-12-14 10:27:14,813 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 3902 transitions. Word has length 9 [2022-12-14 10:27:14,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:27:14,814 INFO L495 AbstractCegarLoop]: Abstraction has 1101 states and 3902 transitions. [2022-12-14 10:27:14,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:27:14,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 3902 transitions. [2022-12-14 10:27:14,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 10:27:14,814 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:27:14,814 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2022-12-14 10:27:14,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-14 10:27:15,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:15,015 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:27:15,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:27:15,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1594724584, now seen corresponding path program 3 times [2022-12-14 10:27:15,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:27:15,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240295017] [2022-12-14 10:27:15,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:15,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:27:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:15,113 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:15,113 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:27:15,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240295017] [2022-12-14 10:27:15,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240295017] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:27:15,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734367839] [2022-12-14 10:27:15,113 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 10:27:15,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:15,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:27:15,114 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:27:15,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-14 10:27:15,260 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 10:27:15,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:27:15,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 10:27:15,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:27:15,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:15,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:27:15,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:15,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734367839] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:27:15,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [838135117] [2022-12-14 10:27:15,363 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 10:27:15,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:27:15,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-12-14 10:27:15,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999575556] [2022-12-14 10:27:15,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:27:15,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 10:27:15,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:27:15,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 10:27:15,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2022-12-14 10:27:15,365 INFO L87 Difference]: Start difference. First operand 1101 states and 3902 transitions. Second operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 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 10:27:15,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:27:15,803 INFO L93 Difference]: Finished difference Result 2175 states and 7371 transitions. [2022-12-14 10:27:15,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 10:27:15,803 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 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 9 [2022-12-14 10:27:15,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:27:15,808 INFO L225 Difference]: With dead ends: 2175 [2022-12-14 10:27:15,808 INFO L226 Difference]: Without dead ends: 2173 [2022-12-14 10:27:15,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=261, Invalid=609, Unknown=0, NotChecked=0, Total=870 [2022-12-14 10:27:15,809 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 554 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:27:15,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 78 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 10:27:15,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2173 states. [2022-12-14 10:27:15,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 1567. [2022-12-14 10:27:15,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1488 states have (on average 3.975806451612903) internal successors, (5916), 1566 states have internal predecessors, (5916), 0 states have call successors, (0), 0 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 10:27:15,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 5916 transitions. [2022-12-14 10:27:15,837 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 5916 transitions. Word has length 9 [2022-12-14 10:27:15,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:27:15,837 INFO L495 AbstractCegarLoop]: Abstraction has 1567 states and 5916 transitions. [2022-12-14 10:27:15,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 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 10:27:15,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 5916 transitions. [2022-12-14 10:27:15,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 10:27:15,837 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:27:15,838 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:27:15,842 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-14 10:27:16,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-12-14 10:27:16,038 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:27:16,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:27:16,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1587402686, now seen corresponding path program 1 times [2022-12-14 10:27:16,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:27:16,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033352625] [2022-12-14 10:27:16,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:16,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:27:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:16,321 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 10:27:16,322 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:27:16,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033352625] [2022-12-14 10:27:16,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033352625] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:27:16,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051780250] [2022-12-14 10:27:16,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:16,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:16,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:27:16,323 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:27:16,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-14 10:27:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:16,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 10:27:16,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:27:16,500 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 11 treesize of output 7 [2022-12-14 10:27:16,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:16,545 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 10:27:16,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:16,593 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 10:27:16,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:16,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 10:27:16,679 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 10:27:16,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:27:16,879 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:16,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-12-14 10:27:16,890 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:16,890 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 173 treesize of output 169 [2022-12-14 10:27:16,895 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 152 treesize of output 128 [2022-12-14 10:27:16,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2022-12-14 10:27:16,908 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 122 treesize of output 110 [2022-12-14 10:27:17,034 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 10:27:17,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051780250] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:27:17,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [94658678] [2022-12-14 10:27:17,035 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 10:27:17,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:27:17,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-14 10:27:17,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859600968] [2022-12-14 10:27:17,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:27:17,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 10:27:17,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:27:17,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 10:27:17,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=305, Unknown=3, NotChecked=0, Total=380 [2022-12-14 10:27:17,037 INFO L87 Difference]: Start difference. First operand 1567 states and 5916 transitions. Second operand has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 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 10:27:19,422 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 10:27:21,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:27:23,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:27:24,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:27:24,222 INFO L93 Difference]: Finished difference Result 1861 states and 6835 transitions. [2022-12-14 10:27:24,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 10:27:24,223 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 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 10:27:24,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:27:24,227 INFO L225 Difference]: With dead ends: 1861 [2022-12-14 10:27:24,227 INFO L226 Difference]: Without dead ends: 1861 [2022-12-14 10:27:24,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=497, Unknown=14, NotChecked=0, Total=650 [2022-12-14 10:27:24,228 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 158 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 20 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-12-14 10:27:24,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 62 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 696 Invalid, 27 Unknown, 0 Unchecked, 6.9s Time] [2022-12-14 10:27:24,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2022-12-14 10:27:24,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1667. [2022-12-14 10:27:24,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1588 states have (on average 4.078715365239295) internal successors, (6477), 1666 states have internal predecessors, (6477), 0 states have call successors, (0), 0 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 10:27:24,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 6477 transitions. [2022-12-14 10:27:24,261 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 6477 transitions. Word has length 10 [2022-12-14 10:27:24,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:27:24,261 INFO L495 AbstractCegarLoop]: Abstraction has 1667 states and 6477 transitions. [2022-12-14 10:27:24,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 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 10:27:24,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 6477 transitions. [2022-12-14 10:27:24,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 10:27:24,262 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:27:24,262 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:27:24,266 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-14 10:27:24,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-14 10:27:24,463 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:27:24,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:27:24,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1587402685, now seen corresponding path program 1 times [2022-12-14 10:27:24,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:27:24,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41716780] [2022-12-14 10:27:24,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:24,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:27:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:24,718 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 10:27:24,719 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:27:24,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41716780] [2022-12-14 10:27:24,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41716780] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:27:24,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541496321] [2022-12-14 10:27:24,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:24,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:24,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:27:24,720 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:27:24,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-14 10:27:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:24,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 10:27:24,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:27:24,911 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 11 treesize of output 7 [2022-12-14 10:27:24,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:24,956 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 14 treesize of output 16 [2022-12-14 10:27:24,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:24,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 10:27:25,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:25,035 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 14 treesize of output 16 [2022-12-14 10:27:25,084 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 10:27:25,084 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:27:25,271 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:25,271 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 32 treesize of output 33 [2022-12-14 10:27:25,281 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:25,281 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 309 treesize of output 297 [2022-12-14 10:27:25,288 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 141 treesize of output 117 [2022-12-14 10:27:25,295 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 258 treesize of output 210 [2022-12-14 10:27:25,302 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 210 treesize of output 198 [2022-12-14 10:27:25,523 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 10:27:25,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541496321] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:27:25,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [966348084] [2022-12-14 10:27:25,524 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 10:27:25,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:27:25,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-14 10:27:25,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781045323] [2022-12-14 10:27:25,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:27:25,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 10:27:25,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:27:25,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 10:27:25,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=305, Unknown=3, NotChecked=0, Total=380 [2022-12-14 10:27:25,526 INFO L87 Difference]: Start difference. First operand 1667 states and 6477 transitions. Second operand has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 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 10:27:27,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:27:29,905 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 10:27:30,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:27:30,562 INFO L93 Difference]: Finished difference Result 1801 states and 6521 transitions. [2022-12-14 10:27:30,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 10:27:30,562 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 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 10:27:30,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:27:30,566 INFO L225 Difference]: With dead ends: 1801 [2022-12-14 10:27:30,566 INFO L226 Difference]: Without dead ends: 1676 [2022-12-14 10:27:30,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=394, Unknown=3, NotChecked=0, Total=506 [2022-12-14 10:27:30,566 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 181 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 19 mSolverCounterUnsat, 39 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 39 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-12-14 10:27:30,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 68 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 673 Invalid, 39 Unknown, 0 Unchecked, 4.9s Time] [2022-12-14 10:27:30,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2022-12-14 10:27:30,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1508. [2022-12-14 10:27:30,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1429 states have (on average 4.0846745976207135) internal successors, (5837), 1507 states have internal predecessors, (5837), 0 states have call successors, (0), 0 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 10:27:30,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 5837 transitions. [2022-12-14 10:27:30,587 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 5837 transitions. Word has length 10 [2022-12-14 10:27:30,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:27:30,587 INFO L495 AbstractCegarLoop]: Abstraction has 1508 states and 5837 transitions. [2022-12-14 10:27:30,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 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 10:27:30,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 5837 transitions. [2022-12-14 10:27:30,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 10:27:30,587 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:27:30,587 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:27:30,592 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-14 10:27:30,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:30,788 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:27:30,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:27:30,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1898156404, now seen corresponding path program 2 times [2022-12-14 10:27:30,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:27:30,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509575179] [2022-12-14 10:27:30,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:30,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:27:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:31,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:31,035 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:27:31,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509575179] [2022-12-14 10:27:31,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509575179] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:27:31,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237454456] [2022-12-14 10:27:31,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:27:31,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:31,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:27:31,036 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:27:31,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-14 10:27:31,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 10:27:31,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:27:31,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-14 10:27:31,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:27:31,212 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 10:27:31,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:31,234 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 10:27:31,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:31,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 10:27:31,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:31,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:27:31,409 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:31,410 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 29 treesize of output 30 [2022-12-14 10:27:31,416 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:31,416 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 159 treesize of output 149 [2022-12-14 10:27:31,421 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 67 treesize of output 59 [2022-12-14 10:27:31,424 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 126 treesize of output 110 [2022-12-14 10:27:31,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:31,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237454456] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:27:31,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [955480925] [2022-12-14 10:27:31,500 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 10:27:31,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:27:31,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-14 10:27:31,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292852656] [2022-12-14 10:27:31,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:27:31,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 10:27:31,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:27:31,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 10:27:31,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=422, Unknown=11, NotChecked=0, Total=506 [2022-12-14 10:27:31,502 INFO L87 Difference]: Start difference. First operand 1508 states and 5837 transitions. Second operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 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 10:27:32,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:27:32,220 INFO L93 Difference]: Finished difference Result 1954 states and 7113 transitions. [2022-12-14 10:27:32,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 10:27:32,221 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 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 10:27:32,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:27:32,225 INFO L225 Difference]: With dead ends: 1954 [2022-12-14 10:27:32,225 INFO L226 Difference]: Without dead ends: 1954 [2022-12-14 10:27:32,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=754, Unknown=12, NotChecked=0, Total=930 [2022-12-14 10:27:32,225 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 182 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 10:27:32,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 89 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 10:27:32,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2022-12-14 10:27:32,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1522. [2022-12-14 10:27:32,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1522 states, 1443 states have (on average 4.095634095634096) internal successors, (5910), 1521 states have internal predecessors, (5910), 0 states have call successors, (0), 0 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 10:27:32,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 5910 transitions. [2022-12-14 10:27:32,248 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 5910 transitions. Word has length 10 [2022-12-14 10:27:32,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:27:32,248 INFO L495 AbstractCegarLoop]: Abstraction has 1522 states and 5910 transitions. [2022-12-14 10:27:32,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 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 10:27:32,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 5910 transitions. [2022-12-14 10:27:32,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 10:27:32,249 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:27:32,249 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:27:32,253 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-14 10:27:32,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-14 10:27:32,450 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:27:32,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:27:32,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1898156403, now seen corresponding path program 1 times [2022-12-14 10:27:32,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:27:32,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262454304] [2022-12-14 10:27:32,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:32,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:27:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:32,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:32,691 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:27:32,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262454304] [2022-12-14 10:27:32,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262454304] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:27:32,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460869939] [2022-12-14 10:27:32,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:32,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:32,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:27:32,692 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:27:32,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-14 10:27:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:32,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-14 10:27:32,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:27:32,882 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 10:27:32,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:32,912 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 10:27:32,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:32,939 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 10:27:32,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:32,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:27:33,014 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1371 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1371) c_~A~0.base) (+ c_~A~0.offset 4)) 4294967296)) is different from false [2022-12-14 10:27:33,059 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:33,059 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 27 treesize of output 28 [2022-12-14 10:27:33,066 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:33,066 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 141 treesize of output 131 [2022-12-14 10:27:33,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 102 [2022-12-14 10:27:33,074 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 55 treesize of output 47 [2022-12-14 10:27:33,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:33,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460869939] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:27:33,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1414199503] [2022-12-14 10:27:33,164 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 10:27:33,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:27:33,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-12-14 10:27:33,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795319665] [2022-12-14 10:27:33,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:27:33,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 10:27:33,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:27:33,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 10:27:33,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=320, Unknown=2, NotChecked=36, Total=420 [2022-12-14 10:27:33,165 INFO L87 Difference]: Start difference. First operand 1522 states and 5910 transitions. Second operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 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 10:27:33,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:27:33,563 INFO L93 Difference]: Finished difference Result 1940 states and 7068 transitions. [2022-12-14 10:27:33,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 10:27:33,564 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 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 10:27:33,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:27:33,568 INFO L225 Difference]: With dead ends: 1940 [2022-12-14 10:27:33,568 INFO L226 Difference]: Without dead ends: 1940 [2022-12-14 10:27:33,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=446, Unknown=2, NotChecked=44, Total=600 [2022-12-14 10:27:33,568 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 95 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:27:33,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 61 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 569 Invalid, 0 Unknown, 76 Unchecked, 0.3s Time] [2022-12-14 10:27:33,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2022-12-14 10:27:33,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1522. [2022-12-14 10:27:33,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1522 states, 1443 states have (on average 4.085932085932086) internal successors, (5896), 1521 states have internal predecessors, (5896), 0 states have call successors, (0), 0 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 10:27:33,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 5896 transitions. [2022-12-14 10:27:33,589 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 5896 transitions. Word has length 10 [2022-12-14 10:27:33,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:27:33,589 INFO L495 AbstractCegarLoop]: Abstraction has 1522 states and 5896 transitions. [2022-12-14 10:27:33,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 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 10:27:33,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 5896 transitions. [2022-12-14 10:27:33,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 10:27:33,590 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:27:33,590 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2022-12-14 10:27:33,595 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-14 10:27:33,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-14 10:27:33,791 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:27:33,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:27:33,792 INFO L85 PathProgramCache]: Analyzing trace with hash -390577284, now seen corresponding path program 4 times [2022-12-14 10:27:33,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:27:33,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867549457] [2022-12-14 10:27:33,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:33,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:27:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:34,045 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:34,046 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:27:34,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867549457] [2022-12-14 10:27:34,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867549457] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:27:34,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139611316] [2022-12-14 10:27:34,046 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 10:27:34,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:34,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:27:34,047 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:27:34,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-14 10:27:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:34,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-14 10:27:34,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:27:34,268 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 10:27:34,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:34,292 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 10:27:34,340 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:34,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:27:34,436 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:34,436 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 26 treesize of output 27 [2022-12-14 10:27:34,442 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:34,442 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 43 treesize of output 39 [2022-12-14 10:27:34,452 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 10:27:34,501 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:34,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139611316] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:27:34,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1495563613] [2022-12-14 10:27:34,501 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 10:27:34,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:27:34,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-12-14 10:27:34,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430081476] [2022-12-14 10:27:34,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:27:34,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 10:27:34,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:27:34,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 10:27:34,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=480, Unknown=1, NotChecked=0, Total=552 [2022-12-14 10:27:34,503 INFO L87 Difference]: Start difference. First operand 1522 states and 5896 transitions. Second operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 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 10:27:35,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:27:35,010 INFO L93 Difference]: Finished difference Result 1995 states and 6962 transitions. [2022-12-14 10:27:35,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 10:27:35,010 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 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 10:27:35,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:27:35,015 INFO L225 Difference]: With dead ends: 1995 [2022-12-14 10:27:35,015 INFO L226 Difference]: Without dead ends: 1995 [2022-12-14 10:27:35,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=790, Unknown=1, NotChecked=0, Total=930 [2022-12-14 10:27:35,016 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 159 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 10:27:35,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 78 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 10:27:35,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2022-12-14 10:27:35,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1523. [2022-12-14 10:27:35,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1523 states, 1444 states have (on average 4.085872576177286) internal successors, (5900), 1522 states have internal predecessors, (5900), 0 states have call successors, (0), 0 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 10:27:35,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 5900 transitions. [2022-12-14 10:27:35,048 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 5900 transitions. Word has length 10 [2022-12-14 10:27:35,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:27:35,048 INFO L495 AbstractCegarLoop]: Abstraction has 1523 states and 5900 transitions. [2022-12-14 10:27:35,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 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 10:27:35,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 5900 transitions. [2022-12-14 10:27:35,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 10:27:35,049 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:27:35,049 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2022-12-14 10:27:35,053 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-14 10:27:35,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:35,250 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:27:35,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:27:35,251 INFO L85 PathProgramCache]: Analyzing trace with hash -390577283, now seen corresponding path program 2 times [2022-12-14 10:27:35,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:27:35,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457470733] [2022-12-14 10:27:35,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:35,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:27:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:35,482 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:35,483 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:27:35,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457470733] [2022-12-14 10:27:35,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457470733] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:27:35,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489599591] [2022-12-14 10:27:35,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:27:35,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:35,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:27:35,484 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:27:35,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-14 10:27:35,689 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 10:27:35,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:27:35,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-14 10:27:35,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:27:35,745 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 15 treesize of output 11 [2022-12-14 10:27:35,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:35,782 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 10:27:35,900 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:35,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:27:36,063 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:36,063 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 26 treesize of output 27 [2022-12-14 10:27:36,072 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:36,072 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 41 treesize of output 37 [2022-12-14 10:27:36,076 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 13 treesize of output 7 [2022-12-14 10:27:36,273 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:36,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489599591] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:27:36,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2028683696] [2022-12-14 10:27:36,273 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 10:27:36,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:27:36,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-14 10:27:36,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341220787] [2022-12-14 10:27:36,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:27:36,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 10:27:36,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:27:36,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 10:27:36,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2022-12-14 10:27:36,275 INFO L87 Difference]: Start difference. First operand 1523 states and 5900 transitions. Second operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 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 10:27:40,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:27:40,360 INFO L93 Difference]: Finished difference Result 2717 states and 9020 transitions. [2022-12-14 10:27:40,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-12-14 10:27:40,361 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 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 10:27:40,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:27:40,366 INFO L225 Difference]: With dead ends: 2717 [2022-12-14 10:27:40,366 INFO L226 Difference]: Without dead ends: 2717 [2022-12-14 10:27:40,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=676, Invalid=3746, Unknown=0, NotChecked=0, Total=4422 [2022-12-14 10:27:40,369 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 454 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 1769 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-14 10:27:40,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 155 Invalid, 1812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1769 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-12-14 10:27:40,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2717 states. [2022-12-14 10:27:40,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2717 to 1564. [2022-12-14 10:27:40,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1485 states have (on average 4.115151515151515) internal successors, (6111), 1563 states have internal predecessors, (6111), 0 states have call successors, (0), 0 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 10:27:40,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 6111 transitions. [2022-12-14 10:27:40,406 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 6111 transitions. Word has length 10 [2022-12-14 10:27:40,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:27:40,406 INFO L495 AbstractCegarLoop]: Abstraction has 1564 states and 6111 transitions. [2022-12-14 10:27:40,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 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 10:27:40,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 6111 transitions. [2022-12-14 10:27:40,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 10:27:40,407 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:27:40,407 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:27:40,411 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-12-14 10:27:40,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-14 10:27:40,608 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:27:40,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:27:40,609 INFO L85 PathProgramCache]: Analyzing trace with hash -793914309, now seen corresponding path program 1 times [2022-12-14 10:27:40,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:27:40,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870583569] [2022-12-14 10:27:40,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:40,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:27:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:40,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:40,955 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:27:40,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870583569] [2022-12-14 10:27:40,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870583569] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:27:40,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707040073] [2022-12-14 10:27:40,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:40,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:40,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:27:40,957 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:27:40,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-14 10:27:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:41,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 10:27:41,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:27:41,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:41,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:41,144 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 18 treesize of output 16 [2022-12-14 10:27:41,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 10:27:41,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:41,222 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 10:27:41,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 18 treesize of output 20 [2022-12-14 10:27:41,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:41,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 10:27:41,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:41,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:27:41,361 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1521 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1521) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 4)) 9223372039002259456))) is different from false [2022-12-14 10:27:43,497 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:43,497 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 32 treesize of output 33 [2022-12-14 10:27:43,505 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:43,506 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 1235 treesize of output 1189 [2022-12-14 10:27:43,516 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 587 treesize of output 555 [2022-12-14 10:27:43,525 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 1142 treesize of output 1078 [2022-12-14 10:27:43,533 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 1078 treesize of output 950 [2022-12-14 10:27:43,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:43,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707040073] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:27:43,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1576839714] [2022-12-14 10:27:43,871 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 10:27:43,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:27:43,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-12-14 10:27:43,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208604302] [2022-12-14 10:27:43,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:27:43,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 10:27:43,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:27:43,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 10:27:43,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=463, Unknown=10, NotChecked=44, Total=600 [2022-12-14 10:27:43,872 INFO L87 Difference]: Start difference. First operand 1564 states and 6111 transitions. Second operand has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 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 10:27:44,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:27:44,432 INFO L93 Difference]: Finished difference Result 2293 states and 8431 transitions. [2022-12-14 10:27:44,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 10:27:44,432 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 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 10:27:44,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:27:44,437 INFO L225 Difference]: With dead ends: 2293 [2022-12-14 10:27:44,437 INFO L226 Difference]: Without dead ends: 2293 [2022-12-14 10:27:44,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=143, Invalid=663, Unknown=10, NotChecked=54, Total=870 [2022-12-14 10:27:44,437 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 227 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 10:27:44,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 63 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 652 Invalid, 0 Unknown, 106 Unchecked, 0.4s Time] [2022-12-14 10:27:44,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2293 states. [2022-12-14 10:27:44,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2293 to 1606. [2022-12-14 10:27:44,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1527 states have (on average 4.155861165684349) internal successors, (6346), 1605 states have internal predecessors, (6346), 0 states have call successors, (0), 0 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 10:27:44,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 6346 transitions. [2022-12-14 10:27:44,461 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 6346 transitions. Word has length 11 [2022-12-14 10:27:44,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:27:44,462 INFO L495 AbstractCegarLoop]: Abstraction has 1606 states and 6346 transitions. [2022-12-14 10:27:44,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 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 10:27:44,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 6346 transitions. [2022-12-14 10:27:44,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 10:27:44,462 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:27:44,462 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:27:44,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-14 10:27:44,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-12-14 10:27:44,663 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:27:44,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:27:44,664 INFO L85 PathProgramCache]: Analyzing trace with hash -793914308, now seen corresponding path program 1 times [2022-12-14 10:27:44,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:27:44,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331140441] [2022-12-14 10:27:44,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:44,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:27:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:44,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:44,974 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:27:44,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331140441] [2022-12-14 10:27:44,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331140441] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:27:44,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915879573] [2022-12-14 10:27:44,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:44,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:44,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:27:44,975 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:27:44,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-14 10:27:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:45,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-14 10:27:45,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:27:45,215 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 10:27:45,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:45,255 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 10:27:45,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:45,321 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 10:27:45,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:45,351 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 10:27:45,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:45,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:27:45,474 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1573 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1573) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1574) c_~A~0.base) (+ c_~A~0.offset 4)) 4294967296)) is different from false [2022-12-14 10:27:45,482 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1573 (Array Int Int)) (v_ArrVal_1572 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1572) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1573) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-12-14 10:27:45,489 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:45,489 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 30 treesize of output 31 [2022-12-14 10:27:45,496 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:45,496 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 139 treesize of output 135 [2022-12-14 10:27:45,501 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 62 treesize of output 58 [2022-12-14 10:27:45,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 110 [2022-12-14 10:27:45,507 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 110 treesize of output 94 [2022-12-14 10:27:45,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 10:27:45,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915879573] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:27:45,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [285151403] [2022-12-14 10:27:45,636 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 10:27:45,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:27:45,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-12-14 10:27:45,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835627950] [2022-12-14 10:27:45,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:27:45,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 10:27:45,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:27:45,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 10:27:45,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=424, Unknown=9, NotChecked=86, Total=600 [2022-12-14 10:27:45,637 INFO L87 Difference]: Start difference. First operand 1606 states and 6346 transitions. Second operand has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 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 10:27:46,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:27:46,183 INFO L93 Difference]: Finished difference Result 2153 states and 7830 transitions. [2022-12-14 10:27:46,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 10:27:46,184 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 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 10:27:46,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:27:46,188 INFO L225 Difference]: With dead ends: 2153 [2022-12-14 10:27:46,188 INFO L226 Difference]: Without dead ends: 2147 [2022-12-14 10:27:46,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=623, Unknown=9, NotChecked=106, Total=870 [2022-12-14 10:27:46,189 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 345 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 179 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 10:27:46,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 48 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 489 Invalid, 0 Unknown, 179 Unchecked, 0.4s Time] [2022-12-14 10:27:46,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2022-12-14 10:27:46,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 1551. [2022-12-14 10:27:46,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1472 states have (on average 4.0427989130434785) internal successors, (5951), 1550 states have internal predecessors, (5951), 0 states have call successors, (0), 0 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 10:27:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 5951 transitions. [2022-12-14 10:27:46,213 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 5951 transitions. Word has length 11 [2022-12-14 10:27:46,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:27:46,213 INFO L495 AbstractCegarLoop]: Abstraction has 1551 states and 5951 transitions. [2022-12-14 10:27:46,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 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 10:27:46,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 5951 transitions. [2022-12-14 10:27:46,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 10:27:46,213 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:27:46,214 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:27:46,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-12-14 10:27:46,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:46,414 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:27:46,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:27:46,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1286699690, now seen corresponding path program 3 times [2022-12-14 10:27:46,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:27:46,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127181032] [2022-12-14 10:27:46,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:46,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:27:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:46,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:46,573 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:27:46,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127181032] [2022-12-14 10:27:46,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127181032] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:27:46,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339405924] [2022-12-14 10:27:46,573 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 10:27:46,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:46,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:27:46,574 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:27:46,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-14 10:27:46,761 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 10:27:46,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:27:46,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 10:27:46,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:27:46,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:46,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:27:46,915 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:46,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339405924] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:27:46,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1104651544] [2022-12-14 10:27:46,916 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 10:27:46,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:27:46,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-12-14 10:27:46,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758882340] [2022-12-14 10:27:46,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:27:46,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 10:27:46,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:27:46,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 10:27:46,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2022-12-14 10:27:46,917 INFO L87 Difference]: Start difference. First operand 1551 states and 5951 transitions. Second operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 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 10:27:47,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:27:47,433 INFO L93 Difference]: Finished difference Result 1780 states and 6432 transitions. [2022-12-14 10:27:47,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 10:27:47,433 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 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 10:27:47,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:27:47,437 INFO L225 Difference]: With dead ends: 1780 [2022-12-14 10:27:47,437 INFO L226 Difference]: Without dead ends: 1768 [2022-12-14 10:27:47,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=527, Unknown=0, NotChecked=0, Total=702 [2022-12-14 10:27:47,438 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 254 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 10:27:47,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 59 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 10:27:47,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2022-12-14 10:27:47,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1572. [2022-12-14 10:27:47,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1493 states have (on average 3.98861352980576) internal successors, (5955), 1571 states have internal predecessors, (5955), 0 states have call successors, (0), 0 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 10:27:47,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 5955 transitions. [2022-12-14 10:27:47,459 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 5955 transitions. Word has length 11 [2022-12-14 10:27:47,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:27:47,459 INFO L495 AbstractCegarLoop]: Abstraction has 1572 states and 5955 transitions. [2022-12-14 10:27:47,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 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 10:27:47,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 5955 transitions. [2022-12-14 10:27:47,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 10:27:47,460 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:27:47,460 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:27:47,465 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-12-14 10:27:47,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:47,661 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:27:47,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:27:47,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1286699380, now seen corresponding path program 1 times [2022-12-14 10:27:47,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:27:47,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415227339] [2022-12-14 10:27:47,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:47,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:27:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:47,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:47,980 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:27:47,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415227339] [2022-12-14 10:27:47,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415227339] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:27:47,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548357608] [2022-12-14 10:27:47,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:47,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:47,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:27:47,981 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:27:47,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-14 10:27:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:48,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-14 10:27:48,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:27:48,187 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 10:27:48,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:48,218 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 10:27:48,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:48,250 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 10:27:48,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:48,311 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 10:27:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:48,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:27:48,366 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1671 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1671) c_~A~0.base) (+ (* |c_thread2Thread1of1ForFork2_~i~1#1| 4) c_~A~0.offset 4)) 9223372039002259456))) is different from false [2022-12-14 10:27:48,369 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1671 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1671) c_~A~0.base) (+ c_~A~0.offset 4)) 9223372039002259456))) is different from false [2022-12-14 10:27:48,376 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1671 (Array Int Int)) (v_ArrVal_1670 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1670) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1671) c_~A~0.base) (+ c_~A~0.offset 4)) 9223372039002259456))) is different from false [2022-12-14 10:27:48,420 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:48,420 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 32 treesize of output 33 [2022-12-14 10:27:48,427 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:48,428 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 311 treesize of output 301 [2022-12-14 10:27:48,432 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 286 treesize of output 254 [2022-12-14 10:27:48,436 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 254 treesize of output 238 [2022-12-14 10:27:48,441 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 238 treesize of output 230 [2022-12-14 10:27:48,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 10:27:48,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548357608] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:27:48,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1060258345] [2022-12-14 10:27:48,574 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 10:27:48,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:27:48,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-14 10:27:48,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085402707] [2022-12-14 10:27:48,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:27:48,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 10:27:48,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:27:48,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 10:27:48,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=431, Unknown=7, NotChecked=132, Total=650 [2022-12-14 10:27:48,575 INFO L87 Difference]: Start difference. First operand 1572 states and 5955 transitions. Second operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 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 10:27:49,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:27:49,256 INFO L93 Difference]: Finished difference Result 2195 states and 7873 transitions. [2022-12-14 10:27:49,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 10:27:49,256 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 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 10:27:49,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:27:49,261 INFO L225 Difference]: With dead ends: 2195 [2022-12-14 10:27:49,261 INFO L226 Difference]: Without dead ends: 2195 [2022-12-14 10:27:49,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=615, Unknown=7, NotChecked=162, Total=930 [2022-12-14 10:27:49,261 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 366 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 271 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 10:27:49,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 57 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 580 Invalid, 0 Unknown, 271 Unchecked, 0.4s Time] [2022-12-14 10:27:49,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2195 states. [2022-12-14 10:27:49,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 1636. [2022-12-14 10:27:49,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1557 states have (on average 4.109826589595376) internal successors, (6399), 1635 states have internal predecessors, (6399), 0 states have call successors, (0), 0 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 10:27:49,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 6399 transitions. [2022-12-14 10:27:49,285 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 6399 transitions. Word has length 11 [2022-12-14 10:27:49,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:27:49,285 INFO L495 AbstractCegarLoop]: Abstraction has 1636 states and 6399 transitions. [2022-12-14 10:27:49,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 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 10:27:49,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 6399 transitions. [2022-12-14 10:27:49,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 10:27:49,286 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:27:49,286 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:27:49,290 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-12-14 10:27:49,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:49,487 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:27:49,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:27:49,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1286699381, now seen corresponding path program 1 times [2022-12-14 10:27:49,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:27:49,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538024998] [2022-12-14 10:27:49,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:49,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:27:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:49,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:49,790 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:27:49,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538024998] [2022-12-14 10:27:49,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538024998] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:27:49,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724605480] [2022-12-14 10:27:49,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:49,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:49,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:27:49,792 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:27:49,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-14 10:27:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:49,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-14 10:27:49,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:27:49,993 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 10:27:50,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:50,027 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 10:27:50,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:50,055 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 10:27:50,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:50,118 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 10:27:50,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:50,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:27:50,173 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1724 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1724) c_~A~0.base) (+ (* |c_thread2Thread1of1ForFork2_~i~1#1| 4) c_~A~0.offset 4)) 4294967296)) is different from false [2022-12-14 10:27:50,253 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1724 (Array Int Int)) (v_ArrVal_1723 (Array Int Int)) (v_ArrVal_1722 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1722) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1723) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1724) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-12-14 10:27:50,263 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:50,263 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 30 treesize of output 31 [2022-12-14 10:27:50,271 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:50,272 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 277 treesize of output 267 [2022-12-14 10:27:50,277 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 254 treesize of output 222 [2022-12-14 10:27:50,285 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 111 treesize of output 103 [2022-12-14 10:27:50,290 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 214 treesize of output 198 [2022-12-14 10:27:50,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-14 10:27:50,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724605480] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:27:50,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1995546058] [2022-12-14 10:27:50,417 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 10:27:50,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:27:50,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-14 10:27:50,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293602912] [2022-12-14 10:27:50,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:27:50,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 10:27:50,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:27:50,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 10:27:50,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=463, Unknown=9, NotChecked=90, Total=650 [2022-12-14 10:27:50,418 INFO L87 Difference]: Start difference. First operand 1636 states and 6399 transitions. Second operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 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 10:27:51,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:27:51,060 INFO L93 Difference]: Finished difference Result 2001 states and 7129 transitions. [2022-12-14 10:27:51,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 10:27:51,060 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 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 10:27:51,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:27:51,064 INFO L225 Difference]: With dead ends: 2001 [2022-12-14 10:27:51,064 INFO L226 Difference]: Without dead ends: 1965 [2022-12-14 10:27:51,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=652, Unknown=9, NotChecked=110, Total=930 [2022-12-14 10:27:51,065 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 317 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 10:27:51,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 63 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 656 Invalid, 0 Unknown, 146 Unchecked, 0.4s Time] [2022-12-14 10:27:51,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states. [2022-12-14 10:27:51,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1535. [2022-12-14 10:27:51,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1456 states have (on average 4.010989010989011) internal successors, (5840), 1534 states have internal predecessors, (5840), 0 states have call successors, (0), 0 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 10:27:51,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 5840 transitions. [2022-12-14 10:27:51,086 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 5840 transitions. Word has length 11 [2022-12-14 10:27:51,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:27:51,086 INFO L495 AbstractCegarLoop]: Abstraction has 1535 states and 5840 transitions. [2022-12-14 10:27:51,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 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 10:27:51,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 5840 transitions. [2022-12-14 10:27:51,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 10:27:51,086 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:27:51,086 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 10:27:51,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-12-14 10:27:51,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-12-14 10:27:51,287 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:27:51,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:27:51,288 INFO L85 PathProgramCache]: Analyzing trace with hash 776504723, now seen corresponding path program 2 times [2022-12-14 10:27:51,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:27:51,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202895259] [2022-12-14 10:27:51,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:27:51,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:27:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:27:51,561 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:51,561 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:27:51,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202895259] [2022-12-14 10:27:51,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202895259] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:27:51,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572048753] [2022-12-14 10:27:51,561 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:27:51,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:27:51,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:27:51,562 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:27:51,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-14 10:27:51,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 10:27:51,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:27:51,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-14 10:27:51,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:27:51,795 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 15 treesize of output 11 [2022-12-14 10:27:51,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:51,840 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 20 treesize of output 22 [2022-12-14 10:27:51,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:27:51,925 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 20 treesize of output 22 [2022-12-14 10:27:52,043 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:52,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:27:52,308 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:52,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2022-12-14 10:27:52,315 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:27:52,316 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 89 treesize of output 85 [2022-12-14 10:27:52,320 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 68 treesize of output 56 [2022-12-14 10:27:52,325 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 30 treesize of output 24 [2022-12-14 10:27:52,576 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:27:52,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572048753] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:27:52,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1021614429] [2022-12-14 10:27:52,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 10:27:52,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:27:52,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-12-14 10:27:52,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098261929] [2022-12-14 10:27:52,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:27:52,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-14 10:27:52,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:27:52,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-14 10:27:52,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=715, Unknown=3, NotChecked=0, Total=812 [2022-12-14 10:27:52,578 INFO L87 Difference]: Start difference. First operand 1535 states and 5840 transitions. Second operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 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 10:28:17,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:28:17,227 INFO L93 Difference]: Finished difference Result 4266 states and 14971 transitions. [2022-12-14 10:28:17,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-14 10:28:17,227 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 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 10:28:17,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:28:17,235 INFO L225 Difference]: With dead ends: 4266 [2022-12-14 10:28:17,236 INFO L226 Difference]: Without dead ends: 4266 [2022-12-14 10:28:17,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=776, Invalid=4186, Unknown=8, NotChecked=0, Total=4970 [2022-12-14 10:28:17,237 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 937 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 2708 mSolverCounterSat, 130 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 2844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 2708 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:28:17,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 307 Invalid, 2844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 2708 Invalid, 6 Unknown, 0 Unchecked, 3.2s Time] [2022-12-14 10:28:17,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4266 states. [2022-12-14 10:28:17,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4266 to 1927. [2022-12-14 10:28:17,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1927 states, 1848 states have (on average 4.518939393939394) internal successors, (8351), 1926 states have internal predecessors, (8351), 0 states have call successors, (0), 0 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 10:28:17,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 8351 transitions. [2022-12-14 10:28:17,281 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 8351 transitions. Word has length 11 [2022-12-14 10:28:17,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:28:17,281 INFO L495 AbstractCegarLoop]: Abstraction has 1927 states and 8351 transitions. [2022-12-14 10:28:17,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 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 10:28:17,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 8351 transitions. [2022-12-14 10:28:17,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 10:28:17,282 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:28:17,282 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 10:28:17,286 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-12-14 10:28:17,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-12-14 10:28:17,483 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:28:17,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:28:17,484 INFO L85 PathProgramCache]: Analyzing trace with hash 776504724, now seen corresponding path program 2 times [2022-12-14 10:28:17,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:28:17,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739902956] [2022-12-14 10:28:17,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:28:17,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:28:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:28:17,792 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:28:17,793 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:28:17,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739902956] [2022-12-14 10:28:17,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739902956] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:28:17,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346931061] [2022-12-14 10:28:17,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:28:17,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:28:17,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:28:17,794 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:28:17,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-14 10:28:17,990 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 10:28:17,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:28:17,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-14 10:28:17,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:28:18,069 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 10:28:18,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:28:18,098 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 10:28:18,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:28:18,148 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 10:28:18,187 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:28:18,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:28:18,245 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1828 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1828) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 8)) 4294967296)) is different from false [2022-12-14 10:28:18,315 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:28:18,315 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 27 treesize of output 28 [2022-12-14 10:28:18,320 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:28:18,320 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 71 treesize of output 67 [2022-12-14 10:28:18,323 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 54 treesize of output 46 [2022-12-14 10:28:18,326 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 24 treesize of output 20 [2022-12-14 10:28:18,410 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:28:18,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346931061] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:28:18,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1852789697] [2022-12-14 10:28:18,411 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 10:28:18,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:28:18,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-12-14 10:28:18,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125130489] [2022-12-14 10:28:18,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:28:18,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-14 10:28:18,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:28:18,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-14 10:28:18,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=614, Unknown=7, NotChecked=50, Total=756 [2022-12-14 10:28:18,412 INFO L87 Difference]: Start difference. First operand 1927 states and 8351 transitions. Second operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 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 10:28:19,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:28:19,112 INFO L93 Difference]: Finished difference Result 2309 states and 9354 transitions. [2022-12-14 10:28:19,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 10:28:19,112 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 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 10:28:19,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:28:19,117 INFO L225 Difference]: With dead ends: 2309 [2022-12-14 10:28:19,117 INFO L226 Difference]: Without dead ends: 2309 [2022-12-14 10:28:19,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=899, Unknown=7, NotChecked=62, Total=1122 [2022-12-14 10:28:19,118 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 194 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 10:28:19,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 97 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 928 Invalid, 0 Unknown, 88 Unchecked, 0.5s Time] [2022-12-14 10:28:19,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2022-12-14 10:28:19,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 1946. [2022-12-14 10:28:19,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1946 states, 1867 states have (on average 4.499732190680236) internal successors, (8401), 1945 states have internal predecessors, (8401), 0 states have call successors, (0), 0 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 10:28:19,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 8401 transitions. [2022-12-14 10:28:19,147 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 8401 transitions. Word has length 11 [2022-12-14 10:28:19,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:28:19,147 INFO L495 AbstractCegarLoop]: Abstraction has 1946 states and 8401 transitions. [2022-12-14 10:28:19,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 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 10:28:19,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 8401 transitions. [2022-12-14 10:28:19,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 10:28:19,148 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:28:19,148 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:28:19,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-12-14 10:28:19,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:28:19,349 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:28:19,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:28:19,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1420512433, now seen corresponding path program 1 times [2022-12-14 10:28:19,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:28:19,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132013256] [2022-12-14 10:28:19,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:28:19,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:28:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:28:19,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:28:19,714 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:28:19,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132013256] [2022-12-14 10:28:19,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132013256] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:28:19,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524954935] [2022-12-14 10:28:19,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:28:19,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:28:19,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:28:19,715 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:28:19,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-14 10:28:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:28:19,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-14 10:28:19,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:28:19,972 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 10:28:20,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:28:20,033 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 10:28:20,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:28:20,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 10:28:20,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:28:20,132 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 10:28:20,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:28:20,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:28:20,469 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:28:20,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-12-14 10:28:20,478 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:28:20,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 343 treesize of output 331 [2022-12-14 10:28:20,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 162 treesize of output 150 [2022-12-14 10:28:20,490 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 302 treesize of output 278 [2022-12-14 10:28:20,496 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 278 treesize of output 230 [2022-12-14 10:28:20,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:28:20,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524954935] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:28:20,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [220327797] [2022-12-14 10:28:20,802 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 10:28:20,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:28:20,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-14 10:28:20,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980064655] [2022-12-14 10:28:20,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:28:20,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 10:28:20,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:28:20,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 10:28:20,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=544, Unknown=3, NotChecked=0, Total=650 [2022-12-14 10:28:20,803 INFO L87 Difference]: Start difference. First operand 1946 states and 8401 transitions. Second operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 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 10:28:23,055 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 10:28:24,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:28:24,863 INFO L93 Difference]: Finished difference Result 3163 states and 13800 transitions. [2022-12-14 10:28:24,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 10:28:24,864 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 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 10:28:24,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:28:24,872 INFO L225 Difference]: With dead ends: 3163 [2022-12-14 10:28:24,872 INFO L226 Difference]: Without dead ends: 3163 [2022-12-14 10:28:24,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=198, Invalid=918, Unknown=6, NotChecked=0, Total=1122 [2022-12-14 10:28:24,873 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 331 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 26 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-12-14 10:28:24,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 106 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1116 Invalid, 28 Unknown, 0 Unchecked, 3.7s Time] [2022-12-14 10:28:24,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2022-12-14 10:28:24,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 2515. [2022-12-14 10:28:24,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2515 states, 2436 states have (on average 4.907224958949097) internal successors, (11954), 2514 states have internal predecessors, (11954), 0 states have call successors, (0), 0 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 10:28:24,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2515 states to 2515 states and 11954 transitions. [2022-12-14 10:28:24,914 INFO L78 Accepts]: Start accepts. Automaton has 2515 states and 11954 transitions. Word has length 12 [2022-12-14 10:28:24,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:28:24,914 INFO L495 AbstractCegarLoop]: Abstraction has 2515 states and 11954 transitions. [2022-12-14 10:28:24,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 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 10:28:24,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2515 states and 11954 transitions. [2022-12-14 10:28:24,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 10:28:24,915 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:28:24,915 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:28:24,920 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-12-14 10:28:25,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-12-14 10:28:25,116 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:28:25,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:28:25,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1420512434, now seen corresponding path program 1 times [2022-12-14 10:28:25,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:28:25,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867698589] [2022-12-14 10:28:25,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:28:25,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:28:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:28:25,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:28:25,528 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:28:25,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867698589] [2022-12-14 10:28:25,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867698589] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:28:25,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457224687] [2022-12-14 10:28:25,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:28:25,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:28:25,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:28:25,529 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:28:25,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-14 10:28:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:28:25,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-14 10:28:25,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:28:25,744 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 10:28:25,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:28:25,795 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 10:28:25,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:28:25,841 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 10:28:25,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:28:25,895 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 10:28:25,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:28:25,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:28:26,252 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:28:26,252 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 32 treesize of output 33 [2022-12-14 10:28:26,262 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:28:26,262 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 1233 treesize of output 1173 [2022-12-14 10:28:26,272 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 1158 treesize of output 1062 [2022-12-14 10:28:26,282 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 1062 treesize of output 1014 [2022-12-14 10:28:26,292 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 1014 treesize of output 822 [2022-12-14 10:28:27,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:28:27,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457224687] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:28:27,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [498119477] [2022-12-14 10:28:27,945 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 10:28:27,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:28:27,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-14 10:28:27,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233959326] [2022-12-14 10:28:27,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:28:27,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 10:28:27,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:28:27,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 10:28:27,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=544, Unknown=2, NotChecked=0, Total=650 [2022-12-14 10:28:27,947 INFO L87 Difference]: Start difference. First operand 2515 states and 11954 transitions. Second operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 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 10:28:29,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:28:29,705 INFO L93 Difference]: Finished difference Result 3085 states and 13347 transitions. [2022-12-14 10:28:29,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 10:28:29,705 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 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 10:28:29,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:28:29,712 INFO L225 Difference]: With dead ends: 3085 [2022-12-14 10:28:29,712 INFO L226 Difference]: Without dead ends: 2838 [2022-12-14 10:28:29,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=857, Unknown=9, NotChecked=0, Total=1056 [2022-12-14 10:28:29,713 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 219 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 20 mSolverCounterUnsat, 67 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 67 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-14 10:28:29,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 76 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 880 Invalid, 67 Unknown, 0 Unchecked, 1.4s Time] [2022-12-14 10:28:29,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2022-12-14 10:28:29,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 2212. [2022-12-14 10:28:29,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2212 states, 2133 states have (on average 4.991561181434599) internal successors, (10647), 2211 states have internal predecessors, (10647), 0 states have call successors, (0), 0 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 10:28:29,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2212 states to 2212 states and 10647 transitions. [2022-12-14 10:28:29,751 INFO L78 Accepts]: Start accepts. Automaton has 2212 states and 10647 transitions. Word has length 12 [2022-12-14 10:28:29,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:28:29,751 INFO L495 AbstractCegarLoop]: Abstraction has 2212 states and 10647 transitions. [2022-12-14 10:28:29,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 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 10:28:29,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2212 states and 10647 transitions. [2022-12-14 10:28:29,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 10:28:29,752 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:28:29,752 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2022-12-14 10:28:29,757 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-12-14 10:28:29,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-12-14 10:28:29,953 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:28:29,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:28:29,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1698152276, now seen corresponding path program 3 times [2022-12-14 10:28:29,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:28:29,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131126468] [2022-12-14 10:28:29,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:28:29,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:28:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:28:30,075 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:28:30,075 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:28:30,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131126468] [2022-12-14 10:28:30,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131126468] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:28:30,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891340426] [2022-12-14 10:28:30,076 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 10:28:30,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:28:30,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:28:30,077 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:28:30,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-14 10:28:30,233 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 10:28:30,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:28:30,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 10:28:30,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:28:30,334 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:28:30,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:28:30,417 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:28:30,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891340426] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:28:30,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [934881327] [2022-12-14 10:28:30,418 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 10:28:30,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:28:30,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-12-14 10:28:30,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260245010] [2022-12-14 10:28:30,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:28:30,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 10:28:30,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:28:30,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 10:28:30,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2022-12-14 10:28:30,419 INFO L87 Difference]: Start difference. First operand 2212 states and 10647 transitions. Second operand has 24 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:28:31,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:28:31,002 INFO L93 Difference]: Finished difference Result 3292 states and 12583 transitions. [2022-12-14 10:28:31,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 10:28:31,003 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-14 10:28:31,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:28:31,010 INFO L225 Difference]: With dead ends: 3292 [2022-12-14 10:28:31,010 INFO L226 Difference]: Without dead ends: 3256 [2022-12-14 10:28:31,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=278, Invalid=714, Unknown=0, NotChecked=0, Total=992 [2022-12-14 10:28:31,011 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 272 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 10:28:31,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 104 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 929 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 10:28:31,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3256 states. [2022-12-14 10:28:31,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3256 to 1990. [2022-12-14 10:28:31,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1990 states, 1911 states have (on average 4.236525379382522) internal successors, (8096), 1989 states have internal predecessors, (8096), 0 states have call successors, (0), 0 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 10:28:31,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 8096 transitions. [2022-12-14 10:28:31,044 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 8096 transitions. Word has length 12 [2022-12-14 10:28:31,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:28:31,044 INFO L495 AbstractCegarLoop]: Abstraction has 1990 states and 8096 transitions. [2022-12-14 10:28:31,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:28:31,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 8096 transitions. [2022-12-14 10:28:31,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 10:28:31,045 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:28:31,045 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:28:31,049 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-12-14 10:28:31,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:28:31,246 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:28:31,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:28:31,247 INFO L85 PathProgramCache]: Analyzing trace with hash 377083966, now seen corresponding path program 4 times [2022-12-14 10:28:31,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:28:31,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154384636] [2022-12-14 10:28:31,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:28:31,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:28:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:28:31,514 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:28:31,514 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:28:31,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154384636] [2022-12-14 10:28:31,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154384636] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:28:31,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456748161] [2022-12-14 10:28:31,514 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 10:28:31,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:28:31,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:28:31,515 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:28:31,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-12-14 10:28:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:28:31,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-14 10:28:31,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:28:31,758 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 10:28:31,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:28:31,789 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 10:28:31,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:28:31,815 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 10:28:31,866 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:28:31,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:28:32,041 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:28:32,041 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 29 treesize of output 30 [2022-12-14 10:28:32,047 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:28:32,048 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 159 treesize of output 149 [2022-12-14 10:28:32,052 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 67 treesize of output 59 [2022-12-14 10:28:32,055 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 126 treesize of output 110 [2022-12-14 10:28:32,149 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:28:32,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456748161] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:28:32,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [304766164] [2022-12-14 10:28:32,150 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 10:28:32,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:28:32,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-12-14 10:28:32,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152137744] [2022-12-14 10:28:32,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:28:32,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 10:28:32,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:28:32,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 10:28:32,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=611, Unknown=6, NotChecked=0, Total=702 [2022-12-14 10:28:32,151 INFO L87 Difference]: Start difference. First operand 1990 states and 8096 transitions. Second operand has 27 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 0 states have call successors, (0), 0 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 10:28:32,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:28:32,911 INFO L93 Difference]: Finished difference Result 2537 states and 9727 transitions. [2022-12-14 10:28:32,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 10:28:32,912 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 0 states have call successors, (0), 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 10:28:32,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:28:32,918 INFO L225 Difference]: With dead ends: 2537 [2022-12-14 10:28:32,918 INFO L226 Difference]: Without dead ends: 2537 [2022-12-14 10:28:32,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=886, Unknown=6, NotChecked=0, Total=1056 [2022-12-14 10:28:32,918 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 176 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 10:28:32,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 91 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 10:28:32,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2022-12-14 10:28:32,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 2011. [2022-12-14 10:28:32,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2011 states, 1932 states have (on average 4.25103519668737) internal successors, (8213), 2010 states have internal predecessors, (8213), 0 states have call successors, (0), 0 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 10:28:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 2011 states and 8213 transitions. [2022-12-14 10:28:32,947 INFO L78 Accepts]: Start accepts. Automaton has 2011 states and 8213 transitions. Word has length 12 [2022-12-14 10:28:32,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:28:32,947 INFO L495 AbstractCegarLoop]: Abstraction has 2011 states and 8213 transitions. [2022-12-14 10:28:32,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 0 states have call successors, (0), 0 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 10:28:32,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 8213 transitions. [2022-12-14 10:28:32,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 10:28:32,947 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:28:32,947 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:28:32,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-12-14 10:28:33,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:28:33,148 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:28:33,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:28:33,149 INFO L85 PathProgramCache]: Analyzing trace with hash 377083967, now seen corresponding path program 2 times [2022-12-14 10:28:33,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:28:33,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887729806] [2022-12-14 10:28:33,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:28:33,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:28:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:28:33,457 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:28:33,457 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:28:33,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887729806] [2022-12-14 10:28:33,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887729806] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:28:33,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697080443] [2022-12-14 10:28:33,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:28:33,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:28:33,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:28:33,459 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:28:33,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-12-14 10:28:33,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 10:28:33,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:28:33,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-14 10:28:33,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:28:33,726 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 10:28:33,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:28:33,760 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 10:28:33,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:28:33,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 10:28:33,844 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:28:33,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:28:33,910 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2086 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2086) c_~A~0.base) (+ c_~A~0.offset 8)) 4294967296)) is different from false [2022-12-14 10:28:33,919 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2086 (Array Int Int)) (v_ArrVal_2085 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2085) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2086) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-12-14 10:28:33,927 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:28:33,927 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 27 treesize of output 28 [2022-12-14 10:28:33,933 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:28:33,933 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 71 treesize of output 67 [2022-12-14 10:28:33,937 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 10:28:33,941 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 50 treesize of output 42 [2022-12-14 10:28:34,023 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-14 10:28:34,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697080443] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:28:34,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2106482974] [2022-12-14 10:28:34,024 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 10:28:34,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:28:34,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-12-14 10:28:34,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145613381] [2022-12-14 10:28:34,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:28:34,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 10:28:34,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:28:34,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 10:28:34,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=526, Unknown=2, NotChecked=94, Total=702 [2022-12-14 10:28:34,025 INFO L87 Difference]: Start difference. First operand 2011 states and 8213 transitions. Second operand has 27 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 0 states have call successors, (0), 0 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 10:28:34,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:28:34,819 INFO L93 Difference]: Finished difference Result 2516 states and 9652 transitions. [2022-12-14 10:28:34,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 10:28:34,819 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 0 states have call successors, (0), 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 10:28:34,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:28:34,824 INFO L225 Difference]: With dead ends: 2516 [2022-12-14 10:28:34,824 INFO L226 Difference]: Without dead ends: 2516 [2022-12-14 10:28:34,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=789, Unknown=2, NotChecked=118, Total=1056 [2022-12-14 10:28:34,825 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 202 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 185 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 10:28:34,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 98 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 986 Invalid, 0 Unknown, 185 Unchecked, 0.6s Time] [2022-12-14 10:28:34,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2022-12-14 10:28:34,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 2011. [2022-12-14 10:28:34,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2011 states, 1932 states have (on average 4.24016563146998) internal successors, (8192), 2010 states have internal predecessors, (8192), 0 states have call successors, (0), 0 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 10:28:34,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 2011 states and 8192 transitions. [2022-12-14 10:28:34,854 INFO L78 Accepts]: Start accepts. Automaton has 2011 states and 8192 transitions. Word has length 12 [2022-12-14 10:28:34,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:28:34,854 INFO L495 AbstractCegarLoop]: Abstraction has 2011 states and 8192 transitions. [2022-12-14 10:28:34,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 0 states have call successors, (0), 0 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 10:28:34,854 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 8192 transitions. [2022-12-14 10:28:34,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 10:28:34,854 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:28:34,854 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:28:34,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-12-14 10:28:35,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-12-14 10:28:35,056 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:28:35,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:28:35,056 INFO L85 PathProgramCache]: Analyzing trace with hash 383133122, now seen corresponding path program 2 times [2022-12-14 10:28:35,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:28:35,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090010859] [2022-12-14 10:28:35,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:28:35,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:28:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:28:35,712 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 10:28:35,712 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:28:35,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090010859] [2022-12-14 10:28:35,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090010859] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:28:35,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778086748] [2022-12-14 10:28:35,713 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:28:35,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:28:35,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:28:35,714 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:28:35,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-12-14 10:28:35,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 10:28:35,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:28:35,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-14 10:28:35,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:28:36,009 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 11 treesize of output 7 [2022-12-14 10:28:36,059 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 23 treesize of output 22 [2022-12-14 10:28:36,129 INFO L321 Elim1Store]: treesize reduction 30, result has 49.2 percent of original size [2022-12-14 10:28:36,129 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 3 case distinctions, treesize of input 36 treesize of output 50 [2022-12-14 10:28:36,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:28:36,263 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 38 [2022-12-14 10:28:36,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:28:36,356 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 38 [2022-12-14 10:28:36,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:28:36,457 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 38 [2022-12-14 10:28:36,591 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 10:28:36,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:28:37,126 INFO L321 Elim1Store]: treesize reduction 43, result has 57.4 percent of original size [2022-12-14 10:28:37,126 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 3 case distinctions, treesize of input 49 treesize of output 80 [2022-12-14 10:28:37,154 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:28:37,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 388 treesize of output 411 [2022-12-14 10:28:37,166 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 157 treesize of output 133 [2022-12-14 10:28:37,175 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 290 treesize of output 242 [2022-12-14 10:28:37,185 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 242 treesize of output 230 [2022-12-14 10:28:37,681 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 10:28:37,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778086748] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:28:37,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [429220571] [2022-12-14 10:28:37,682 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 10:28:37,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:28:37,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-14 10:28:37,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030820884] [2022-12-14 10:28:37,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:28:37,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 10:28:37,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:28:37,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 10:28:37,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=541, Unknown=12, NotChecked=0, Total=650 [2022-12-14 10:28:37,683 INFO L87 Difference]: Start difference. First operand 2011 states and 8192 transitions. Second operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 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 10:28:58,063 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 10:29:06,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:29:11,967 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 10:29:17,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:29:19,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:29:21,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:29:21,365 INFO L93 Difference]: Finished difference Result 2935 states and 11552 transitions. [2022-12-14 10:29:21,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-14 10:29:21,366 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 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 10:29:21,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:29:21,373 INFO L225 Difference]: With dead ends: 2935 [2022-12-14 10:29:21,373 INFO L226 Difference]: Without dead ends: 2935 [2022-12-14 10:29:21,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=301, Invalid=1579, Unknown=100, NotChecked=0, Total=1980 [2022-12-14 10:29:21,374 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 325 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 32 mSolverCounterUnsat, 209 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 1809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 209 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.6s IncrementalHoareTripleChecker+Time [2022-12-14 10:29:21,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 147 Invalid, 1809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1568 Invalid, 209 Unknown, 0 Unchecked, 20.6s Time] [2022-12-14 10:29:21,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2935 states. [2022-12-14 10:29:21,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 2237. [2022-12-14 10:29:21,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2237 states, 2158 states have (on average 4.2761816496756255) internal successors, (9228), 2236 states have internal predecessors, (9228), 0 states have call successors, (0), 0 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 10:29:21,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2237 states to 2237 states and 9228 transitions. [2022-12-14 10:29:21,408 INFO L78 Accepts]: Start accepts. Automaton has 2237 states and 9228 transitions. Word has length 12 [2022-12-14 10:29:21,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:29:21,408 INFO L495 AbstractCegarLoop]: Abstraction has 2237 states and 9228 transitions. [2022-12-14 10:29:21,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 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 10:29:21,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2237 states and 9228 transitions. [2022-12-14 10:29:21,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 10:29:21,408 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:29:21,408 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:29:21,413 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-12-14 10:29:21,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:29:21,610 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:29:21,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:29:21,610 INFO L85 PathProgramCache]: Analyzing trace with hash 383133123, now seen corresponding path program 2 times [2022-12-14 10:29:21,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:29:21,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775182035] [2022-12-14 10:29:21,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:29:21,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:29:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:29:22,389 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 10:29:22,389 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:29:22,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775182035] [2022-12-14 10:29:22,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775182035] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:29:22,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148417168] [2022-12-14 10:29:22,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:29:22,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:29:22,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:29:22,390 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:29:22,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-12-14 10:29:22,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 10:29:22,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:29:22,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 10:29:22,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:29:22,665 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 16 treesize of output 12 [2022-12-14 10:29:22,740 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 21 treesize of output 20 [2022-12-14 10:29:22,854 INFO L321 Elim1Store]: treesize reduction 30, result has 49.2 percent of original size [2022-12-14 10:29:22,855 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 3 case distinctions, treesize of input 32 treesize of output 46 [2022-12-14 10:29:23,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:29:23,027 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 34 treesize of output 32 [2022-12-14 10:29:23,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:29:23,152 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 34 treesize of output 32 [2022-12-14 10:29:23,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:29:23,259 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 34 treesize of output 32 [2022-12-14 10:29:23,457 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 10:29:23,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:29:24,293 INFO L321 Elim1Store]: treesize reduction 43, result has 57.4 percent of original size [2022-12-14 10:29:24,293 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 3 case distinctions, treesize of input 47 treesize of output 78 [2022-12-14 10:29:24,334 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:29:24,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 354 treesize of output 377 [2022-12-14 10:29:24,348 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 141 treesize of output 117 [2022-12-14 10:29:24,359 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 258 treesize of output 210 [2022-12-14 10:29:24,369 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 210 treesize of output 198 [2022-12-14 10:29:24,889 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 10:29:24,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148417168] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:29:24,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [265274045] [2022-12-14 10:29:24,890 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 10:29:24,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:29:24,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-14 10:29:24,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436596493] [2022-12-14 10:29:24,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:29:24,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 10:29:24,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:29:24,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 10:29:24,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=547, Unknown=8, NotChecked=0, Total=650 [2022-12-14 10:29:24,891 INFO L87 Difference]: Start difference. First operand 2237 states and 9228 transitions. Second operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 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 10:29:36,143 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 10:29:40,723 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 10:29:42,883 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 10:29:48,275 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 10:29:58,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:30:00,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:30:03,658 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 10:30:05,977 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 10:30:08,238 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 10:30:12,727 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 10:30:19,659 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 10:30:21,709 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 10:30:23,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:30:25,790 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 10:30:36,427 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 10:30:39,058 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 10:30:41,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:30:43,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:30:45,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:30:45,645 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~A~0.base)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse2 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| 1))) (and (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_95| Int)) (or (< (select .cse0 (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_95| 4))) 4294967296) (not (< |v_thread3Thread1of1ForFork0_~i~2#1_95| c_~N~0)) (not (<= c_~M~0 |v_thread3Thread1of1ForFork0_~i~2#1_95|)))) (or (forall ((v_ArrVal_2208 (Array Int Int)) (|v_thread3Thread1of1ForFork0_~i~2#1_95| Int) (v_ArrVal_2207 (Array Int Int)) (v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2205 Int)) (or (not (< |v_thread3Thread1of1ForFork0_~i~2#1_95| c_~N~0)) (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse1 .cse2 v_ArrVal_2205)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2206) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2207) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2208) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_95| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (< 2147483647 v_ArrVal_2205) (< |v_thread3Thread1of1ForFork0_~i~2#1_95| 0))) (< .cse3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_95| Int) (v_ArrVal_2208 (Array Int Int)) (v_ArrVal_2207 (Array Int Int)) (v_ArrVal_2206 (Array Int Int))) (or (not (< |v_thread3Thread1of1ForFork0_~i~2#1_95| c_~N~0)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2206) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2207) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2208) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_95| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (< |v_thread3Thread1of1ForFork0_~i~2#1_95| 0))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (not (< |c_thread3Thread1of1ForFork0_~i~2#1| c_~N~0)) (< (select .cse0 (+ (* 4 |c_thread3Thread1of1ForFork0_~i~2#1|) c_~A~0.offset)) 4294967296)) (forall ((v_ArrVal_2208 (Array Int Int)) (|v_thread3Thread1of1ForFork0_~i~2#1_95| Int) (v_ArrVal_2207 (Array Int Int)) (v_ArrVal_2206 (Array Int Int)) (v_ArrVal_2203 Int) (v_ArrVal_2205 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_181| Int)) (or (< (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_181| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store .cse1 .cse2 v_ArrVal_2203) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_181| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_2205)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2206) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2207) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2208) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_thread3Thread1of1ForFork0_~i~2#1_95| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (not (< |v_thread3Thread1of1ForFork0_~i~2#1_95| c_~N~0)) (< 2147483647 v_ArrVal_2203) (not (<= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_181| .cse3)) (< 2147483647 v_ArrVal_2205) (< |v_thread3Thread1of1ForFork0_~i~2#1_95| 0))))) is different from false [2022-12-14 10:30:49,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:30:51,671 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 10:30:54,912 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 10:30:59,747 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 10:31:01,862 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 10:31:03,970 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 10:31:06,022 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 10:31:08,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:31:08,206 INFO L93 Difference]: Finished difference Result 8638 states and 35092 transitions. [2022-12-14 10:31:08,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-14 10:31:08,207 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 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 10:31:08,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:31:08,233 INFO L225 Difference]: With dead ends: 8638 [2022-12-14 10:31:08,233 INFO L226 Difference]: Without dead ends: 8618 [2022-12-14 10:31:08,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 32.4s TimeCoverageRelationStatistics Valid=372, Invalid=2183, Unknown=205, NotChecked=102, Total=2862 [2022-12-14 10:31:08,234 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 630 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 2254 mSolverCounterSat, 63 mSolverCounterUnsat, 478 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 71.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 2809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2254 IncrementalHoareTripleChecker+Invalid, 478 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 72.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:31:08,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 178 Invalid, 2809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 2254 Invalid, 478 Unknown, 14 Unchecked, 72.3s Time] [2022-12-14 10:31:08,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8618 states. [2022-12-14 10:31:08,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8618 to 2858. [2022-12-14 10:31:08,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2858 states, 2779 states have (on average 4.343288952860742) internal successors, (12070), 2857 states have internal predecessors, (12070), 0 states have call successors, (0), 0 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 10:31:08,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2858 states and 12070 transitions. [2022-12-14 10:31:08,319 INFO L78 Accepts]: Start accepts. Automaton has 2858 states and 12070 transitions. Word has length 12 [2022-12-14 10:31:08,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:31:08,319 INFO L495 AbstractCegarLoop]: Abstraction has 2858 states and 12070 transitions. [2022-12-14 10:31:08,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 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 10:31:08,319 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 12070 transitions. [2022-12-14 10:31:08,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 10:31:08,319 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:31:08,319 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2022-12-14 10:31:08,325 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-12-14 10:31:08,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:31:08,520 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:31:08,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:31:08,521 INFO L85 PathProgramCache]: Analyzing trace with hash -132604451, now seen corresponding path program 1 times [2022-12-14 10:31:08,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:31:08,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751543827] [2022-12-14 10:31:08,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:31:08,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:31:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:31:08,641 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 10:31:08,641 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:31:08,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751543827] [2022-12-14 10:31:08,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751543827] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:31:08,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811852166] [2022-12-14 10:31:08,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:31:08,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:31:08,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:31:08,643 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:31:08,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-12-14 10:31:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:31:08,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 10:31:08,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:31:08,845 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 10:31:08,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:31:08,922 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 10:31:08,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811852166] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:31:08,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1432347915] [2022-12-14 10:31:08,923 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 10:31:08,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:31:08,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-14 10:31:08,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342649309] [2022-12-14 10:31:08,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:31:08,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 10:31:08,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:31:08,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 10:31:08,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-12-14 10:31:08,924 INFO L87 Difference]: Start difference. First operand 2858 states and 12070 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:31:09,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:31:09,806 INFO L93 Difference]: Finished difference Result 10664 states and 44941 transitions. [2022-12-14 10:31:09,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 10:31:09,807 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-14 10:31:09,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:31:09,841 INFO L225 Difference]: With dead ends: 10664 [2022-12-14 10:31:09,841 INFO L226 Difference]: Without dead ends: 10664 [2022-12-14 10:31:09,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-12-14 10:31:09,841 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 342 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 10:31:09,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 29 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 10:31:09,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10664 states. [2022-12-14 10:31:09,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10664 to 4433. [2022-12-14 10:31:09,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4433 states, 4354 states have (on average 5.639182361047313) internal successors, (24553), 4432 states have internal predecessors, (24553), 0 states have call successors, (0), 0 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 10:31:09,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4433 states to 4433 states and 24553 transitions. [2022-12-14 10:31:09,960 INFO L78 Accepts]: Start accepts. Automaton has 4433 states and 24553 transitions. Word has length 12 [2022-12-14 10:31:09,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:31:09,960 INFO L495 AbstractCegarLoop]: Abstraction has 4433 states and 24553 transitions. [2022-12-14 10:31:09,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:31:09,960 INFO L276 IsEmpty]: Start isEmpty. Operand 4433 states and 24553 transitions. [2022-12-14 10:31:09,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 10:31:09,961 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:31:09,961 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2022-12-14 10:31:09,966 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-12-14 10:31:10,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:31:10,163 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:31:10,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:31:10,164 INFO L85 PathProgramCache]: Analyzing trace with hash -132604479, now seen corresponding path program 1 times [2022-12-14 10:31:10,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:31:10,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751109521] [2022-12-14 10:31:10,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:31:10,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:31:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:31:10,245 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 10:31:10,246 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:31:10,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751109521] [2022-12-14 10:31:10,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751109521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:31:10,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 10:31:10,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 10:31:10,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580450563] [2022-12-14 10:31:10,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:31:10,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:31:10,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:31:10,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:31:10,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 10:31:10,247 INFO L87 Difference]: Start difference. First operand 4433 states and 24553 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:31:10,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:31:10,428 INFO L93 Difference]: Finished difference Result 4200 states and 21970 transitions. [2022-12-14 10:31:10,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:31:10,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-14 10:31:10,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:31:10,443 INFO L225 Difference]: With dead ends: 4200 [2022-12-14 10:31:10,443 INFO L226 Difference]: Without dead ends: 4200 [2022-12-14 10:31:10,443 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 10:31:10,443 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 25 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:31:10,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 7 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 10:31:10,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4200 states. [2022-12-14 10:31:10,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4200 to 4164. [2022-12-14 10:31:10,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4164 states, 4101 states have (on average 5.306022921238722) internal successors, (21760), 4163 states have internal predecessors, (21760), 0 states have call successors, (0), 0 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 10:31:10,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4164 states to 4164 states and 21760 transitions. [2022-12-14 10:31:10,517 INFO L78 Accepts]: Start accepts. Automaton has 4164 states and 21760 transitions. Word has length 12 [2022-12-14 10:31:10,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:31:10,517 INFO L495 AbstractCegarLoop]: Abstraction has 4164 states and 21760 transitions. [2022-12-14 10:31:10,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 10:31:10,517 INFO L276 IsEmpty]: Start isEmpty. Operand 4164 states and 21760 transitions. [2022-12-14 10:31:10,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 10:31:10,517 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:31:10,517 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:31:10,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-14 10:31:10,518 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:31:10,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:31:10,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1269818385, now seen corresponding path program 2 times [2022-12-14 10:31:10,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:31:10,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673268684] [2022-12-14 10:31:10,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:31:10,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:31:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:31:11,156 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:31:11,156 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:31:11,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673268684] [2022-12-14 10:31:11,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673268684] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:31:11,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506410651] [2022-12-14 10:31:11,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:31:11,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:31:11,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:31:11,158 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:31:11,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-12-14 10:31:11,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 10:31:11,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:31:11,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 10:31:11,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:31:11,643 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 15 treesize of output 11 [2022-12-14 10:31:11,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:31:11,794 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 20 treesize of output 22 [2022-12-14 10:31:12,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:31:12,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 10:31:12,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:31:12,186 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 20 treesize of output 22 [2022-12-14 10:31:12,507 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:31:12,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:31:13,386 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:31:13,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-12-14 10:31:13,412 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:31:13,412 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 683 treesize of output 655 [2022-12-14 10:31:13,424 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 638 treesize of output 542 [2022-12-14 10:31:13,440 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 271 treesize of output 247 [2022-12-14 10:31:13,452 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 518 treesize of output 470 [2022-12-14 10:31:14,728 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:31:14,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506410651] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:31:14,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1931192766] [2022-12-14 10:31:14,729 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 10:31:14,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:31:14,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-12-14 10:31:14,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027886801] [2022-12-14 10:31:14,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:31:14,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 10:31:14,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:31:14,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 10:31:14,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=880, Unknown=3, NotChecked=0, Total=992 [2022-12-14 10:31:14,730 INFO L87 Difference]: Start difference. First operand 4164 states and 21760 transitions. Second operand has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 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 10:31:49,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:31:49,753 INFO L93 Difference]: Finished difference Result 8755 states and 40558 transitions. [2022-12-14 10:31:49,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-14 10:31:49,754 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 10:31:49,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:31:49,783 INFO L225 Difference]: With dead ends: 8755 [2022-12-14 10:31:49,783 INFO L226 Difference]: Without dead ends: 8755 [2022-12-14 10:31:49,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 30.8s TimeCoverageRelationStatistics Valid=520, Invalid=2899, Unknown=3, NotChecked=0, Total=3422 [2022-12-14 10:31:49,784 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 1603 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 2029 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1603 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 2225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 2029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:31:49,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1603 Valid, 219 Invalid, 2225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 2029 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-12-14 10:31:49,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8755 states. [2022-12-14 10:31:49,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8755 to 6010. [2022-12-14 10:31:49,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6010 states, 5947 states have (on average 5.377164957121238) internal successors, (31978), 6009 states have internal predecessors, (31978), 0 states have call successors, (0), 0 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 10:31:49,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6010 states to 6010 states and 31978 transitions. [2022-12-14 10:31:49,916 INFO L78 Accepts]: Start accepts. Automaton has 6010 states and 31978 transitions. Word has length 13 [2022-12-14 10:31:49,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:31:49,916 INFO L495 AbstractCegarLoop]: Abstraction has 6010 states and 31978 transitions. [2022-12-14 10:31:49,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 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 10:31:49,916 INFO L276 IsEmpty]: Start isEmpty. Operand 6010 states and 31978 transitions. [2022-12-14 10:31:49,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 10:31:49,917 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:31:49,917 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:31:49,923 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-12-14 10:31:50,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-12-14 10:31:50,119 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:31:50,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:31:50,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1269818384, now seen corresponding path program 2 times [2022-12-14 10:31:50,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:31:50,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756555962] [2022-12-14 10:31:50,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:31:50,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:31:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:31:50,758 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:31:50,759 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:31:50,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756555962] [2022-12-14 10:31:50,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756555962] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:31:50,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448845217] [2022-12-14 10:31:50,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:31:50,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:31:50,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:31:50,760 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:31:50,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-12-14 10:31:51,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 10:31:51,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:31:51,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 10:31:51,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:31:51,271 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 15 treesize of output 11 [2022-12-14 10:31:51,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:31:51,389 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 10:31:51,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:31:51,602 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 10:31:51,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:31:51,730 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 10:31:52,002 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:31:52,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:31:52,799 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:31:52,799 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 32 treesize of output 33 [2022-12-14 10:31:52,819 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:31:52,819 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 155 treesize of output 151 [2022-12-14 10:31:52,827 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 136 treesize of output 112 [2022-12-14 10:31:52,836 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 112 treesize of output 100 [2022-12-14 10:31:52,846 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 52 treesize of output 46 [2022-12-14 10:31:53,963 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:31:53,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448845217] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:31:53,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [58709268] [2022-12-14 10:31:53,964 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 10:31:53,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:31:53,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-12-14 10:31:53,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191154013] [2022-12-14 10:31:53,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:31:53,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 10:31:53,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:31:53,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 10:31:53,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=879, Unknown=4, NotChecked=0, Total=992 [2022-12-14 10:31:53,966 INFO L87 Difference]: Start difference. First operand 6010 states and 31978 transitions. Second operand has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 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 10:32:20,911 WARN L233 SmtUtils]: Spent 6.34s on a formula simplification. DAG size of input: 89 DAG size of output: 79 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:32:26,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:32:26,790 INFO L93 Difference]: Finished difference Result 8509 states and 38183 transitions. [2022-12-14 10:32:26,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-14 10:32:26,791 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 10:32:26,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:32:26,814 INFO L225 Difference]: With dead ends: 8509 [2022-12-14 10:32:26,814 INFO L226 Difference]: Without dead ends: 8477 [2022-12-14 10:32:26,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 28.5s TimeCoverageRelationStatistics Valid=520, Invalid=2898, Unknown=4, NotChecked=0, Total=3422 [2022-12-14 10:32:26,815 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 1439 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 2100 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1439 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 2280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 2100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-12-14 10:32:26,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1439 Valid, 231 Invalid, 2280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 2100 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-12-14 10:32:26,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8477 states. [2022-12-14 10:32:26,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8477 to 5935. [2022-12-14 10:32:26,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5935 states, 5872 states have (on average 5.115633514986376) internal successors, (30039), 5934 states have internal predecessors, (30039), 0 states have call successors, (0), 0 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 10:32:26,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5935 states to 5935 states and 30039 transitions. [2022-12-14 10:32:26,933 INFO L78 Accepts]: Start accepts. Automaton has 5935 states and 30039 transitions. Word has length 13 [2022-12-14 10:32:26,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:32:26,933 INFO L495 AbstractCegarLoop]: Abstraction has 5935 states and 30039 transitions. [2022-12-14 10:32:26,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 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 10:32:26,933 INFO L276 IsEmpty]: Start isEmpty. Operand 5935 states and 30039 transitions. [2022-12-14 10:32:26,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 10:32:26,934 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:32:26,934 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:32:26,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-12-14 10:32:27,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-12-14 10:32:27,135 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:32:27,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:32:27,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1195292872, now seen corresponding path program 5 times [2022-12-14 10:32:27,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:32:27,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097332510] [2022-12-14 10:32:27,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:32:27,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:32:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:32:27,524 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:32:27,525 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:32:27,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097332510] [2022-12-14 10:32:27,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097332510] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:32:27,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265143376] [2022-12-14 10:32:27,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:32:27,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:32:27,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:32:27,526 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:32:27,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-12-14 10:32:27,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 10:32:27,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:32:27,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-14 10:32:27,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:32:28,148 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:32:28,149 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:32:28,452 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:32:28,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265143376] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:32:28,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [575437041] [2022-12-14 10:32:28,453 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 10:32:28,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:32:28,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-12-14 10:32:28,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171431603] [2022-12-14 10:32:28,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:32:28,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 10:32:28,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:32:28,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 10:32:28,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2022-12-14 10:32:28,456 INFO L87 Difference]: Start difference. First operand 5935 states and 30039 transitions. Second operand has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 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 10:32:30,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:32:30,423 INFO L93 Difference]: Finished difference Result 5979 states and 30127 transitions. [2022-12-14 10:32:30,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 10:32:30,424 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 10:32:30,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:32:30,443 INFO L225 Difference]: With dead ends: 5979 [2022-12-14 10:32:30,443 INFO L226 Difference]: Without dead ends: 5925 [2022-12-14 10:32:30,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=209, Invalid=721, Unknown=0, NotChecked=0, Total=930 [2022-12-14 10:32:30,444 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 195 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-14 10:32:30,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 72 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-12-14 10:32:30,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5925 states. [2022-12-14 10:32:30,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5925 to 5917. [2022-12-14 10:32:30,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5917 states, 5854 states have (on average 5.111889306457123) internal successors, (29925), 5916 states have internal predecessors, (29925), 0 states have call successors, (0), 0 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 10:32:30,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5917 states to 5917 states and 29925 transitions. [2022-12-14 10:32:30,553 INFO L78 Accepts]: Start accepts. Automaton has 5917 states and 29925 transitions. Word has length 13 [2022-12-14 10:32:30,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:32:30,553 INFO L495 AbstractCegarLoop]: Abstraction has 5917 states and 29925 transitions. [2022-12-14 10:32:30,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 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 10:32:30,554 INFO L276 IsEmpty]: Start isEmpty. Operand 5917 states and 29925 transitions. [2022-12-14 10:32:30,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 10:32:30,554 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:32:30,555 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:32:30,560 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-12-14 10:32:30,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:32:30,756 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:32:30,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:32:30,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1195293182, now seen corresponding path program 2 times [2022-12-14 10:32:30,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:32:30,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102404400] [2022-12-14 10:32:30,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:32:30,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:32:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:32:31,458 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:32:31,458 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:32:31,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102404400] [2022-12-14 10:32:31,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102404400] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:32:31,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194303792] [2022-12-14 10:32:31,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:32:31,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:32:31,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:32:31,460 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:32:31,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-12-14 10:32:31,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 10:32:31,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:32:31,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-14 10:32:31,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:32:31,938 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 10:32:32,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:32:32,028 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 10:32:32,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:32:32,128 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 10:32:32,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:32:32,453 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 10:32:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:32:32,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:32:32,579 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2499 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2499) c_~A~0.base) (+ (* |c_thread2Thread1of1ForFork2_~i~1#1| 4) c_~A~0.offset)) 9223372039002259456))) is different from false [2022-12-14 10:32:32,590 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2499 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2499) c_~A~0.base) (+ (* |c_thread2Thread1of1ForFork2_~i~1#1| 4) c_~A~0.offset 4)) 9223372039002259456))) is different from false [2022-12-14 10:32:32,600 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2499 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2499) c_~A~0.base) (+ (* |c_thread2Thread1of1ForFork2_~i~1#1| 4) c_~A~0.offset 8)) 9223372039002259456))) is different from false [2022-12-14 10:32:32,610 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2499 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2499) c_~A~0.base) (+ c_~A~0.offset 8)) 9223372039002259456))) is different from false [2022-12-14 10:32:32,884 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:32:32,884 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 32 treesize of output 33 [2022-12-14 10:32:32,904 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:32:32,905 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 311 treesize of output 301 [2022-12-14 10:32:32,917 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 146 treesize of output 138 [2022-12-14 10:32:32,924 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 278 treesize of output 262 [2022-12-14 10:32:32,932 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 262 treesize of output 230 [2022-12-14 10:32:33,307 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-14 10:32:33,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194303792] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:32:33,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [147565604] [2022-12-14 10:32:33,307 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 10:32:33,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:32:33,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-12-14 10:32:33,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937214997] [2022-12-14 10:32:33,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:32:33,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 10:32:33,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:32:33,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 10:32:33,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=656, Unknown=18, NotChecked=220, Total=992 [2022-12-14 10:32:33,309 INFO L87 Difference]: Start difference. First operand 5917 states and 29925 transitions. Second operand has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 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 10:32:35,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:32:35,813 INFO L93 Difference]: Finished difference Result 8751 states and 42918 transitions. [2022-12-14 10:32:35,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 10:32:35,814 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 10:32:35,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:32:35,843 INFO L225 Difference]: With dead ends: 8751 [2022-12-14 10:32:35,843 INFO L226 Difference]: Without dead ends: 8751 [2022-12-14 10:32:35,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=179, Invalid=941, Unknown=18, NotChecked=268, Total=1406 [2022-12-14 10:32:35,843 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 260 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 316 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-14 10:32:35,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 81 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 811 Invalid, 0 Unknown, 316 Unchecked, 1.7s Time] [2022-12-14 10:32:35,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8751 states. [2022-12-14 10:32:35,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8751 to 6413. [2022-12-14 10:32:35,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6413 states, 6350 states have (on average 5.292913385826772) internal successors, (33610), 6412 states have internal predecessors, (33610), 0 states have call successors, (0), 0 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 10:32:36,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6413 states to 6413 states and 33610 transitions. [2022-12-14 10:32:36,007 INFO L78 Accepts]: Start accepts. Automaton has 6413 states and 33610 transitions. Word has length 13 [2022-12-14 10:32:36,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:32:36,007 INFO L495 AbstractCegarLoop]: Abstraction has 6413 states and 33610 transitions. [2022-12-14 10:32:36,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 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 10:32:36,007 INFO L276 IsEmpty]: Start isEmpty. Operand 6413 states and 33610 transitions. [2022-12-14 10:32:36,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 10:32:36,008 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:32:36,008 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:32:36,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-12-14 10:32:36,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-12-14 10:32:36,209 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:32:36,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:32:36,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1195293181, now seen corresponding path program 2 times [2022-12-14 10:32:36,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:32:36,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106313977] [2022-12-14 10:32:36,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:32:36,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:32:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:32:36,854 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:32:36,854 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:32:36,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106313977] [2022-12-14 10:32:36,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106313977] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:32:36,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990118159] [2022-12-14 10:32:36,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:32:36,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:32:36,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:32:36,855 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:32:36,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-12-14 10:32:37,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 10:32:37,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:32:37,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-14 10:32:37,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:32:37,400 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 10:32:37,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:32:37,503 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 10:32:37,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:32:37,603 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 10:32:37,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:32:37,939 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 10:32:37,996 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:32:37,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:32:38,049 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2556 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2556) c_~A~0.base) (+ (* |c_thread2Thread1of1ForFork2_~i~1#1| 4) c_~A~0.offset)) 4294967296)) is different from false [2022-12-14 10:32:38,239 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2556 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2556) c_~A~0.base) (+ c_~A~0.offset 8)) 4294967296)) is different from false [2022-12-14 10:32:38,372 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2556 (Array Int Int)) (v_ArrVal_2555 (Array Int Int)) (v_ArrVal_2554 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2554) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2555) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2556) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-12-14 10:32:38,391 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:32:38,391 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 30 treesize of output 31 [2022-12-14 10:32:38,409 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:32:38,410 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 139 treesize of output 135 [2022-12-14 10:32:38,416 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 122 treesize of output 106 [2022-12-14 10:32:38,425 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 54 treesize of output 50 [2022-12-14 10:32:38,432 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 102 treesize of output 94 [2022-12-14 10:32:38,807 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-14 10:32:38,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990118159] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:32:38,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [11341290] [2022-12-14 10:32:38,808 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 10:32:38,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:32:38,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-12-14 10:32:38,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513307696] [2022-12-14 10:32:38,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:32:38,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 10:32:38,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:32:38,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 10:32:38,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=711, Unknown=13, NotChecked=168, Total=992 [2022-12-14 10:32:38,810 INFO L87 Difference]: Start difference. First operand 6413 states and 33610 transitions. Second operand has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 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 10:32:41,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:32:41,484 INFO L93 Difference]: Finished difference Result 8167 states and 39963 transitions. [2022-12-14 10:32:41,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 10:32:41,485 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 10:32:41,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:32:41,511 INFO L225 Difference]: With dead ends: 8167 [2022-12-14 10:32:41,511 INFO L226 Difference]: Without dead ends: 7938 [2022-12-14 10:32:41,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=177, Invalid=1012, Unknown=13, NotChecked=204, Total=1406 [2022-12-14 10:32:41,512 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 324 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 275 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-12-14 10:32:41,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 98 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 965 Invalid, 0 Unknown, 275 Unchecked, 1.9s Time] [2022-12-14 10:32:41,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7938 states. [2022-12-14 10:32:41,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7938 to 6140. [2022-12-14 10:32:41,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6140 states, 6077 states have (on average 5.288300148099391) internal successors, (32137), 6139 states have internal predecessors, (32137), 0 states have call successors, (0), 0 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 10:32:41,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6140 states to 6140 states and 32137 transitions. [2022-12-14 10:32:41,640 INFO L78 Accepts]: Start accepts. Automaton has 6140 states and 32137 transitions. Word has length 13 [2022-12-14 10:32:41,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:32:41,641 INFO L495 AbstractCegarLoop]: Abstraction has 6140 states and 32137 transitions. [2022-12-14 10:32:41,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 0 states have call successors, (0), 0 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 10:32:41,641 INFO L276 IsEmpty]: Start isEmpty. Operand 6140 states and 32137 transitions. [2022-12-14 10:32:41,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 10:32:41,641 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:32:41,641 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:32:41,647 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2022-12-14 10:32:41,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:32:41,843 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:32:41,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:32:41,844 INFO L85 PathProgramCache]: Analyzing trace with hash -2045150460, now seen corresponding path program 1 times [2022-12-14 10:32:41,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:32:41,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235004210] [2022-12-14 10:32:41,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:32:41,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:32:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:32:41,990 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:32:41,990 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:32:41,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235004210] [2022-12-14 10:32:41,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235004210] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:32:41,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438952875] [2022-12-14 10:32:41,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:32:41,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:32:41,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:32:41,992 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:32:41,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-12-14 10:32:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:32:42,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 10:32:42,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:32:42,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 10:32:42,221 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 10:32:42,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438952875] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 10:32:42,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 10:32:42,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [6] total 7 [2022-12-14 10:32:42,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082733210] [2022-12-14 10:32:42,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 10:32:42,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 10:32:42,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:32:42,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 10:32:42,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-14 10:32:42,222 INFO L87 Difference]: Start difference. First operand 6140 states and 32137 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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 10:32:42,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:32:42,322 INFO L93 Difference]: Finished difference Result 5451 states and 27568 transitions. [2022-12-14 10:32:42,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 10:32:42,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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 13 [2022-12-14 10:32:42,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:32:42,339 INFO L225 Difference]: With dead ends: 5451 [2022-12-14 10:32:42,339 INFO L226 Difference]: Without dead ends: 5431 [2022-12-14 10:32:42,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-14 10:32:42,340 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 20 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:32:42,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 10:32:42,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5431 states. [2022-12-14 10:32:42,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5431 to 2394. [2022-12-14 10:32:42,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2394 states, 2359 states have (on average 4.362441712590081) internal successors, (10291), 2393 states have internal predecessors, (10291), 0 states have call successors, (0), 0 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 10:32:42,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 10291 transitions. [2022-12-14 10:32:42,397 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 10291 transitions. Word has length 13 [2022-12-14 10:32:42,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:32:42,398 INFO L495 AbstractCegarLoop]: Abstraction has 2394 states and 10291 transitions. [2022-12-14 10:32:42,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 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 10:32:42,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 10291 transitions. [2022-12-14 10:32:42,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 10:32:42,398 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:32:42,398 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1] [2022-12-14 10:32:42,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-12-14 10:32:42,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:32:42,599 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:32:42,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:32:42,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1734079074, now seen corresponding path program 5 times [2022-12-14 10:32:42,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:32:42,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320402488] [2022-12-14 10:32:42,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:32:42,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:32:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:32:43,237 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:32:43,238 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:32:43,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320402488] [2022-12-14 10:32:43,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320402488] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:32:43,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123686033] [2022-12-14 10:32:43,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:32:43,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:32:43,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:32:43,239 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:32:43,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-12-14 10:32:43,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 10:32:43,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:32:43,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-14 10:32:43,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:32:43,739 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 10:32:43,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:32:43,831 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 27 treesize of output 26 [2022-12-14 10:32:43,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:32:43,917 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 10:32:44,177 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:32:44,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:32:44,590 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2669 (Array Int Int)) (v_ArrVal_2667 Int)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_2667)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2669) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-12-14 10:32:44,635 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-12-14 10:32:44,636 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 33 treesize of output 39 [2022-12-14 10:32:44,649 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:32:44,650 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 43 treesize of output 39 [2022-12-14 10:32:44,675 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 10:32:44,941 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-12-14 10:32:44,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123686033] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:32:44,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [91625080] [2022-12-14 10:32:44,942 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 10:32:44,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:32:44,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-12-14 10:32:44,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82557836] [2022-12-14 10:32:44,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:32:44,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 10:32:44,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:32:44,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 10:32:44,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=887, Unknown=6, NotChecked=60, Total=1056 [2022-12-14 10:32:44,943 INFO L87 Difference]: Start difference. First operand 2394 states and 10291 transitions. Second operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 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 10:32:47,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:32:47,044 INFO L93 Difference]: Finished difference Result 2601 states and 10891 transitions. [2022-12-14 10:32:47,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 10:32:47,045 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 10:32:47,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:32:47,052 INFO L225 Difference]: With dead ends: 2601 [2022-12-14 10:32:47,052 INFO L226 Difference]: Without dead ends: 2601 [2022-12-14 10:32:47,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=176, Invalid=1228, Unknown=6, NotChecked=72, Total=1482 [2022-12-14 10:32:47,053 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 78 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-14 10:32:47,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 89 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 964 Invalid, 0 Unknown, 54 Unchecked, 1.7s Time] [2022-12-14 10:32:47,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2601 states. [2022-12-14 10:32:47,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2601 to 2396. [2022-12-14 10:32:47,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2396 states, 2361 states have (on average 4.362134688691232) internal successors, (10299), 2395 states have internal predecessors, (10299), 0 states have call successors, (0), 0 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 10:32:47,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 10299 transitions. [2022-12-14 10:32:47,096 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 10299 transitions. Word has length 13 [2022-12-14 10:32:47,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:32:47,097 INFO L495 AbstractCegarLoop]: Abstraction has 2396 states and 10299 transitions. [2022-12-14 10:32:47,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 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 10:32:47,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 10299 transitions. [2022-12-14 10:32:47,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 10:32:47,097 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:32:47,097 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1] [2022-12-14 10:32:47,102 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-12-14 10:32:47,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:32:47,298 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:32:47,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:32:47,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1734079075, now seen corresponding path program 3 times [2022-12-14 10:32:47,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:32:47,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787278940] [2022-12-14 10:32:47,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:32:47,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:32:47,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:32:47,963 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:32:47,964 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:32:47,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787278940] [2022-12-14 10:32:47,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787278940] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:32:47,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723145555] [2022-12-14 10:32:47,964 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 10:32:47,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:32:47,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:32:47,965 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:32:47,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-12-14 10:32:48,166 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 10:32:48,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:32:48,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-14 10:32:48,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:32:48,417 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 10:32:48,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:32:48,504 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 10:32:48,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:32:48,590 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 10:32:48,836 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:32:48,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:32:49,141 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2726 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2726) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-12-14 10:32:49,153 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2726 (Array Int Int)) (v_ArrVal_2724 Int)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_2724)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2726) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-12-14 10:32:49,194 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-12-14 10:32:49,194 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 31 treesize of output 37 [2022-12-14 10:32:49,209 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:32:49,209 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 37 treesize of output 33 [2022-12-14 10:32:49,214 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 7 treesize of output 3 [2022-12-14 10:32:49,508 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-12-14 10:32:49,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723145555] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:32:49,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [430444802] [2022-12-14 10:32:49,509 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 10:32:49,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:32:49,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-12-14 10:32:49,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436675114] [2022-12-14 10:32:49,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:32:49,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 10:32:49,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:32:49,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 10:32:49,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=837, Unknown=2, NotChecked=118, Total=1056 [2022-12-14 10:32:49,511 INFO L87 Difference]: Start difference. First operand 2396 states and 10299 transitions. Second operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 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 10:32:51,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:32:51,558 INFO L93 Difference]: Finished difference Result 2630 states and 11002 transitions. [2022-12-14 10:32:51,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 10:32:51,559 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 10:32:51,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:32:51,575 INFO L225 Difference]: With dead ends: 2630 [2022-12-14 10:32:51,575 INFO L226 Difference]: Without dead ends: 2630 [2022-12-14 10:32:51,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=166, Invalid=1172, Unknown=2, NotChecked=142, Total=1482 [2022-12-14 10:32:51,576 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 79 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-14 10:32:51,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 85 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 910 Invalid, 0 Unknown, 90 Unchecked, 1.6s Time] [2022-12-14 10:32:51,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2022-12-14 10:32:51,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2396. [2022-12-14 10:32:51,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2396 states, 2361 states have (on average 4.361287590004236) internal successors, (10297), 2395 states have internal predecessors, (10297), 0 states have call successors, (0), 0 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 10:32:51,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 10297 transitions. [2022-12-14 10:32:51,612 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 10297 transitions. Word has length 13 [2022-12-14 10:32:51,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:32:51,612 INFO L495 AbstractCegarLoop]: Abstraction has 2396 states and 10297 transitions. [2022-12-14 10:32:51,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 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 10:32:51,612 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 10297 transitions. [2022-12-14 10:32:51,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 10:32:51,613 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:32:51,613 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:32:51,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-12-14 10:32:51,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2022-12-14 10:32:51,814 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:32:51,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:32:51,816 INFO L85 PathProgramCache]: Analyzing trace with hash 837324748, now seen corresponding path program 6 times [2022-12-14 10:32:51,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:32:51,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069690938] [2022-12-14 10:32:51,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:32:51,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:32:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:32:52,519 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:32:52,519 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:32:52,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069690938] [2022-12-14 10:32:52,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069690938] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:32:52,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784689274] [2022-12-14 10:32:52,519 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 10:32:52,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:32:52,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:32:52,520 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:32:52,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-12-14 10:32:52,752 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 10:32:52,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:32:52,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-14 10:32:52,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:32:53,065 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 10:32:53,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:32:53,163 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 10:32:53,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:32:53,261 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 10:32:53,540 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:32:53,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:32:54,112 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:32:54,112 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 29 treesize of output 30 [2022-12-14 10:32:54,128 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:32:54,129 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 159 treesize of output 149 [2022-12-14 10:32:54,136 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 134 treesize of output 126 [2022-12-14 10:32:54,142 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 126 treesize of output 110 [2022-12-14 10:32:54,577 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:32:54,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784689274] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:32:54,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [434276583] [2022-12-14 10:32:54,578 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 10:32:54,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:32:54,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-12-14 10:32:54,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623905335] [2022-12-14 10:32:54,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:32:54,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 10:32:54,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:32:54,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 10:32:54,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=942, Unknown=10, NotChecked=0, Total=1056 [2022-12-14 10:32:54,579 INFO L87 Difference]: Start difference. First operand 2396 states and 10297 transitions. Second operand has 33 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 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 10:32:58,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:32:58,209 INFO L93 Difference]: Finished difference Result 2858 states and 11710 transitions. [2022-12-14 10:32:58,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 10:32:58,210 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 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 14 [2022-12-14 10:32:58,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:32:58,217 INFO L225 Difference]: With dead ends: 2858 [2022-12-14 10:32:58,217 INFO L226 Difference]: Without dead ends: 2858 [2022-12-14 10:32:58,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=197, Invalid=1353, Unknown=10, NotChecked=0, Total=1560 [2022-12-14 10:32:58,218 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 147 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-12-14 10:32:58,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 190 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-12-14 10:32:58,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2022-12-14 10:32:58,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2424. [2022-12-14 10:32:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2424 states, 2389 states have (on average 4.373796567601507) internal successors, (10449), 2423 states have internal predecessors, (10449), 0 states have call successors, (0), 0 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 10:32:58,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 2424 states and 10449 transitions. [2022-12-14 10:32:58,258 INFO L78 Accepts]: Start accepts. Automaton has 2424 states and 10449 transitions. Word has length 14 [2022-12-14 10:32:58,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:32:58,258 INFO L495 AbstractCegarLoop]: Abstraction has 2424 states and 10449 transitions. [2022-12-14 10:32:58,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 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 10:32:58,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 10449 transitions. [2022-12-14 10:32:58,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 10:32:58,259 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:32:58,259 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:32:58,265 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-12-14 10:32:58,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2022-12-14 10:32:58,460 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:32:58,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:32:58,461 INFO L85 PathProgramCache]: Analyzing trace with hash 837324749, now seen corresponding path program 3 times [2022-12-14 10:32:58,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:32:58,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771314723] [2022-12-14 10:32:58,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:32:58,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:32:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:32:59,145 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:32:59,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:32:59,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771314723] [2022-12-14 10:32:59,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771314723] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:32:59,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244986523] [2022-12-14 10:32:59,145 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 10:32:59,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:32:59,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:32:59,146 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:32:59,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-12-14 10:32:59,407 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 10:32:59,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:32:59,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-14 10:32:59,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:32:59,725 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 10:32:59,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:32:59,819 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 10:32:59,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:32:59,909 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 10:33:00,293 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:33:00,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:33:01,017 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:33:01,017 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 27 treesize of output 28 [2022-12-14 10:33:01,033 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:33:01,033 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 71 treesize of output 67 [2022-12-14 10:33:01,039 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 54 treesize of output 46 [2022-12-14 10:33:01,045 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 24 treesize of output 20 [2022-12-14 10:33:01,473 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:33:01,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244986523] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:33:01,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [946657008] [2022-12-14 10:33:01,474 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 10:33:01,474 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:33:01,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2022-12-14 10:33:01,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286097175] [2022-12-14 10:33:01,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:33:01,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 10:33:01,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:33:01,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 10:33:01,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1075, Unknown=8, NotChecked=0, Total=1190 [2022-12-14 10:33:01,475 INFO L87 Difference]: Start difference. First operand 2424 states and 10449 transitions. Second operand has 35 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 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 10:33:04,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:33:04,888 INFO L93 Difference]: Finished difference Result 2834 states and 11620 transitions. [2022-12-14 10:33:04,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 10:33:04,889 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 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 14 [2022-12-14 10:33:04,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:33:04,896 INFO L225 Difference]: With dead ends: 2834 [2022-12-14 10:33:04,896 INFO L226 Difference]: Without dead ends: 2834 [2022-12-14 10:33:04,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=240, Invalid=1914, Unknown=8, NotChecked=0, Total=2162 [2022-12-14 10:33:04,896 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 205 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-12-14 10:33:04,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 129 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-12-14 10:33:04,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2022-12-14 10:33:04,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2424. [2022-12-14 10:33:04,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2424 states, 2389 states have (on average 4.36207618250314) internal successors, (10421), 2423 states have internal predecessors, (10421), 0 states have call successors, (0), 0 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 10:33:04,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 2424 states and 10421 transitions. [2022-12-14 10:33:04,936 INFO L78 Accepts]: Start accepts. Automaton has 2424 states and 10421 transitions. Word has length 14 [2022-12-14 10:33:04,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:33:04,936 INFO L495 AbstractCegarLoop]: Abstraction has 2424 states and 10421 transitions. [2022-12-14 10:33:04,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 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 10:33:04,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 10421 transitions. [2022-12-14 10:33:04,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 10:33:04,937 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:33:04,937 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:33:04,943 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2022-12-14 10:33:05,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,54 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:33:05,138 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:33:05,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:33:05,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1024846385, now seen corresponding path program 2 times [2022-12-14 10:33:05,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:33:05,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123974399] [2022-12-14 10:33:05,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:33:05,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:33:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:33:06,445 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:33:06,445 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:33:06,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123974399] [2022-12-14 10:33:06,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123974399] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:33:06,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23236783] [2022-12-14 10:33:06,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:33:06,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:33:06,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:33:06,447 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:33:06,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-12-14 10:33:06,749 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 10:33:06,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:33:06,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 10:33:06,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:33:06,931 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 16 treesize of output 12 [2022-12-14 10:33:07,052 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 31 treesize of output 30 [2022-12-14 10:33:07,204 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:33:07,205 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 1 case distinctions, treesize of input 44 treesize of output 46 [2022-12-14 10:33:07,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:33:07,414 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 48 treesize of output 46 [2022-12-14 10:33:07,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:33:07,640 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 48 treesize of output 46 [2022-12-14 10:33:07,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:33:07,846 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 48 treesize of output 46 [2022-12-14 10:33:08,325 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:33:08,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:33:09,726 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:33:09,726 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 3 case distinctions, treesize of input 50 treesize of output 61 [2022-12-14 10:33:09,773 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:33:09,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 371 treesize of output 369 [2022-12-14 10:33:09,784 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 314 treesize of output 266 [2022-12-14 10:33:09,798 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 133 treesize of output 121 [2022-12-14 10:33:09,810 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 254 treesize of output 230 [2022-12-14 10:33:10,630 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:33:10,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23236783] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:33:10,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [454464730] [2022-12-14 10:33:10,631 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 10:33:10,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:33:10,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-12-14 10:33:10,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302429859] [2022-12-14 10:33:10,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:33:10,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 10:33:10,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:33:10,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 10:33:10,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=863, Unknown=4, NotChecked=0, Total=992 [2022-12-14 10:33:10,632 INFO L87 Difference]: Start difference. First operand 2424 states and 10421 transitions. Second operand has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 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 10:33:24,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:33:24,406 INFO L93 Difference]: Finished difference Result 4978 states and 20706 transitions. [2022-12-14 10:33:24,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 10:33:24,407 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 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 14 [2022-12-14 10:33:24,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:33:24,422 INFO L225 Difference]: With dead ends: 4978 [2022-12-14 10:33:24,422 INFO L226 Difference]: Without dead ends: 4978 [2022-12-14 10:33:24,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=445, Invalid=2287, Unknown=24, NotChecked=0, Total=2756 [2022-12-14 10:33:24,423 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 606 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 49 mSolverCounterUnsat, 122 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 122 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-12-14 10:33:24,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 153 Invalid, 1692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1521 Invalid, 122 Unknown, 0 Unchecked, 7.4s Time] [2022-12-14 10:33:24,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4978 states. [2022-12-14 10:33:24,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4978 to 3161. [2022-12-14 10:33:24,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3161 states, 3126 states have (on average 4.46001279590531) internal successors, (13942), 3160 states have internal predecessors, (13942), 0 states have call successors, (0), 0 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 10:33:24,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3161 states to 3161 states and 13942 transitions. [2022-12-14 10:33:24,490 INFO L78 Accepts]: Start accepts. Automaton has 3161 states and 13942 transitions. Word has length 14 [2022-12-14 10:33:24,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:33:24,490 INFO L495 AbstractCegarLoop]: Abstraction has 3161 states and 13942 transitions. [2022-12-14 10:33:24,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 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 10:33:24,490 INFO L276 IsEmpty]: Start isEmpty. Operand 3161 states and 13942 transitions. [2022-12-14 10:33:24,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 10:33:24,491 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:33:24,491 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:33:24,496 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2022-12-14 10:33:24,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,55 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:33:24,692 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:33:24,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:33:24,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1024846386, now seen corresponding path program 2 times [2022-12-14 10:33:24,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:33:24,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775964000] [2022-12-14 10:33:24,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:33:24,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:33:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:33:26,009 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:33:26,009 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:33:26,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775964000] [2022-12-14 10:33:26,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775964000] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:33:26,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430663268] [2022-12-14 10:33:26,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 10:33:26,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:33:26,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:33:26,010 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:33:26,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-12-14 10:33:26,246 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 10:33:26,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:33:26,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-14 10:33:26,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:33:26,451 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 16 treesize of output 12 [2022-12-14 10:33:26,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 23 treesize of output 22 [2022-12-14 10:33:26,775 INFO L321 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-12-14 10:33:26,775 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 3 case distinctions, treesize of input 34 treesize of output 48 [2022-12-14 10:33:27,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:33:27,050 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 36 treesize of output 34 [2022-12-14 10:33:27,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:33:27,255 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 36 treesize of output 34 [2022-12-14 10:33:27,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:33:27,450 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 36 treesize of output 34 [2022-12-14 10:33:27,922 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:33:27,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:33:29,311 INFO L321 Elim1Store]: treesize reduction 43, result has 57.4 percent of original size [2022-12-14 10:33:29,312 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 3 case distinctions, treesize of input 48 treesize of output 79 [2022-12-14 10:33:29,387 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:33:29,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 370 treesize of output 393 [2022-12-14 10:33:29,402 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 296 treesize of output 240 [2022-12-14 10:33:29,418 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 240 treesize of output 212 [2022-12-14 10:33:29,433 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 212 treesize of output 198 [2022-12-14 10:33:30,755 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:33:30,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430663268] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:33:30,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2007694126] [2022-12-14 10:33:30,755 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 10:33:30,756 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:33:30,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-12-14 10:33:30,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281211798] [2022-12-14 10:33:30,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:33:30,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 10:33:30,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:33:30,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 10:33:30,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=856, Unknown=12, NotChecked=0, Total=992 [2022-12-14 10:33:30,757 INFO L87 Difference]: Start difference. First operand 3161 states and 13942 transitions. Second operand has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 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 10:33:37,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:33:43,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:33:43,637 INFO L93 Difference]: Finished difference Result 4292 states and 17862 transitions. [2022-12-14 10:33:43,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 10:33:43,637 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 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 14 [2022-12-14 10:33:43,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:33:43,649 INFO L225 Difference]: With dead ends: 4292 [2022-12-14 10:33:43,649 INFO L226 Difference]: Without dead ends: 4258 [2022-12-14 10:33:43,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=331, Invalid=1815, Unknown=16, NotChecked=0, Total=2162 [2022-12-14 10:33:43,650 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 317 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 1505 mSolverCounterSat, 25 mSolverCounterUnsat, 34 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 1564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1505 IncrementalHoareTripleChecker+Invalid, 34 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-12-14 10:33:43,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 164 Invalid, 1564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1505 Invalid, 34 Unknown, 0 Unchecked, 7.3s Time] [2022-12-14 10:33:43,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4258 states. [2022-12-14 10:33:43,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4258 to 3460. [2022-12-14 10:33:43,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3460 states, 3425 states have (on average 4.463357664233577) internal successors, (15287), 3459 states have internal predecessors, (15287), 0 states have call successors, (0), 0 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 10:33:43,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3460 states to 3460 states and 15287 transitions. [2022-12-14 10:33:43,727 INFO L78 Accepts]: Start accepts. Automaton has 3460 states and 15287 transitions. Word has length 14 [2022-12-14 10:33:43,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:33:43,727 INFO L495 AbstractCegarLoop]: Abstraction has 3460 states and 15287 transitions. [2022-12-14 10:33:43,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 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 10:33:43,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3460 states and 15287 transitions. [2022-12-14 10:33:43,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 10:33:43,728 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:33:43,728 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1] [2022-12-14 10:33:43,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-12-14 10:33:43,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-12-14 10:33:43,929 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:33:43,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:33:43,930 INFO L85 PathProgramCache]: Analyzing trace with hash -2093818325, now seen corresponding path program 3 times [2022-12-14 10:33:43,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:33:43,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68097421] [2022-12-14 10:33:43,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:33:43,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:33:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:33:44,707 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:33:44,707 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:33:44,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68097421] [2022-12-14 10:33:44,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68097421] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:33:44,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473167242] [2022-12-14 10:33:44,707 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 10:33:44,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:33:44,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:33:44,709 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:33:44,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-12-14 10:33:44,917 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 10:33:44,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:33:44,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-14 10:33:44,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:33:45,174 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 10:33:45,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:33:45,276 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 27 treesize of output 26 [2022-12-14 10:33:45,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:33:45,377 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 10:33:45,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:33:45,527 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 10:33:45,741 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:33:45,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:33:45,971 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3030 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3030) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 12))))) is different from false [2022-12-14 10:33:46,517 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3030 (Array Int Int)) (v_ArrVal_3028 Int) (v_ArrVal_3029 (Array Int Int))) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~3#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_3028)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3029) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3030) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-12-14 10:33:46,562 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-12-14 10:33:46,562 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 10:33:46,579 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:33:46,579 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 81 treesize of output 77 [2022-12-14 10:33:46,588 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 10:33:46,593 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 58 treesize of output 50 [2022-12-14 10:33:46,975 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-12-14 10:33:46,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473167242] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:33:46,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [620962886] [2022-12-14 10:33:46,976 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 10:33:46,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:33:46,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2022-12-14 10:33:46,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701479437] [2022-12-14 10:33:46,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:33:46,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-14 10:33:46,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:33:46,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-14 10:33:46,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1070, Unknown=13, NotChecked=134, Total=1332 [2022-12-14 10:33:46,977 INFO L87 Difference]: Start difference. First operand 3460 states and 15287 transitions. Second operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 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 10:33:50,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:33:50,484 INFO L93 Difference]: Finished difference Result 4175 states and 17524 transitions. [2022-12-14 10:33:50,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 10:33:50,485 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 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 14 [2022-12-14 10:33:50,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:33:50,497 INFO L225 Difference]: With dead ends: 4175 [2022-12-14 10:33:50,497 INFO L226 Difference]: Without dead ends: 4175 [2022-12-14 10:33:50,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=196, Invalid=1439, Unknown=13, NotChecked=158, Total=1806 [2022-12-14 10:33:50,497 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 140 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-12-14 10:33:50,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 141 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1328 Invalid, 0 Unknown, 153 Unchecked, 2.7s Time] [2022-12-14 10:33:50,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4175 states. [2022-12-14 10:33:50,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4175 to 3511. [2022-12-14 10:33:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3511 states, 3476 states have (on average 4.474971231300345) internal successors, (15555), 3510 states have internal predecessors, (15555), 0 states have call successors, (0), 0 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 10:33:50,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3511 states to 3511 states and 15555 transitions. [2022-12-14 10:33:50,562 INFO L78 Accepts]: Start accepts. Automaton has 3511 states and 15555 transitions. Word has length 14 [2022-12-14 10:33:50,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:33:50,562 INFO L495 AbstractCegarLoop]: Abstraction has 3511 states and 15555 transitions. [2022-12-14 10:33:50,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 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 10:33:50,562 INFO L276 IsEmpty]: Start isEmpty. Operand 3511 states and 15555 transitions. [2022-12-14 10:33:50,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 10:33:50,563 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:33:50,563 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1] [2022-12-14 10:33:50,568 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-12-14 10:33:50,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2022-12-14 10:33:50,764 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:33:50,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:33:50,765 INFO L85 PathProgramCache]: Analyzing trace with hash -2093818324, now seen corresponding path program 4 times [2022-12-14 10:33:50,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:33:50,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588203122] [2022-12-14 10:33:50,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:33:50,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:33:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:33:51,618 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:33:51,618 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:33:51,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588203122] [2022-12-14 10:33:51,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588203122] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:33:51,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569512157] [2022-12-14 10:33:51,618 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 10:33:51,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:33:51,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:33:51,619 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:33:51,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-12-14 10:33:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:33:51,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-14 10:33:51,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:33:52,188 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 10:33:52,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:33:52,300 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 10:33:52,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:33:52,400 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 10:33:52,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:33:52,566 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 10:33:52,842 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:33:52,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:33:53,133 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3092 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3092) c_~A~0.base) (+ (* |c_thread1Thread1of1ForFork1_~i~0#1| 4) c_~A~0.offset 12)) 4294967296)) is different from false [2022-12-14 10:33:53,253 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3091 (Array Int Int)) (v_ArrVal_3092 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3091) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_3092) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-12-14 10:33:53,487 INFO L321 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-12-14 10:33:53,487 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 34 treesize of output 40 [2022-12-14 10:33:53,506 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:33:53,506 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 141 treesize of output 131 [2022-12-14 10:33:53,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 110 [2022-12-14 10:33:53,519 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 110 treesize of output 94 [2022-12-14 10:33:53,950 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-12-14 10:33:53,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569512157] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:33:53,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1903772057] [2022-12-14 10:33:53,951 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 10:33:53,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:33:53,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2022-12-14 10:33:53,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131962733] [2022-12-14 10:33:53,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:33:53,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-14 10:33:53,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:33:53,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-14 10:33:53,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1068, Unknown=17, NotChecked=134, Total=1332 [2022-12-14 10:33:53,952 INFO L87 Difference]: Start difference. First operand 3511 states and 15555 transitions. Second operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 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 10:33:57,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:33:57,110 INFO L93 Difference]: Finished difference Result 4163 states and 17487 transitions. [2022-12-14 10:33:57,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 10:33:57,111 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 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 14 [2022-12-14 10:33:57,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:33:57,122 INFO L225 Difference]: With dead ends: 4163 [2022-12-14 10:33:57,122 INFO L226 Difference]: Without dead ends: 4163 [2022-12-14 10:33:57,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=194, Invalid=1437, Unknown=17, NotChecked=158, Total=1806 [2022-12-14 10:33:57,123 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 192 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-12-14 10:33:57,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 130 Invalid, 1356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1203 Invalid, 0 Unknown, 131 Unchecked, 2.4s Time] [2022-12-14 10:33:57,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4163 states. [2022-12-14 10:33:57,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4163 to 3511. [2022-12-14 10:33:57,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3511 states, 3476 states have (on average 4.46029919447641) internal successors, (15504), 3510 states have internal predecessors, (15504), 0 states have call successors, (0), 0 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 10:33:57,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3511 states to 3511 states and 15504 transitions. [2022-12-14 10:33:57,196 INFO L78 Accepts]: Start accepts. Automaton has 3511 states and 15504 transitions. Word has length 14 [2022-12-14 10:33:57,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:33:57,196 INFO L495 AbstractCegarLoop]: Abstraction has 3511 states and 15504 transitions. [2022-12-14 10:33:57,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 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 10:33:57,196 INFO L276 IsEmpty]: Start isEmpty. Operand 3511 states and 15504 transitions. [2022-12-14 10:33:57,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 10:33:57,197 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:33:57,197 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1] [2022-12-14 10:33:57,202 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-12-14 10:33:57,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69,58 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:33:57,398 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:33:57,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:33:57,399 INFO L85 PathProgramCache]: Analyzing trace with hash -2078118468, now seen corresponding path program 6 times [2022-12-14 10:33:57,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:33:57,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887405196] [2022-12-14 10:33:57,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:33:57,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:33:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:33:58,135 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:33:58,135 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:33:58,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887405196] [2022-12-14 10:33:58,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887405196] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:33:58,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084948932] [2022-12-14 10:33:58,136 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 10:33:58,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:33:58,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:33:58,137 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:33:58,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-12-14 10:33:58,379 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 10:33:58,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 10:33:58,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-14 10:33:58,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:33:58,671 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 10:33:58,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:33:58,749 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 10:33:59,215 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:33:59,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:33:59,707 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3147 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3147) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456))) is different from false [2022-12-14 10:33:59,723 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:33:59,723 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 26 treesize of output 27 [2022-12-14 10:33:59,743 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:33:59,743 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 43 treesize of output 39 [2022-12-14 10:34:00,233 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-12-14 10:34:00,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084948932] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:34:00,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [725947169] [2022-12-14 10:34:00,234 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 10:34:00,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:34:00,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2022-12-14 10:34:00,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525908900] [2022-12-14 10:34:00,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:34:00,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 10:34:00,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:34:00,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 10:34:00,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1224, Unknown=1, NotChecked=70, Total=1406 [2022-12-14 10:34:00,236 INFO L87 Difference]: Start difference. First operand 3511 states and 15504 transitions. Second operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 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 10:34:03,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:34:03,816 INFO L93 Difference]: Finished difference Result 3853 states and 16496 transitions. [2022-12-14 10:34:03,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 10:34:03,817 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 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 14 [2022-12-14 10:34:03,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:34:03,828 INFO L225 Difference]: With dead ends: 3853 [2022-12-14 10:34:03,828 INFO L226 Difference]: Without dead ends: 3853 [2022-12-14 10:34:03,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=220, Invalid=2233, Unknown=1, NotChecked=96, Total=2550 [2022-12-14 10:34:03,829 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 151 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-12-14 10:34:03,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 113 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1317 Invalid, 0 Unknown, 72 Unchecked, 2.2s Time] [2022-12-14 10:34:03,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2022-12-14 10:34:03,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3514. [2022-12-14 10:34:03,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3514 states, 3479 states have (on average 4.459902270767462) internal successors, (15516), 3513 states have internal predecessors, (15516), 0 states have call successors, (0), 0 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 10:34:03,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 15516 transitions. [2022-12-14 10:34:03,903 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 15516 transitions. Word has length 14 [2022-12-14 10:34:03,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:34:03,904 INFO L495 AbstractCegarLoop]: Abstraction has 3514 states and 15516 transitions. [2022-12-14 10:34:03,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 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 10:34:03,904 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 15516 transitions. [2022-12-14 10:34:03,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 10:34:03,904 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:34:03,904 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1] [2022-12-14 10:34:03,910 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2022-12-14 10:34:04,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,59 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:34:04,105 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:34:04,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:34:04,106 INFO L85 PathProgramCache]: Analyzing trace with hash -2078118467, now seen corresponding path program 4 times [2022-12-14 10:34:04,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:34:04,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658025288] [2022-12-14 10:34:04,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:34:04,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:34:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:34:04,833 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:34:04,834 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:34:04,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658025288] [2022-12-14 10:34:04,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658025288] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:34:04,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559611355] [2022-12-14 10:34:04,834 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 10:34:04,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:34:04,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:34:04,835 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:34:04,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-12-14 10:34:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:34:05,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-14 10:34:05,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:34:05,399 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 10:34:05,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:05,490 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 10:34:05,769 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:34:05,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:34:06,098 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3202 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_3202) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296)) is different from false [2022-12-14 10:34:06,110 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:06,110 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 24 treesize of output 25 [2022-12-14 10:34:06,122 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:06,123 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 37 treesize of output 33 [2022-12-14 10:34:06,143 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 7 treesize of output 3 [2022-12-14 10:34:06,446 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-12-14 10:34:06,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559611355] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 10:34:06,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [71278328] [2022-12-14 10:34:06,447 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 10:34:06,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 10:34:06,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2022-12-14 10:34:06,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450867775] [2022-12-14 10:34:06,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 10:34:06,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 10:34:06,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 10:34:06,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 10:34:06,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1084, Unknown=1, NotChecked=66, Total=1260 [2022-12-14 10:34:06,449 INFO L87 Difference]: Start difference. First operand 3514 states and 15516 transitions. Second operand has 36 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 0 states have call successors, (0), 0 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 10:34:09,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 10:34:09,088 INFO L93 Difference]: Finished difference Result 3881 states and 16605 transitions. [2022-12-14 10:34:09,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 10:34:09,089 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 0 states have call successors, (0), 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 14 [2022-12-14 10:34:09,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 10:34:09,100 INFO L225 Difference]: With dead ends: 3881 [2022-12-14 10:34:09,100 INFO L226 Difference]: Without dead ends: 3881 [2022-12-14 10:34:09,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=174, Invalid=1551, Unknown=1, NotChecked=80, Total=1806 [2022-12-14 10:34:09,100 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 125 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-12-14 10:34:09,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 99 Invalid, 1281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1207 Invalid, 0 Unknown, 70 Unchecked, 2.1s Time] [2022-12-14 10:34:09,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3881 states. [2022-12-14 10:34:09,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3881 to 3514. [2022-12-14 10:34:09,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3514 states, 3479 states have (on average 4.459039954009773) internal successors, (15513), 3513 states have internal predecessors, (15513), 0 states have call successors, (0), 0 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 10:34:09,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 15513 transitions. [2022-12-14 10:34:09,164 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 15513 transitions. Word has length 14 [2022-12-14 10:34:09,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 10:34:09,164 INFO L495 AbstractCegarLoop]: Abstraction has 3514 states and 15513 transitions. [2022-12-14 10:34:09,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 0 states have call successors, (0), 0 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 10:34:09,164 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 15513 transitions. [2022-12-14 10:34:09,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 10:34:09,164 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 10:34:09,165 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 10:34:09,170 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2022-12-14 10:34:09,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,60 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:34:09,365 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 50 more)] === [2022-12-14 10:34:09,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 10:34:09,366 INFO L85 PathProgramCache]: Analyzing trace with hash -2108905879, now seen corresponding path program 1 times [2022-12-14 10:34:09,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 10:34:09,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495328333] [2022-12-14 10:34:09,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:34:09,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 10:34:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:34:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:34:11,692 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 10:34:11,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495328333] [2022-12-14 10:34:11,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495328333] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 10:34:11,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986795560] [2022-12-14 10:34:11,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 10:34:11,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 10:34:11,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 10:34:11,693 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 10:34:11,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57d25ab2-cdf0-4f4c-91ae-867ca7c7bc2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-12-14 10:34:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 10:34:11,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-14 10:34:11,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 10:34:12,173 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 10:34:12,304 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 10:34:12,305 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 10:34:12,603 INFO L321 Elim1Store]: treesize reduction 38, result has 55.3 percent of original size [2022-12-14 10:34:12,604 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 3 case distinctions, treesize of input 41 treesize of output 69 [2022-12-14 10:34:12,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:12,990 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 43 [2022-12-14 10:34:13,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:13,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2022-12-14 10:34:14,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 10:34:14,100 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 95 treesize of output 81 [2022-12-14 10:34:14,699 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 10:34:14,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 10:34:25,197 WARN L233 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:34:36,200 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 94 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:34:36,676 INFO L321 Elim1Store]: treesize reduction 204, result has 47.8 percent of original size [2022-12-14 10:34:36,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 472 treesize of output 452 [2022-12-14 10:34:36,712 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 920 treesize of output 899 [2022-12-14 10:34:36,735 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 852 treesize of output 804 [2022-12-14 10:34:36,915 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:36,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 851 treesize of output 929 [2022-12-14 10:34:36,969 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:36,969 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 782 treesize of output 777 [2022-12-14 10:34:37,025 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:37,025 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 766 treesize of output 745 [2022-12-14 10:34:37,253 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:37,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1008 treesize of output 1080 [2022-12-14 10:34:37,310 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 933 treesize of output 909 [2022-12-14 10:34:37,377 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:37,378 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 909 treesize of output 900 [2022-12-14 10:34:37,448 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:37,448 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 889 treesize of output 890 [2022-12-14 10:34:37,489 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 879 treesize of output 855 [2022-12-14 10:34:37,551 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:37,551 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 855 treesize of output 846 [2022-12-14 10:34:37,619 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:37,619 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 835 treesize of output 836 [2022-12-14 10:34:37,861 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 10:34:37,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 872 treesize of output 956