./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/weaver/parallel-parallel-sum-1.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_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/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_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/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_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/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 54b834084fe1393c06cef2b14fb31f788537bd44a8744d5b4241cffc72e1d744 --- 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 03:15:10,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 03:15:10,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 03:15:10,175 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 03:15:10,175 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 03:15:10,176 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 03:15:10,177 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 03:15:10,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 03:15:10,179 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 03:15:10,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 03:15:10,180 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 03:15:10,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 03:15:10,181 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 03:15:10,181 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 03:15:10,182 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 03:15:10,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 03:15:10,183 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 03:15:10,184 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 03:15:10,185 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 03:15:10,186 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 03:15:10,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 03:15:10,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 03:15:10,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 03:15:10,189 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 03:15:10,191 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 03:15:10,191 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 03:15:10,192 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 03:15:10,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 03:15:10,193 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 03:15:10,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 03:15:10,193 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 03:15:10,194 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 03:15:10,194 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 03:15:10,195 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 03:15:10,195 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 03:15:10,196 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 03:15:10,196 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 03:15:10,196 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 03:15:10,196 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 03:15:10,197 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 03:15:10,197 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 03:15:10,198 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-12-14 03:15:10,229 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 03:15:10,229 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 03:15:10,233 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 03:15:10,233 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 03:15:10,234 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 03:15:10,234 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 03:15:10,234 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 03:15:10,234 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 03:15:10,235 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 03:15:10,235 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 03:15:10,235 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 03:15:10,235 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 03:15:10,235 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 03:15:10,235 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 03:15:10,236 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 03:15:10,236 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 03:15:10,236 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 03:15:10,236 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 03:15:10,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 03:15:10,237 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 03:15:10,237 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 03:15:10,237 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 03:15:10,237 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 03:15:10,238 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 03:15:10,238 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 03:15:10,238 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 03:15:10,238 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 03:15:10,238 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 03:15:10,238 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 03:15:10,239 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 03:15:10,239 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 03:15:10,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 03:15:10,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 03:15:10,239 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 03:15:10,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 03:15:10,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 03:15:10,240 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 03:15:10,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 03:15:10,240 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 03:15:10,240 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 03:15:10,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 03:15:10,241 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 03:15:10,241 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 03:15:10,241 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_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/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_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/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 -> 54b834084fe1393c06cef2b14fb31f788537bd44a8744d5b4241cffc72e1d744 [2022-12-14 03:15:10,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 03:15:10,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 03:15:10,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 03:15:10,457 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 03:15:10,457 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 03:15:10,458 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c [2022-12-14 03:15:13,030 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 03:15:13,203 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 03:15:13,203 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c [2022-12-14 03:15:13,208 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/data/a962f33ce/34e965f531624d42ab6951c1fb0ad102/FLAGa40da8496 [2022-12-14 03:15:13,607 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/data/a962f33ce/34e965f531624d42ab6951c1fb0ad102 [2022-12-14 03:15:13,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 03:15:13,610 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 03:15:13,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 03:15:13,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 03:15:13,614 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 03:15:13,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:15:13" (1/1) ... [2022-12-14 03:15:13,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b71a934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:15:13, skipping insertion in model container [2022-12-14 03:15:13,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:15:13" (1/1) ... [2022-12-14 03:15:13,620 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 03:15:13,633 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 03:15:13,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:15:13,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:15:13,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:15:13,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:15:13,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:15:13,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:15:13,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:15:13,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:15:13,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:15:13,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:15:13,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:15:13,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:15:13,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:15:13,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:15:13,745 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:15:13,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:15:13,753 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_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c[3642,3655] [2022-12-14 03:15:13,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 03:15:13,764 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 03:15:13,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:15:13,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:15:13,774 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:15:13,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:15:13,775 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:15:13,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:15:13,776 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:15:13,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:15:13,777 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:15:13,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:15:13,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:15:13,778 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:15:13,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:15:13,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:15:13,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 03:15:13,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 03:15:13,785 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_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/sv-benchmarks/c/weaver/parallel-parallel-sum-1.wvr.c[3642,3655] [2022-12-14 03:15:13,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 03:15:13,798 INFO L208 MainTranslator]: Completed translation [2022-12-14 03:15:13,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:15:13 WrapperNode [2022-12-14 03:15:13,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 03:15:13,799 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 03:15:13,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 03:15:13,799 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 03:15:13,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:15:13" (1/1) ... [2022-12-14 03:15:13,810 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:15:13" (1/1) ... [2022-12-14 03:15:13,831 INFO L138 Inliner]: procedures = 27, calls = 68, calls flagged for inlining = 18, calls inlined = 24, statements flattened = 365 [2022-12-14 03:15:13,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 03:15:13,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 03:15:13,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 03:15:13,832 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 03:15:13,839 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:15:13" (1/1) ... [2022-12-14 03:15:13,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:15:13" (1/1) ... [2022-12-14 03:15:13,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:15:13" (1/1) ... [2022-12-14 03:15:13,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:15:13" (1/1) ... [2022-12-14 03:15:13,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:15:13" (1/1) ... [2022-12-14 03:15:13,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:15:13" (1/1) ... [2022-12-14 03:15:13,853 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:15:13" (1/1) ... [2022-12-14 03:15:13,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:15:13" (1/1) ... [2022-12-14 03:15:13,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 03:15:13,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 03:15:13,858 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 03:15:13,858 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 03:15:13,858 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:15:13" (1/1) ... [2022-12-14 03:15:13,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 03:15:13,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:15:13,882 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 03:15:13,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 03:15:13,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 03:15:13,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 03:15:13,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 03:15:13,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 03:15:13,917 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-14 03:15:13,917 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-14 03:15:13,917 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-14 03:15:13,917 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-14 03:15:13,917 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-14 03:15:13,917 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-14 03:15:13,917 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-14 03:15:13,917 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-14 03:15:13,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 03:15:13,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-14 03:15:13,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-14 03:15:13,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 03:15:13,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 03:15:13,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 03:15:13,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 03:15:13,919 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 03:15:14,009 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 03:15:14,011 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 03:15:14,431 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 03:15:14,844 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 03:15:14,844 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-14 03:15:14,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:15:14 BoogieIcfgContainer [2022-12-14 03:15:14,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 03:15:14,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 03:15:14,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 03:15:14,853 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 03:15:14,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:15:13" (1/3) ... [2022-12-14 03:15:14,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2d60cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:15:14, skipping insertion in model container [2022-12-14 03:15:14,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:15:13" (2/3) ... [2022-12-14 03:15:14,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2d60cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:15:14, skipping insertion in model container [2022-12-14 03:15:14,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:15:14" (3/3) ... [2022-12-14 03:15:14,855 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1.wvr.c [2022-12-14 03:15:14,862 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 03:15:14,870 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 03:15:14,870 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2022-12-14 03:15:14,870 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 03:15:15,022 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-14 03:15:15,046 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 03:15:15,057 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 243 places, 245 transitions, 522 flow [2022-12-14 03:15:15,059 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 243 places, 245 transitions, 522 flow [2022-12-14 03:15:15,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 243 places, 245 transitions, 522 flow [2022-12-14 03:15:15,119 INFO L130 PetriNetUnfolder]: 15/241 cut-off events. [2022-12-14 03:15:15,119 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-14 03:15:15,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 241 events. 15/241 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 270 event pairs, 0 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 194. Up to 2 conditions per place. [2022-12-14 03:15:15,127 INFO L119 LiptonReduction]: Number of co-enabled transitions 5712 [2022-12-14 03:15:28,380 INFO L134 LiptonReduction]: Checked pairs total: 20309 [2022-12-14 03:15:28,380 INFO L136 LiptonReduction]: Total number of compositions: 263 [2022-12-14 03:15:28,387 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 71 transitions, 174 flow [2022-12-14 03:15:29,203 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 35133 states, 28569 states have (on average 5.4109699324442575) internal successors, (154586), 35132 states have internal predecessors, (154586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:29,216 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 03:15:29,221 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;@e9fb6cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 03:15:29,221 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2022-12-14 03:15:29,272 INFO L276 IsEmpty]: Start isEmpty. Operand has 35133 states, 28569 states have (on average 5.4109699324442575) internal successors, (154586), 35132 states have internal predecessors, (154586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:29,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-12-14 03:15:29,276 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:15:29,277 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-12-14 03:15:29,277 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:15:29,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:15:29,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1562, now seen corresponding path program 1 times [2022-12-14 03:15:29,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:15:29,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51744073] [2022-12-14 03:15:29,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:29,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:15:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:29,364 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 03:15:29,364 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:15:29,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51744073] [2022-12-14 03:15:29,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51744073] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:15:29,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:15:29,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-14 03:15:29,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943757954] [2022-12-14 03:15:29,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:15:29,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 03:15:29,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:15:29,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 03:15:29,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 03:15:29,423 INFO L87 Difference]: Start difference. First operand has 35133 states, 28569 states have (on average 5.4109699324442575) internal successors, (154586), 35132 states have internal predecessors, (154586), 0 states have call successors, (0), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:29,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:15:29,868 INFO L93 Difference]: Finished difference Result 16395 states and 71736 transitions. [2022-12-14 03:15:29,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 03:15:29,870 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2022-12-14 03:15:29,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:15:30,045 INFO L225 Difference]: With dead ends: 16395 [2022-12-14 03:15:30,045 INFO L226 Difference]: Without dead ends: 16395 [2022-12-14 03:15:30,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 03:15:30,048 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:15:30,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:15:30,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16395 states. [2022-12-14 03:15:30,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16395 to 16395. [2022-12-14 03:15:30,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16395 states, 13993 states have (on average 5.12656328164082) internal successors, (71736), 16394 states have internal predecessors, (71736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:30,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16395 states to 16395 states and 71736 transitions. [2022-12-14 03:15:30,879 INFO L78 Accepts]: Start accepts. Automaton has 16395 states and 71736 transitions. Word has length 1 [2022-12-14 03:15:30,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:15:30,880 INFO L495 AbstractCegarLoop]: Abstraction has 16395 states and 71736 transitions. [2022-12-14 03:15:30,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:30,881 INFO L276 IsEmpty]: Start isEmpty. Operand 16395 states and 71736 transitions. [2022-12-14 03:15:30,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 03:15:30,881 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:15:30,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 03:15:30,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 03:15:30,882 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:15:30,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:15:30,882 INFO L85 PathProgramCache]: Analyzing trace with hash 49957, now seen corresponding path program 1 times [2022-12-14 03:15:30,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:15:30,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392896001] [2022-12-14 03:15:30,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:30,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:15:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:31,011 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 03:15:31,011 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:15:31,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392896001] [2022-12-14 03:15:31,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392896001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:15:31,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:15:31,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 03:15:31,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432979135] [2022-12-14 03:15:31,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:15:31,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 03:15:31,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:15:31,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 03:15:31,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 03:15:31,014 INFO L87 Difference]: Start difference. First operand 16395 states and 71736 transitions. 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 03:15:31,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:15:31,514 INFO L93 Difference]: Finished difference Result 32787 states and 143469 transitions. [2022-12-14 03:15:31,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 03:15:31,514 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 03:15:31,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:15:31,777 INFO L225 Difference]: With dead ends: 32787 [2022-12-14 03:15:31,777 INFO L226 Difference]: Without dead ends: 32787 [2022-12-14 03:15:31,777 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 03:15:31,778 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:15:31,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:15:31,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32787 states. [2022-12-14 03:15:32,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32787 to 16396. [2022-12-14 03:15:32,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16396 states, 13994 states have (on average 5.126339859939974) internal successors, (71738), 16395 states have internal predecessors, (71738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:32,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16396 states to 16396 states and 71738 transitions. [2022-12-14 03:15:32,440 INFO L78 Accepts]: Start accepts. Automaton has 16396 states and 71738 transitions. Word has length 2 [2022-12-14 03:15:32,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:15:32,441 INFO L495 AbstractCegarLoop]: Abstraction has 16396 states and 71738 transitions. [2022-12-14 03:15:32,441 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 03:15:32,441 INFO L276 IsEmpty]: Start isEmpty. Operand 16396 states and 71738 transitions. [2022-12-14 03:15:32,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 03:15:32,441 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:15:32,441 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 03:15:32,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 03:15:32,442 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:15:32,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:15:32,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1550202, now seen corresponding path program 1 times [2022-12-14 03:15:32,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:15:32,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914886055] [2022-12-14 03:15:32,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:32,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:15:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:32,555 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 03:15:32,555 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:15:32,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914886055] [2022-12-14 03:15:32,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914886055] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:15:32,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656043074] [2022-12-14 03:15:32,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:32,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:15:32,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:15:32,557 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:15:32,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 03:15:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:32,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 03:15:32,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:15:32,700 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 03:15:32,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:15:32,711 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 03:15:32,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656043074] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:15:32,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [444573306] [2022-12-14 03:15:32,718 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 03:15:32,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:15:32,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2022-12-14 03:15:32,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152970156] [2022-12-14 03:15:32,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:15:32,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 03:15:32,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:15:32,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 03:15:32,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 03:15:32,721 INFO L87 Difference]: Start difference. First operand 16396 states and 71738 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 03:15:33,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:15:33,923 INFO L93 Difference]: Finished difference Result 81963 states and 358671 transitions. [2022-12-14 03:15:33,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 03:15:33,923 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 03:15:33,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:15:34,435 INFO L225 Difference]: With dead ends: 81963 [2022-12-14 03:15:34,435 INFO L226 Difference]: Without dead ends: 81963 [2022-12-14 03:15:34,435 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 03:15:34,436 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 257 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 03:15:34,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 0 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 03:15:34,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81963 states. [2022-12-14 03:15:35,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81963 to 16399. [2022-12-14 03:15:35,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16399 states, 13997 states have (on average 5.125884118025291) internal successors, (71747), 16398 states have internal predecessors, (71747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:35,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16399 states to 16399 states and 71747 transitions. [2022-12-14 03:15:35,457 INFO L78 Accepts]: Start accepts. Automaton has 16399 states and 71747 transitions. Word has length 3 [2022-12-14 03:15:35,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:15:35,458 INFO L495 AbstractCegarLoop]: Abstraction has 16399 states and 71747 transitions. [2022-12-14 03:15:35,458 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 03:15:35,458 INFO L276 IsEmpty]: Start isEmpty. Operand 16399 states and 71747 transitions. [2022-12-14 03:15:35,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 03:15:35,458 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:15:35,458 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 03:15:35,464 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 03:15:35,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:15:35,660 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:15:35,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:15:35,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1550158, now seen corresponding path program 1 times [2022-12-14 03:15:35,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:15:35,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820489385] [2022-12-14 03:15:35,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:35,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:15:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:35,720 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 03:15:35,720 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:15:35,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820489385] [2022-12-14 03:15:35,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820489385] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:15:35,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204505551] [2022-12-14 03:15:35,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:35,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:15:35,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:15:35,722 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:15:35,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 03:15:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:35,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 03:15:35,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:15:35,980 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 03:15:35,980 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 03:15:35,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204505551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:15:35,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 03:15:35,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 3 [2022-12-14 03:15:35,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983530245] [2022-12-14 03:15:35,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:15:35,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 03:15:35,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:15:35,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 03:15:35,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 03:15:35,983 INFO L87 Difference]: Start difference. First operand 16399 states and 71747 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 03:15:36,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:15:36,436 INFO L93 Difference]: Finished difference Result 32789 states and 143474 transitions. [2022-12-14 03:15:36,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 03:15:36,436 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 03:15:36,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:15:36,625 INFO L225 Difference]: With dead ends: 32789 [2022-12-14 03:15:36,625 INFO L226 Difference]: Without dead ends: 32789 [2022-12-14 03:15:36,625 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 03:15:36,626 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 104 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:15:36,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 0 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:15:36,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32789 states. [2022-12-14 03:15:37,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32789 to 16398. [2022-12-14 03:15:37,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16398 states, 13997 states have (on average 5.125598342501965) internal successors, (71743), 16397 states have internal predecessors, (71743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:37,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16398 states to 16398 states and 71743 transitions. [2022-12-14 03:15:37,335 INFO L78 Accepts]: Start accepts. Automaton has 16398 states and 71743 transitions. Word has length 3 [2022-12-14 03:15:37,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:15:37,335 INFO L495 AbstractCegarLoop]: Abstraction has 16398 states and 71743 transitions. [2022-12-14 03:15:37,335 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 03:15:37,336 INFO L276 IsEmpty]: Start isEmpty. Operand 16398 states and 71743 transitions. [2022-12-14 03:15:37,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 03:15:37,336 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:15:37,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 03:15:37,340 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 03:15:37,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:15:37,538 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:15:37,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:15:37,539 INFO L85 PathProgramCache]: Analyzing trace with hash 48058739, now seen corresponding path program 1 times [2022-12-14 03:15:37,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:15:37,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833208093] [2022-12-14 03:15:37,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:37,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:15:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:37,650 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 03:15:37,651 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:15:37,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833208093] [2022-12-14 03:15:37,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833208093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:15:37,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:15:37,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 03:15:37,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413410218] [2022-12-14 03:15:37,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:15:37,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 03:15:37,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:15:37,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 03:15:37,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 03:15:37,652 INFO L87 Difference]: Start difference. First operand 16398 states and 71743 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:38,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:15:38,102 INFO L93 Difference]: Finished difference Result 29531 states and 129103 transitions. [2022-12-14 03:15:38,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 03:15:38,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-12-14 03:15:38,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:15:38,354 INFO L225 Difference]: With dead ends: 29531 [2022-12-14 03:15:38,354 INFO L226 Difference]: Without dead ends: 29531 [2022-12-14 03:15:38,354 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 03:15:38,355 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 84 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 03:15:38,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 0 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 03:15:38,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29531 states. [2022-12-14 03:15:38,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29531 to 21835. [2022-12-14 03:15:38,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21835 states, 19434 states have (on average 5.646701656889987) internal successors, (109738), 21834 states have internal predecessors, (109738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:38,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21835 states to 21835 states and 109738 transitions. [2022-12-14 03:15:38,949 INFO L78 Accepts]: Start accepts. Automaton has 21835 states and 109738 transitions. Word has length 4 [2022-12-14 03:15:38,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:15:38,950 INFO L495 AbstractCegarLoop]: Abstraction has 21835 states and 109738 transitions. [2022-12-14 03:15:38,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:38,950 INFO L276 IsEmpty]: Start isEmpty. Operand 21835 states and 109738 transitions. [2022-12-14 03:15:38,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 03:15:38,950 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:15:38,950 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 03:15:38,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 03:15:38,951 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:15:38,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:15:38,951 INFO L85 PathProgramCache]: Analyzing trace with hash 48058740, now seen corresponding path program 1 times [2022-12-14 03:15:38,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:15:38,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209900844] [2022-12-14 03:15:38,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:38,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:15:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:38,996 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 03:15:38,996 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:15:38,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209900844] [2022-12-14 03:15:38,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209900844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:15:38,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:15:38,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 03:15:38,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344657608] [2022-12-14 03:15:38,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:15:38,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 03:15:38,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:15:38,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 03:15:38,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 03:15:38,998 INFO L87 Difference]: Start difference. First operand 21835 states and 109738 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:39,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:15:39,217 INFO L93 Difference]: Finished difference Result 17847 states and 87969 transitions. [2022-12-14 03:15:39,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 03:15:39,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-12-14 03:15:39,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:15:39,320 INFO L225 Difference]: With dead ends: 17847 [2022-12-14 03:15:39,320 INFO L226 Difference]: Without dead ends: 17847 [2022-12-14 03:15:39,320 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 03:15:39,321 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:15:39,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 0 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:15:39,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17847 states. [2022-12-14 03:15:39,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17847 to 17847. [2022-12-14 03:15:39,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17847 states, 16083 states have (on average 5.46968849095318) internal successors, (87969), 17846 states have internal predecessors, (87969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:39,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17847 states to 17847 states and 87969 transitions. [2022-12-14 03:15:39,929 INFO L78 Accepts]: Start accepts. Automaton has 17847 states and 87969 transitions. Word has length 4 [2022-12-14 03:15:39,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:15:39,929 INFO L495 AbstractCegarLoop]: Abstraction has 17847 states and 87969 transitions. [2022-12-14 03:15:39,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:39,930 INFO L276 IsEmpty]: Start isEmpty. Operand 17847 states and 87969 transitions. [2022-12-14 03:15:39,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 03:15:39,930 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:15:39,930 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 03:15:39,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 03:15:39,930 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:15:39,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:15:39,931 INFO L85 PathProgramCache]: Analyzing trace with hash 48058824, now seen corresponding path program 1 times [2022-12-14 03:15:39,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:15:39,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49912583] [2022-12-14 03:15:39,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:39,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:15:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:39,987 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 03:15:39,988 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:15:39,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49912583] [2022-12-14 03:15:39,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49912583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:15:39,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:15:39,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 03:15:39,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223486691] [2022-12-14 03:15:39,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:15:39,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 03:15:39,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:15:39,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 03:15:39,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 03:15:39,989 INFO L87 Difference]: Start difference. First operand 17847 states and 87969 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:40,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:15:40,343 INFO L93 Difference]: Finished difference Result 14223 states and 68542 transitions. [2022-12-14 03:15:40,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 03:15:40,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-12-14 03:15:40,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:15:40,417 INFO L225 Difference]: With dead ends: 14223 [2022-12-14 03:15:40,417 INFO L226 Difference]: Without dead ends: 14223 [2022-12-14 03:15:40,417 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 03:15:40,418 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:15:40,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:15:40,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14223 states. [2022-12-14 03:15:40,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14223 to 14223. [2022-12-14 03:15:40,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14223 states, 12998 states have (on average 5.273272811201723) internal successors, (68542), 14222 states have internal predecessors, (68542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14223 states to 14223 states and 68542 transitions. [2022-12-14 03:15:40,755 INFO L78 Accepts]: Start accepts. Automaton has 14223 states and 68542 transitions. Word has length 4 [2022-12-14 03:15:40,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:15:40,755 INFO L495 AbstractCegarLoop]: Abstraction has 14223 states and 68542 transitions. [2022-12-14 03:15:40,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:40,756 INFO L276 IsEmpty]: Start isEmpty. Operand 14223 states and 68542 transitions. [2022-12-14 03:15:40,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 03:15:40,756 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:15:40,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 03:15:40,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 03:15:40,756 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:15:40,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:15:40,757 INFO L85 PathProgramCache]: Analyzing trace with hash 48058825, now seen corresponding path program 1 times [2022-12-14 03:15:40,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:15:40,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369980199] [2022-12-14 03:15:40,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:40,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:15:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:40,841 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 03:15:40,842 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:15:40,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369980199] [2022-12-14 03:15:40,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369980199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:15:40,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:15:40,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 03:15:40,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788853467] [2022-12-14 03:15:40,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:15:40,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 03:15:40,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:15:40,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 03:15:40,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 03:15:40,843 INFO L87 Difference]: Start difference. First operand 14223 states and 68542 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:40,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:15:40,992 INFO L93 Difference]: Finished difference Result 10963 states and 51457 transitions. [2022-12-14 03:15:40,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 03:15:40,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-12-14 03:15:40,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:15:41,040 INFO L225 Difference]: With dead ends: 10963 [2022-12-14 03:15:41,040 INFO L226 Difference]: Without dead ends: 10963 [2022-12-14 03:15:41,040 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 03:15:41,041 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:15:41,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 0 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:15:41,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10963 states. [2022-12-14 03:15:41,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10963 to 10963. [2022-12-14 03:15:41,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10963 states, 10179 states have (on average 5.055211710384124) internal successors, (51457), 10962 states have internal predecessors, (51457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:41,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10963 states to 10963 states and 51457 transitions. [2022-12-14 03:15:41,282 INFO L78 Accepts]: Start accepts. Automaton has 10963 states and 51457 transitions. Word has length 4 [2022-12-14 03:15:41,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:15:41,282 INFO L495 AbstractCegarLoop]: Abstraction has 10963 states and 51457 transitions. [2022-12-14 03:15:41,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:41,282 INFO L276 IsEmpty]: Start isEmpty. Operand 10963 states and 51457 transitions. [2022-12-14 03:15:41,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 03:15:41,283 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:15:41,283 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 03:15:41,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 03:15:41,283 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:15:41,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:15:41,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1489794184, now seen corresponding path program 1 times [2022-12-14 03:15:41,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:15:41,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023368038] [2022-12-14 03:15:41,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:41,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:15:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:41,374 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 03:15:41,375 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:15:41,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023368038] [2022-12-14 03:15:41,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023368038] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:15:41,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862051155] [2022-12-14 03:15:41,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:41,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:15:41,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:15:41,376 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:15:41,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 03:15:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:41,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 03:15:41,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:15:41,504 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 03:15:41,504 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 03:15:41,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862051155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:15:41,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 03:15:41,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2022-12-14 03:15:41,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459899822] [2022-12-14 03:15:41,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:15:41,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 03:15:41,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:15:41,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 03:15:41,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 03:15:41,506 INFO L87 Difference]: Start difference. First operand 10963 states and 51457 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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 03:15:41,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:15:41,599 INFO L93 Difference]: Finished difference Result 7047 states and 33519 transitions. [2022-12-14 03:15:41,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 03:15:41,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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 03:15:41,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:15:41,626 INFO L225 Difference]: With dead ends: 7047 [2022-12-14 03:15:41,626 INFO L226 Difference]: Without dead ends: 7047 [2022-12-14 03:15:41,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 03:15:41,626 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:15:41,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:15:41,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7047 states. [2022-12-14 03:15:41,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7047 to 4444. [2022-12-14 03:15:41,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4444 states, 4120 states have (on average 4.64368932038835) internal successors, (19132), 4443 states have internal predecessors, (19132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:41,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4444 states to 4444 states and 19132 transitions. [2022-12-14 03:15:41,730 INFO L78 Accepts]: Start accepts. Automaton has 4444 states and 19132 transitions. Word has length 5 [2022-12-14 03:15:41,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:15:41,730 INFO L495 AbstractCegarLoop]: Abstraction has 4444 states and 19132 transitions. [2022-12-14 03:15:41,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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 03:15:41,730 INFO L276 IsEmpty]: Start isEmpty. Operand 4444 states and 19132 transitions. [2022-12-14 03:15:41,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 03:15:41,731 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:15:41,731 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 03:15:41,735 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-14 03:15:41,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-14 03:15:41,932 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:15:41,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:15:41,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1489822080, now seen corresponding path program 1 times [2022-12-14 03:15:41,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:15:41,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292387143] [2022-12-14 03:15:41,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:41,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:15:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:42,052 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 03:15:42,052 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:15:42,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292387143] [2022-12-14 03:15:42,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292387143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:15:42,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:15:42,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 03:15:42,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991853564] [2022-12-14 03:15:42,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:15:42,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 03:15:42,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:15:42,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 03:15:42,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 03:15:42,054 INFO L87 Difference]: Start difference. First operand 4444 states and 19132 transitions. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 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 03:15:42,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:15:42,179 INFO L93 Difference]: Finished difference Result 5425 states and 22424 transitions. [2022-12-14 03:15:42,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 03:15:42,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 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 03:15:42,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:15:42,198 INFO L225 Difference]: With dead ends: 5425 [2022-12-14 03:15:42,198 INFO L226 Difference]: Without dead ends: 5417 [2022-12-14 03:15:42,198 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 03:15:42,199 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 64 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:15:42,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 0 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:15:42,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5417 states. [2022-12-14 03:15:42,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5417 to 5007. [2022-12-14 03:15:42,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5007 states, 4683 states have (on average 4.541106128550075) internal successors, (21266), 5006 states have internal predecessors, (21266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:42,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5007 states to 5007 states and 21266 transitions. [2022-12-14 03:15:42,287 INFO L78 Accepts]: Start accepts. Automaton has 5007 states and 21266 transitions. Word has length 5 [2022-12-14 03:15:42,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:15:42,287 INFO L495 AbstractCegarLoop]: Abstraction has 5007 states and 21266 transitions. [2022-12-14 03:15:42,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 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 03:15:42,287 INFO L276 IsEmpty]: Start isEmpty. Operand 5007 states and 21266 transitions. [2022-12-14 03:15:42,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 03:15:42,288 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:15:42,288 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1] [2022-12-14 03:15:42,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 03:15:42,288 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:15:42,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:15:42,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1061048219, now seen corresponding path program 2 times [2022-12-14 03:15:42,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:15:42,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390675515] [2022-12-14 03:15:42,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:42,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:15:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:42,343 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 03:15:42,343 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:15:42,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390675515] [2022-12-14 03:15:42,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390675515] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:15:42,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461978940] [2022-12-14 03:15:42,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 03:15:42,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:15:42,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:15:42,344 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:15:42,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 03:15:42,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-14 03:15:42,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 03:15:42,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 03:15:42,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:15:42,482 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 03:15:42,482 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 03:15:42,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461978940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:15:42,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 03:15:42,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2022-12-14 03:15:42,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417971203] [2022-12-14 03:15:42,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:15:42,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 03:15:42,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:15:42,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 03:15:42,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-14 03:15:42,483 INFO L87 Difference]: Start difference. First operand 5007 states and 21266 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 03:15:42,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:15:42,566 INFO L93 Difference]: Finished difference Result 5006 states and 21265 transitions. [2022-12-14 03:15:42,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 03:15:42,567 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 03:15:42,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:15:42,585 INFO L225 Difference]: With dead ends: 5006 [2022-12-14 03:15:42,585 INFO L226 Difference]: Without dead ends: 5006 [2022-12-14 03:15:42,585 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 03:15:42,586 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:15:42,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:15:42,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5006 states. [2022-12-14 03:15:42,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5006 to 5003. [2022-12-14 03:15:42,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5003 states, 4680 states have (on average 4.542521367521368) internal successors, (21259), 5002 states have internal predecessors, (21259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:42,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5003 states to 5003 states and 21259 transitions. [2022-12-14 03:15:42,695 INFO L78 Accepts]: Start accepts. Automaton has 5003 states and 21259 transitions. Word has length 6 [2022-12-14 03:15:42,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:15:42,695 INFO L495 AbstractCegarLoop]: Abstraction has 5003 states and 21259 transitions. [2022-12-14 03:15:42,695 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 03:15:42,695 INFO L276 IsEmpty]: Start isEmpty. Operand 5003 states and 21259 transitions. [2022-12-14 03:15:42,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 03:15:42,695 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:15:42,696 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 03:15:42,701 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 03:15:42,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-14 03:15:42,897 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:15:42,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:15:42,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1061019381, now seen corresponding path program 1 times [2022-12-14 03:15:42,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:15:42,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162394739] [2022-12-14 03:15:42,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:42,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:15:42,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:43,041 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 03:15:43,041 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:15:43,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162394739] [2022-12-14 03:15:43,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162394739] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:15:43,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125651035] [2022-12-14 03:15:43,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:43,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:15:43,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:15:43,043 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:15:43,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 03:15:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:43,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 03:15:43,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:15:43,248 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 03:15:43,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:15:43,290 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 03:15:43,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125651035] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:15:43,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1082885151] [2022-12-14 03:15:43,291 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 03:15:43,292 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:15:43,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-14 03:15:43,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260820478] [2022-12-14 03:15:43,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:15:43,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 03:15:43,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:15:43,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 03:15:43,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-14 03:15:43,294 INFO L87 Difference]: Start difference. First operand 5003 states and 21259 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:43,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:15:43,593 INFO L93 Difference]: Finished difference Result 6395 states and 25686 transitions. [2022-12-14 03:15:43,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 03:15:43,593 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 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 03:15:43,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:15:43,627 INFO L225 Difference]: With dead ends: 6395 [2022-12-14 03:15:43,627 INFO L226 Difference]: Without dead ends: 6387 [2022-12-14 03:15:43,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-12-14 03:15:43,628 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 128 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 03:15:43,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 0 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 03:15:43,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6387 states. [2022-12-14 03:15:43,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6387 to 5004. [2022-12-14 03:15:43,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5004 states, 4681 states have (on average 4.541978209784234) internal successors, (21261), 5003 states have internal predecessors, (21261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:43,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5004 states to 5004 states and 21261 transitions. [2022-12-14 03:15:43,774 INFO L78 Accepts]: Start accepts. Automaton has 5004 states and 21261 transitions. Word has length 6 [2022-12-14 03:15:43,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:15:43,774 INFO L495 AbstractCegarLoop]: Abstraction has 5004 states and 21261 transitions. [2022-12-14 03:15:43,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:43,774 INFO L276 IsEmpty]: Start isEmpty. Operand 5004 states and 21261 transitions. [2022-12-14 03:15:43,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 03:15:43,774 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:15:43,774 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2022-12-14 03:15:43,779 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 03:15:43,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 03:15:43,976 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:15:43,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:15:43,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1467273952, now seen corresponding path program 2 times [2022-12-14 03:15:43,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:15:43,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199919933] [2022-12-14 03:15:43,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:43,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:15:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:44,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:15:44,410 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:15:44,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199919933] [2022-12-14 03:15:44,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199919933] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:15:44,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212208138] [2022-12-14 03:15:44,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 03:15:44,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:15:44,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:15:44,412 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:15:44,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 03:15:44,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 03:15:44,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 03:15:44,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-14 03:15:44,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:15:44,642 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 03:15:44,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:15:44,702 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 03:15:44,740 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 21 treesize of output 9 [2022-12-14 03:15:44,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:15:44,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:15:44,843 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:15:44,843 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 03:15:44,852 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:15:44,853 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 03:15:44,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:15:44,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212208138] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:15:44,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1018195290] [2022-12-14 03:15:44,932 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 03:15:44,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:15:44,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-14 03:15:44,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073038402] [2022-12-14 03:15:44,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:15:44,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 03:15:44,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:15:44,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 03:15:44,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-12-14 03:15:44,934 INFO L87 Difference]: Start difference. First operand 5004 states and 21261 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 03:15:45,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:15:45,871 INFO L93 Difference]: Finished difference Result 10102 states and 43029 transitions. [2022-12-14 03:15:45,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 03:15:45,872 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 03:15:45,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:15:45,920 INFO L225 Difference]: With dead ends: 10102 [2022-12-14 03:15:45,920 INFO L226 Difference]: Without dead ends: 10102 [2022-12-14 03:15:45,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2022-12-14 03:15:45,920 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 514 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 03:15:45,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 0 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 628 Invalid, 1 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 03:15:45,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10102 states. [2022-12-14 03:15:46,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10102 to 5743. [2022-12-14 03:15:46,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5743 states, 5420 states have (on average 4.65719557195572) internal successors, (25242), 5742 states have internal predecessors, (25242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:46,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5743 states to 5743 states and 25242 transitions. [2022-12-14 03:15:46,120 INFO L78 Accepts]: Start accepts. Automaton has 5743 states and 25242 transitions. Word has length 7 [2022-12-14 03:15:46,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:15:46,120 INFO L495 AbstractCegarLoop]: Abstraction has 5743 states and 25242 transitions. [2022-12-14 03:15:46,120 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 03:15:46,120 INFO L276 IsEmpty]: Start isEmpty. Operand 5743 states and 25242 transitions. [2022-12-14 03:15:46,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 03:15:46,121 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:15:46,121 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2022-12-14 03:15:46,125 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 03:15:46,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:15:46,323 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:15:46,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:15:46,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1467273953, now seen corresponding path program 1 times [2022-12-14 03:15:46,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:15:46,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628464067] [2022-12-14 03:15:46,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:46,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:15:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:46,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:15:46,747 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:15:46,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628464067] [2022-12-14 03:15:46,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628464067] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:15:46,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934150852] [2022-12-14 03:15:46,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:46,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:15:46,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:15:46,748 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:15:46,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 03:15:46,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:46,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-14 03:15:46,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:15:46,933 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 03:15:46,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:15:46,967 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 03:15:47,003 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-12-14 03:15:47,004 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 22 treesize of output 10 [2022-12-14 03:15:47,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:15:47,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:15:47,073 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_494 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_494) |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 03:15:47,082 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:15:47,083 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 03:15:47,089 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:15:47,089 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 03:15:47,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 03:15:47,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934150852] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:15:47,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1548791963] [2022-12-14 03:15:47,132 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 03:15:47,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:15:47,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-14 03:15:47,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816262754] [2022-12-14 03:15:47,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:15:47,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 03:15:47,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:15:47,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 03:15:47,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=203, Unknown=1, NotChecked=28, Total=272 [2022-12-14 03:15:47,134 INFO L87 Difference]: Start difference. First operand 5743 states and 25242 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 03:15:48,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:15:48,140 INFO L93 Difference]: Finished difference Result 14535 states and 61410 transitions. [2022-12-14 03:15:48,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 03:15:48,140 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 03:15:48,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:15:48,209 INFO L225 Difference]: With dead ends: 14535 [2022-12-14 03:15:48,209 INFO L226 Difference]: Without dead ends: 14535 [2022-12-14 03:15:48,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=693, Unknown=1, NotChecked=56, Total=930 [2022-12-14 03:15:48,210 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 609 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 03:15:48,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 0 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 661 Invalid, 0 Unknown, 99 Unchecked, 0.5s Time] [2022-12-14 03:15:48,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14535 states. [2022-12-14 03:15:48,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14535 to 6476. [2022-12-14 03:15:48,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6476 states, 6153 states have (on average 4.628311392816512) internal successors, (28478), 6475 states have internal predecessors, (28478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:48,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6476 states to 6476 states and 28478 transitions. [2022-12-14 03:15:48,527 INFO L78 Accepts]: Start accepts. Automaton has 6476 states and 28478 transitions. Word has length 7 [2022-12-14 03:15:48,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:15:48,528 INFO L495 AbstractCegarLoop]: Abstraction has 6476 states and 28478 transitions. [2022-12-14 03:15:48,528 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 03:15:48,528 INFO L276 IsEmpty]: Start isEmpty. Operand 6476 states and 28478 transitions. [2022-12-14 03:15:48,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 03:15:48,528 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:15:48,528 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-12-14 03:15:48,533 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 03:15:48,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 03:15:48,730 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:15:48,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:15:48,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1759072452, now seen corresponding path program 1 times [2022-12-14 03:15:48,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:15:48,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476618400] [2022-12-14 03:15:48,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:48,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:15:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:49,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:15:49,072 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:15:49,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476618400] [2022-12-14 03:15:49,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476618400] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:15:49,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850874965] [2022-12-14 03:15:49,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:49,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:15:49,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:15:49,074 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:15:49,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 03:15:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:49,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-14 03:15:49,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:15:49,275 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 03:15:49,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:15:49,330 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 03:15:49,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:15:49,369 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 03:15:49,397 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 17 treesize of output 9 [2022-12-14 03:15:49,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:15:49,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:15:49,522 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:15:49,523 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 03:15:49,530 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:15:49,530 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 03:15:49,535 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 03:15:49,539 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 03:15:49,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:15:49,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850874965] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:15:49,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1047651227] [2022-12-14 03:15:49,633 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 03:15:49,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:15:49,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-14 03:15:49,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402669574] [2022-12-14 03:15:49,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:15:49,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 03:15:49,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:15:49,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 03:15:49,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=280, Unknown=3, NotChecked=0, Total=342 [2022-12-14 03:15:49,635 INFO L87 Difference]: Start difference. First operand 6476 states and 28478 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 03:15:50,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:15:50,762 INFO L93 Difference]: Finished difference Result 13114 states and 56207 transitions. [2022-12-14 03:15:50,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 03:15:50,762 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 8 [2022-12-14 03:15:50,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:15:50,817 INFO L225 Difference]: With dead ends: 13114 [2022-12-14 03:15:50,817 INFO L226 Difference]: Without dead ends: 13114 [2022-12-14 03:15:50,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=209, Invalid=844, Unknown=3, NotChecked=0, Total=1056 [2022-12-14 03:15:50,818 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 468 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 31 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 03:15:50,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 0 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 828 Invalid, 2 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 03:15:50,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13114 states. [2022-12-14 03:15:51,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13114 to 6490. [2022-12-14 03:15:51,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6490 states, 6167 states have (on average 4.626236419652992) internal successors, (28530), 6489 states have internal predecessors, (28530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:51,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6490 states to 6490 states and 28530 transitions. [2022-12-14 03:15:51,052 INFO L78 Accepts]: Start accepts. Automaton has 6490 states and 28530 transitions. Word has length 8 [2022-12-14 03:15:51,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:15:51,052 INFO L495 AbstractCegarLoop]: Abstraction has 6490 states and 28530 transitions. [2022-12-14 03:15:51,053 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 03:15:51,053 INFO L276 IsEmpty]: Start isEmpty. Operand 6490 states and 28530 transitions. [2022-12-14 03:15:51,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 03:15:51,053 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:15:51,053 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-12-14 03:15:51,058 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 03:15:51,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 03:15:51,255 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:15:51,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:15:51,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1759072451, now seen corresponding path program 1 times [2022-12-14 03:15:51,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:15:51,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129614485] [2022-12-14 03:15:51,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:51,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:15:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:51,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:15:51,638 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:15:51,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129614485] [2022-12-14 03:15:51,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129614485] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:15:51,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508978914] [2022-12-14 03:15:51,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:51,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:15:51,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:15:51,640 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:15:51,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 03:15:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:51,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-14 03:15:51,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:15:51,829 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 03:15:51,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:15:51,869 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 03:15:51,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:15:51,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 03:15:51,933 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-12-14 03:15:51,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 22 treesize of output 10 [2022-12-14 03:15:51,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:15:51,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:15:51,990 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_614 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_614) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 4294967296)) is different from false [2022-12-14 03:15:52,055 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:15:52,055 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 03:15:52,063 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:15:52,063 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 03:15:52,068 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 03:15:52,072 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 03:15:52,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:15:52,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508978914] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:15:52,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [69033334] [2022-12-14 03:15:52,145 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 03:15:52,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:15:52,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-14 03:15:52,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536463696] [2022-12-14 03:15:52,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:15:52,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 03:15:52,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:15:52,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 03:15:52,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=4, NotChecked=34, Total=380 [2022-12-14 03:15:52,147 INFO L87 Difference]: Start difference. First operand 6490 states and 28530 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 03:15:53,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:15:53,107 INFO L93 Difference]: Finished difference Result 15274 states and 64682 transitions. [2022-12-14 03:15:53,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 03:15:53,107 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 03:15:53,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:15:53,172 INFO L225 Difference]: With dead ends: 15274 [2022-12-14 03:15:53,172 INFO L226 Difference]: Without dead ends: 15274 [2022-12-14 03:15:53,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=4, NotChecked=52, Total=812 [2022-12-14 03:15:53,173 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 576 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 03:15:53,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 0 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 822 Invalid, 0 Unknown, 173 Unchecked, 0.6s Time] [2022-12-14 03:15:53,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15274 states. [2022-12-14 03:15:53,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15274 to 6490. [2022-12-14 03:15:53,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6490 states, 6167 states have (on average 4.626236419652992) internal successors, (28530), 6489 states have internal predecessors, (28530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:53,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6490 states to 6490 states and 28530 transitions. [2022-12-14 03:15:53,424 INFO L78 Accepts]: Start accepts. Automaton has 6490 states and 28530 transitions. Word has length 8 [2022-12-14 03:15:53,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:15:53,424 INFO L495 AbstractCegarLoop]: Abstraction has 6490 states and 28530 transitions. [2022-12-14 03:15:53,424 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 03:15:53,424 INFO L276 IsEmpty]: Start isEmpty. Operand 6490 states and 28530 transitions. [2022-12-14 03:15:53,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 03:15:53,425 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:15:53,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:15:53,429 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 03:15:53,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 03:15:53,627 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:15:53,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:15:53,628 INFO L85 PathProgramCache]: Analyzing trace with hash -833580226, now seen corresponding path program 1 times [2022-12-14 03:15:53,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:15:53,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093378546] [2022-12-14 03:15:53,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:53,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:15:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:53,688 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 03:15:53,688 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:15:53,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093378546] [2022-12-14 03:15:53,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093378546] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:15:53,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:15:53,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 03:15:53,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944329611] [2022-12-14 03:15:53,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:15:53,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 03:15:53,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:15:53,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 03:15:53,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 03:15:53,690 INFO L87 Difference]: Start difference. First operand 6490 states and 28530 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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 03:15:53,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:15:53,794 INFO L93 Difference]: Finished difference Result 5062 states and 22186 transitions. [2022-12-14 03:15:53,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 03:15:53,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 03:15:53,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:15:53,814 INFO L225 Difference]: With dead ends: 5062 [2022-12-14 03:15:53,814 INFO L226 Difference]: Without dead ends: 5062 [2022-12-14 03:15:53,815 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 03:15:53,815 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:15:53,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:15:53,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5062 states. [2022-12-14 03:15:53,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5062 to 5062. [2022-12-14 03:15:53,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5062 states, 4838 states have (on average 4.585779247622985) internal successors, (22186), 5061 states have internal predecessors, (22186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:53,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5062 states to 5062 states and 22186 transitions. [2022-12-14 03:15:53,954 INFO L78 Accepts]: Start accepts. Automaton has 5062 states and 22186 transitions. Word has length 8 [2022-12-14 03:15:53,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:15:53,954 INFO L495 AbstractCegarLoop]: Abstraction has 5062 states and 22186 transitions. [2022-12-14 03:15:53,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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 03:15:53,954 INFO L276 IsEmpty]: Start isEmpty. Operand 5062 states and 22186 transitions. [2022-12-14 03:15:53,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 03:15:53,954 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:15:53,955 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:15:53,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 03:15:53,955 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:15:53,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:15:53,955 INFO L85 PathProgramCache]: Analyzing trace with hash -833580224, now seen corresponding path program 1 times [2022-12-14 03:15:53,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:15:53,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457094119] [2022-12-14 03:15:53,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:53,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:15:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:53,995 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 03:15:53,995 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:15:53,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457094119] [2022-12-14 03:15:53,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457094119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:15:53,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:15:53,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 03:15:53,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875939831] [2022-12-14 03:15:53,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:15:53,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 03:15:53,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:15:53,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 03:15:53,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 03:15:53,997 INFO L87 Difference]: Start difference. First operand 5062 states and 22186 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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 03:15:54,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:15:54,085 INFO L93 Difference]: Finished difference Result 3814 states and 16646 transitions. [2022-12-14 03:15:54,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 03:15:54,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 03:15:54,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:15:54,099 INFO L225 Difference]: With dead ends: 3814 [2022-12-14 03:15:54,099 INFO L226 Difference]: Without dead ends: 3814 [2022-12-14 03:15:54,099 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 03:15:54,100 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:15:54,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:15:54,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3814 states. [2022-12-14 03:15:54,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3814 to 3814. [2022-12-14 03:15:54,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3814 states, 3671 states have (on average 4.534459275401798) internal successors, (16646), 3813 states have internal predecessors, (16646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:54,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3814 states to 3814 states and 16646 transitions. [2022-12-14 03:15:54,218 INFO L78 Accepts]: Start accepts. Automaton has 3814 states and 16646 transitions. Word has length 8 [2022-12-14 03:15:54,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:15:54,218 INFO L495 AbstractCegarLoop]: Abstraction has 3814 states and 16646 transitions. [2022-12-14 03:15:54,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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 03:15:54,218 INFO L276 IsEmpty]: Start isEmpty. Operand 3814 states and 16646 transitions. [2022-12-14 03:15:54,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 03:15:54,219 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:15:54,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:15:54,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 03:15:54,219 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:15:54,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:15:54,220 INFO L85 PathProgramCache]: Analyzing trace with hash -833580271, now seen corresponding path program 1 times [2022-12-14 03:15:54,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:15:54,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723575265] [2022-12-14 03:15:54,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:54,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:15:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:54,249 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 03:15:54,249 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:15:54,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723575265] [2022-12-14 03:15:54,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723575265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:15:54,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:15:54,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 03:15:54,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746500704] [2022-12-14 03:15:54,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:15:54,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 03:15:54,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:15:54,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 03:15:54,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 03:15:54,251 INFO L87 Difference]: Start difference. First operand 3814 states and 16646 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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 03:15:54,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:15:54,325 INFO L93 Difference]: Finished difference Result 2746 states and 11910 transitions. [2022-12-14 03:15:54,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 03:15:54,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 03:15:54,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:15:54,336 INFO L225 Difference]: With dead ends: 2746 [2022-12-14 03:15:54,336 INFO L226 Difference]: Without dead ends: 2746 [2022-12-14 03:15:54,336 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 03:15:54,337 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:15:54,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:15:54,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2746 states. [2022-12-14 03:15:54,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2746 to 2746. [2022-12-14 03:15:54,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2746 states, 2666 states have (on average 4.467366841710428) internal successors, (11910), 2745 states have internal predecessors, (11910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:54,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2746 states to 2746 states and 11910 transitions. [2022-12-14 03:15:54,405 INFO L78 Accepts]: Start accepts. Automaton has 2746 states and 11910 transitions. Word has length 8 [2022-12-14 03:15:54,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:15:54,405 INFO L495 AbstractCegarLoop]: Abstraction has 2746 states and 11910 transitions. [2022-12-14 03:15:54,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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 03:15:54,405 INFO L276 IsEmpty]: Start isEmpty. Operand 2746 states and 11910 transitions. [2022-12-14 03:15:54,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 03:15:54,406 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:15:54,406 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:15:54,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 03:15:54,406 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:15:54,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:15:54,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1303215293, now seen corresponding path program 1 times [2022-12-14 03:15:54,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:15:54,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245039647] [2022-12-14 03:15:54,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:54,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:15:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:54,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:15:54,834 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:15:54,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245039647] [2022-12-14 03:15:54,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245039647] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:15:54,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379307078] [2022-12-14 03:15:54,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:54,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:15:54,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:15:54,835 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:15:54,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 03:15:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:54,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-14 03:15:54,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:15:55,031 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 03:15:55,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:15:55,073 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 03:15:55,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:15:55,108 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 03:15:55,133 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 21 treesize of output 9 [2022-12-14 03:15:55,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:15:55,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:15:55,167 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_752 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_752) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 9223372039002259456))) is different from false [2022-12-14 03:15:55,235 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:15:55,235 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 03:15:55,242 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:15:55,242 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 03:15:55,246 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 54 [2022-12-14 03:15:55,251 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 03:15:55,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:15:55,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379307078] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:15:55,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [522397170] [2022-12-14 03:15:55,318 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 03:15:55,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:15:55,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2022-12-14 03:15:55,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920720873] [2022-12-14 03:15:55,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:15:55,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 03:15:55,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:15:55,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 03:15:55,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=257, Unknown=7, NotChecked=32, Total=342 [2022-12-14 03:15:55,320 INFO L87 Difference]: Start difference. First operand 2746 states and 11910 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 03:15:56,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:15:56,245 INFO L93 Difference]: Finished difference Result 4844 states and 20843 transitions. [2022-12-14 03:15:56,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 03:15:56,246 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 03:15:56,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:15:56,263 INFO L225 Difference]: With dead ends: 4844 [2022-12-14 03:15:56,263 INFO L226 Difference]: Without dead ends: 4844 [2022-12-14 03:15:56,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=606, Unknown=7, NotChecked=52, Total=812 [2022-12-14 03:15:56,263 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 506 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 03:15:56,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 0 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 847 Invalid, 0 Unknown, 115 Unchecked, 0.5s Time] [2022-12-14 03:15:56,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4844 states. [2022-12-14 03:15:56,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4844 to 3248. [2022-12-14 03:15:56,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3248 states, 3168 states have (on average 4.609217171717172) internal successors, (14602), 3247 states have internal predecessors, (14602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:56,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3248 states to 3248 states and 14602 transitions. [2022-12-14 03:15:56,355 INFO L78 Accepts]: Start accepts. Automaton has 3248 states and 14602 transitions. Word has length 9 [2022-12-14 03:15:56,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:15:56,355 INFO L495 AbstractCegarLoop]: Abstraction has 3248 states and 14602 transitions. [2022-12-14 03:15:56,356 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 03:15:56,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3248 states and 14602 transitions. [2022-12-14 03:15:56,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 03:15:56,356 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:15:56,356 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:15:56,361 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 03:15:56,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:15:56,557 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:15:56,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:15:56,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1303215294, now seen corresponding path program 1 times [2022-12-14 03:15:56,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:15:56,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458362633] [2022-12-14 03:15:56,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:56,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:15:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:56,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:15:56,943 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:15:56,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458362633] [2022-12-14 03:15:56,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458362633] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:15:56,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839590894] [2022-12-14 03:15:56,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:56,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:15:56,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:15:56,945 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:15:56,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 03:15:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:57,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-14 03:15:57,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:15:57,101 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 03:15:57,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:15:57,138 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 03:15:57,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:15:57,174 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 03:15:57,204 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-12-14 03:15:57,204 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 22 treesize of output 10 [2022-12-14 03:15:57,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:15:57,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:15:57,256 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_812 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_812) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 4294967296)) is different from false [2022-12-14 03:15:57,270 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_812 (Array Int Int)) (v_ArrVal_811 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_811) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_812) |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 03:15:57,279 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:15:57,279 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 03:15:57,286 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:15:57,286 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 03:15:57,291 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 03:15:57,297 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 03:15:57,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 03:15:57,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839590894] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:15:57,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [981669705] [2022-12-14 03:15:57,369 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 03:15:57,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:15:57,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-14 03:15:57,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234778979] [2022-12-14 03:15:57,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:15:57,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 03:15:57,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:15:57,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 03:15:57,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=263, Unknown=2, NotChecked=66, Total=380 [2022-12-14 03:15:57,371 INFO L87 Difference]: Start difference. First operand 3248 states and 14602 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 03:15:58,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:15:58,434 INFO L93 Difference]: Finished difference Result 6206 states and 26257 transitions. [2022-12-14 03:15:58,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 03:15:58,435 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 03:15:58,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:15:58,457 INFO L225 Difference]: With dead ends: 6206 [2022-12-14 03:15:58,457 INFO L226 Difference]: Without dead ends: 6206 [2022-12-14 03:15:58,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=802, Unknown=2, NotChecked=122, Total=1122 [2022-12-14 03:15:58,458 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 761 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 290 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 03:15:58,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 0 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 801 Invalid, 0 Unknown, 290 Unchecked, 0.5s Time] [2022-12-14 03:15:58,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6206 states. [2022-12-14 03:15:58,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6206 to 3246. [2022-12-14 03:15:58,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3246 states, 3166 states have (on average 4.455464308275427) internal successors, (14106), 3245 states have internal predecessors, (14106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:58,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3246 states to 3246 states and 14106 transitions. [2022-12-14 03:15:58,559 INFO L78 Accepts]: Start accepts. Automaton has 3246 states and 14106 transitions. Word has length 9 [2022-12-14 03:15:58,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:15:58,559 INFO L495 AbstractCegarLoop]: Abstraction has 3246 states and 14106 transitions. [2022-12-14 03:15:58,559 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 03:15:58,559 INFO L276 IsEmpty]: Start isEmpty. Operand 3246 states and 14106 transitions. [2022-12-14 03:15:58,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 03:15:58,560 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:15:58,560 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:15:58,564 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 03:15:58,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-14 03:15:58,761 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:15:58,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:15:58,762 INFO L85 PathProgramCache]: Analyzing trace with hash -71182025, now seen corresponding path program 1 times [2022-12-14 03:15:58,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:15:58,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029499616] [2022-12-14 03:15:58,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:58,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:15:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:58,901 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 03:15:58,901 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:15:58,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029499616] [2022-12-14 03:15:58,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029499616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 03:15:58,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 03:15:58,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 03:15:58,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18910973] [2022-12-14 03:15:58,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 03:15:58,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 03:15:58,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:15:58,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 03:15:58,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 03:15:58,903 INFO L87 Difference]: Start difference. First operand 3246 states and 14106 transitions. Second operand has 4 states, 4 states have (on average 2.25) 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 03:15:59,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:15:59,019 INFO L93 Difference]: Finished difference Result 3319 states and 14259 transitions. [2022-12-14 03:15:59,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 03:15:59,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) 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 03:15:59,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:15:59,032 INFO L225 Difference]: With dead ends: 3319 [2022-12-14 03:15:59,032 INFO L226 Difference]: Without dead ends: 3246 [2022-12-14 03:15:59,032 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 03:15:59,033 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:15:59,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:15:59,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3246 states. [2022-12-14 03:15:59,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3246 to 3246. [2022-12-14 03:15:59,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3246 states, 3166 states have (on average 4.455148452305749) internal successors, (14105), 3245 states have internal predecessors, (14105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:15:59,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3246 states to 3246 states and 14105 transitions. [2022-12-14 03:15:59,120 INFO L78 Accepts]: Start accepts. Automaton has 3246 states and 14105 transitions. Word has length 9 [2022-12-14 03:15:59,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:15:59,121 INFO L495 AbstractCegarLoop]: Abstraction has 3246 states and 14105 transitions. [2022-12-14 03:15:59,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) 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 03:15:59,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3246 states and 14105 transitions. [2022-12-14 03:15:59,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 03:15:59,121 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:15:59,121 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2022-12-14 03:15:59,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-14 03:15:59,122 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:15:59,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:15:59,122 INFO L85 PathProgramCache]: Analyzing trace with hash 846257363, now seen corresponding path program 1 times [2022-12-14 03:15:59,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:15:59,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191720181] [2022-12-14 03:15:59,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:59,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:15:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:59,424 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:15:59,424 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:15:59,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191720181] [2022-12-14 03:15:59,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191720181] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:15:59,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632555891] [2022-12-14 03:15:59,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:15:59,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:15:59,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:15:59,426 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:15:59,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 03:15:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:15:59,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 03:15:59,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:15:59,633 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 03:15:59,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:15:59,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 03:15:59,719 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 21 treesize of output 9 [2022-12-14 03:15:59,721 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:15:59,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:15:59,829 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:15:59,829 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 03:15:59,835 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:15:59,836 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 03:15:59,910 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:15:59,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632555891] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:15:59,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [47567451] [2022-12-14 03:15:59,911 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 03:15:59,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:15:59,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-12-14 03:15:59,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664736322] [2022-12-14 03:15:59,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:15:59,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 03:15:59,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:15:59,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 03:15:59,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=407, Unknown=1, NotChecked=0, Total=462 [2022-12-14 03:15:59,913 INFO L87 Difference]: Start difference. First operand 3246 states and 14105 transitions. Second operand has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:16:00,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:16:00,724 INFO L93 Difference]: Finished difference Result 8411 states and 36151 transitions. [2022-12-14 03:16:00,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 03:16:00,725 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 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 03:16:00,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:16:00,749 INFO L225 Difference]: With dead ends: 8411 [2022-12-14 03:16:00,749 INFO L226 Difference]: Without dead ends: 8411 [2022-12-14 03:16:00,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=911, Unknown=1, NotChecked=0, Total=1056 [2022-12-14 03:16:00,750 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 389 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 03:16:00,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 0 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 03:16:00,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8411 states. [2022-12-14 03:16:00,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8411 to 3253. [2022-12-14 03:16:00,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3253 states, 3173 states have (on average 4.4535140245824145) internal successors, (14131), 3252 states have internal predecessors, (14131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:16:00,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3253 states to 3253 states and 14131 transitions. [2022-12-14 03:16:00,835 INFO L78 Accepts]: Start accepts. Automaton has 3253 states and 14131 transitions. Word has length 10 [2022-12-14 03:16:00,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:16:00,835 INFO L495 AbstractCegarLoop]: Abstraction has 3253 states and 14131 transitions. [2022-12-14 03:16:00,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:16:00,836 INFO L276 IsEmpty]: Start isEmpty. Operand 3253 states and 14131 transitions. [2022-12-14 03:16:00,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 03:16:00,836 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:16:00,836 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2022-12-14 03:16:00,841 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-14 03:16:01,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-14 03:16:01,037 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:16:01,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:16:01,039 INFO L85 PathProgramCache]: Analyzing trace with hash 846257364, now seen corresponding path program 1 times [2022-12-14 03:16:01,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:16:01,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591579124] [2022-12-14 03:16:01,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:16:01,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:16:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:16:01,274 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:16:01,274 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:16:01,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591579124] [2022-12-14 03:16:01,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591579124] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:16:01,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151746075] [2022-12-14 03:16:01,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:16:01,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:16:01,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:16:01,276 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:16:01,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 03:16:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:16:01,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-14 03:16:01,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:16:01,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 03:16:01,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:16:01,472 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 03:16:01,502 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 19 treesize of output 7 [2022-12-14 03:16:01,503 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:16:01,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:16:01,587 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:16:01,588 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 03:16:01,592 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:16:01,592 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 03:16:01,635 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:16:01,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151746075] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:16:01,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [511943407] [2022-12-14 03:16:01,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 03:16:01,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:16:01,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-12-14 03:16:01,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342879684] [2022-12-14 03:16:01,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:16:01,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 03:16:01,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:16:01,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 03:16:01,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=404, Unknown=4, NotChecked=0, Total=462 [2022-12-14 03:16:01,637 INFO L87 Difference]: Start difference. First operand 3253 states and 14131 transitions. Second operand has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:16:02,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:16:02,324 INFO L93 Difference]: Finished difference Result 8411 states and 35839 transitions. [2022-12-14 03:16:02,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 03:16:02,324 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 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 03:16:02,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:16:02,347 INFO L225 Difference]: With dead ends: 8411 [2022-12-14 03:16:02,348 INFO L226 Difference]: Without dead ends: 8411 [2022-12-14 03:16:02,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=908, Unknown=4, NotChecked=0, Total=1056 [2022-12-14 03:16:02,348 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 371 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 03:16:02,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 0 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 03:16:02,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8411 states. [2022-12-14 03:16:02,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8411 to 3248. [2022-12-14 03:16:02,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3248 states, 3168 states have (on average 4.453914141414141) internal successors, (14110), 3247 states have internal predecessors, (14110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:16:02,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3248 states to 3248 states and 14110 transitions. [2022-12-14 03:16:02,433 INFO L78 Accepts]: Start accepts. Automaton has 3248 states and 14110 transitions. Word has length 10 [2022-12-14 03:16:02,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:16:02,433 INFO L495 AbstractCegarLoop]: Abstraction has 3248 states and 14110 transitions. [2022-12-14 03:16:02,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:16:02,434 INFO L276 IsEmpty]: Start isEmpty. Operand 3248 states and 14110 transitions. [2022-12-14 03:16:02,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 03:16:02,434 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:16:02,434 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:16:02,439 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 03:16:02,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:16:02,635 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:16:02,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:16:02,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1744974954, now seen corresponding path program 1 times [2022-12-14 03:16:02,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:16:02,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000580884] [2022-12-14 03:16:02,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:16:02,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:16:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:16:02,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:16:02,753 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:16:02,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000580884] [2022-12-14 03:16:02,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000580884] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:16:02,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239231772] [2022-12-14 03:16:02,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:16:02,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:16:02,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:16:02,754 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:16:02,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 03:16:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:16:02,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 03:16:02,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:16:02,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:16:02,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:16:02,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:16:02,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239231772] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:16:02,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1844446261] [2022-12-14 03:16:02,965 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 03:16:02,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:16:02,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-14 03:16:02,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026834756] [2022-12-14 03:16:02,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:16:02,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 03:16:02,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:16:02,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 03:16:02,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-12-14 03:16:02,966 INFO L87 Difference]: Start difference. First operand 3248 states and 14110 transitions. Second operand has 15 states, 15 states have (on average 1.5333333333333334) 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 03:16:03,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:16:03,262 INFO L93 Difference]: Finished difference Result 4937 states and 19781 transitions. [2022-12-14 03:16:03,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 03:16:03,263 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) 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 10 [2022-12-14 03:16:03,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:16:03,275 INFO L225 Difference]: With dead ends: 4937 [2022-12-14 03:16:03,275 INFO L226 Difference]: Without dead ends: 4919 [2022-12-14 03:16:03,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2022-12-14 03:16:03,276 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 284 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 03:16:03,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 0 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 03:16:03,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4919 states. [2022-12-14 03:16:03,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4919 to 3851. [2022-12-14 03:16:03,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3851 states, 3771 states have (on average 4.407319013524264) internal successors, (16620), 3850 states have internal predecessors, (16620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:16:03,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3851 states to 3851 states and 16620 transitions. [2022-12-14 03:16:03,347 INFO L78 Accepts]: Start accepts. Automaton has 3851 states and 16620 transitions. Word has length 10 [2022-12-14 03:16:03,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:16:03,347 INFO L495 AbstractCegarLoop]: Abstraction has 3851 states and 16620 transitions. [2022-12-14 03:16:03,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.5333333333333334) 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 03:16:03,347 INFO L276 IsEmpty]: Start isEmpty. Operand 3851 states and 16620 transitions. [2022-12-14 03:16:03,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 03:16:03,347 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:16:03,347 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:16:03,352 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-14 03:16:03,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-14 03:16:03,548 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:16:03,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:16:03,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1745009070, now seen corresponding path program 1 times [2022-12-14 03:16:03,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:16:03,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053552112] [2022-12-14 03:16:03,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:16:03,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:16:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:16:03,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:16:03,835 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:16:03,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053552112] [2022-12-14 03:16:03,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053552112] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:16:03,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312970061] [2022-12-14 03:16:03,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:16:03,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:16:03,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:16:03,836 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:16:03,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 03:16:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:16:04,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-14 03:16:04,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:16:04,076 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 03:16:04,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:16:04,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 03:16:04,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:16:04,171 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 03:16:04,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:16:04,206 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 03:16:04,230 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 17 treesize of output 9 [2022-12-14 03:16:04,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:16:04,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:16:04,390 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:16:04,390 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 03:16:04,398 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:16:04,399 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 2467 treesize of output 2373 [2022-12-14 03:16:04,415 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 2358 treesize of output 2294 [2022-12-14 03:16:04,428 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 2294 treesize of output 2166 [2022-12-14 03:16:04,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 2166 treesize of output 1910 [2022-12-14 03:16:08,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:16:08,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312970061] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:16:08,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1654602583] [2022-12-14 03:16:08,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 03:16:08,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:16:08,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-12-14 03:16:08,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022637039] [2022-12-14 03:16:08,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:16:08,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 03:16:08,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:16:08,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 03:16:08,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=378, Unknown=6, NotChecked=0, Total=462 [2022-12-14 03:16:08,810 INFO L87 Difference]: Start difference. First operand 3851 states and 16620 transitions. Second operand has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:16:09,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:16:09,807 INFO L93 Difference]: Finished difference Result 5949 states and 25410 transitions. [2022-12-14 03:16:09,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 03:16:09,808 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 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 03:16:09,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:16:09,823 INFO L225 Difference]: With dead ends: 5949 [2022-12-14 03:16:09,824 INFO L226 Difference]: Without dead ends: 5949 [2022-12-14 03:16:09,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=215, Invalid=896, Unknown=11, NotChecked=0, Total=1122 [2022-12-14 03:16:09,824 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 676 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 64 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 03:16:09,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 0 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 732 Invalid, 28 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 03:16:09,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5949 states. [2022-12-14 03:16:09,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5949 to 4372. [2022-12-14 03:16:09,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4372 states, 4292 states have (on average 4.504426840633737) internal successors, (19333), 4371 states have internal predecessors, (19333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:16:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4372 states to 4372 states and 19333 transitions. [2022-12-14 03:16:09,909 INFO L78 Accepts]: Start accepts. Automaton has 4372 states and 19333 transitions. Word has length 10 [2022-12-14 03:16:09,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:16:09,909 INFO L495 AbstractCegarLoop]: Abstraction has 4372 states and 19333 transitions. [2022-12-14 03:16:09,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:16:09,909 INFO L276 IsEmpty]: Start isEmpty. Operand 4372 states and 19333 transitions. [2022-12-14 03:16:09,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 03:16:09,909 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:16:09,909 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:16:09,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-14 03:16:10,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-14 03:16:10,110 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:16:10,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:16:10,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1745009071, now seen corresponding path program 1 times [2022-12-14 03:16:10,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:16:10,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544489859] [2022-12-14 03:16:10,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:16:10,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:16:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:16:10,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:16:10,493 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:16:10,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544489859] [2022-12-14 03:16:10,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544489859] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:16:10,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115058385] [2022-12-14 03:16:10,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:16:10,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:16:10,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:16:10,495 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:16:10,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 03:16:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:16:10,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 03:16:10,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:16:10,638 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 22 treesize of output 20 [2022-12-14 03:16:10,684 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 13 treesize of output 9 [2022-12-14 03:16:10,719 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 16 treesize of output 18 [2022-12-14 03:16:10,757 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 16 treesize of output 18 [2022-12-14 03:16:10,786 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 03:16:10,810 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-12-14 03:16:10,811 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 22 treesize of output 10 [2022-12-14 03:16:10,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:16:10,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:16:10,861 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1146 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1146) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 4294967296)) is different from false [2022-12-14 03:16:10,867 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1146 (Array Int Int)) (v_ArrVal_1145 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1145) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1146) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 4294967296)) is different from false [2022-12-14 03:16:10,878 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1146 (Array Int Int)) (v_ArrVal_1145 (Array Int Int)) (v_ArrVal_1144 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1145) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1146) |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 03:16:10,885 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:16:10,885 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 03:16:10,895 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:16:10,896 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 1105 treesize of output 1059 [2022-12-14 03:16:10,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 1046 treesize of output 982 [2022-12-14 03:16:10,914 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 507 treesize of output 475 [2022-12-14 03:16:10,921 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 950 treesize of output 822 [2022-12-14 03:16:13,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 03:16:13,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115058385] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:16:13,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [726378960] [2022-12-14 03:16:13,235 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 03:16:13,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:16:13,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-12-14 03:16:13,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128416478] [2022-12-14 03:16:13,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:16:13,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 03:16:13,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:16:13,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 03:16:13,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=261, Unknown=3, NotChecked=102, Total=420 [2022-12-14 03:16:13,237 INFO L87 Difference]: Start difference. First operand 4372 states and 19333 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 03:16:14,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:16:14,149 INFO L93 Difference]: Finished difference Result 6767 states and 28799 transitions. [2022-12-14 03:16:14,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 03:16:14,149 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 03:16:14,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:16:14,167 INFO L225 Difference]: With dead ends: 6767 [2022-12-14 03:16:14,167 INFO L226 Difference]: Without dead ends: 6761 [2022-12-14 03:16:14,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=530, Unknown=3, NotChecked=150, Total=812 [2022-12-14 03:16:14,168 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 347 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 18 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 227 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 03:16:14,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 0 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 698 Invalid, 4 Unknown, 227 Unchecked, 0.5s Time] [2022-12-14 03:16:14,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6761 states. [2022-12-14 03:16:14,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6761 to 4194. [2022-12-14 03:16:14,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4194 states, 4114 states have (on average 4.490763247447739) internal successors, (18475), 4193 states have internal predecessors, (18475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:16:14,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4194 states to 4194 states and 18475 transitions. [2022-12-14 03:16:14,254 INFO L78 Accepts]: Start accepts. Automaton has 4194 states and 18475 transitions. Word has length 10 [2022-12-14 03:16:14,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:16:14,254 INFO L495 AbstractCegarLoop]: Abstraction has 4194 states and 18475 transitions. [2022-12-14 03:16:14,255 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 03:16:14,255 INFO L276 IsEmpty]: Start isEmpty. Operand 4194 states and 18475 transitions. [2022-12-14 03:16:14,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 03:16:14,255 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:16:14,255 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:16:14,260 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 03:16:14,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:16:14,456 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:16:14,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:16:14,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1745007627, now seen corresponding path program 1 times [2022-12-14 03:16:14,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:16:14,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339914825] [2022-12-14 03:16:14,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:16:14,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:16:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:16:14,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:16:14,810 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:16:14,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339914825] [2022-12-14 03:16:14,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339914825] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:16:14,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188672558] [2022-12-14 03:16:14,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:16:14,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:16:14,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:16:14,811 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:16:14,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 03:16:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:16:14,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 03:16:14,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:16:15,025 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 03:16:15,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:16:15,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 18 treesize of output 20 [2022-12-14 03:16:15,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:16:15,087 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 03:16:15,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:16:15,111 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 03:16:15,126 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 21 treesize of output 9 [2022-12-14 03:16:15,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:16:15,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:16:15,159 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1211 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1211) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 9223372039002259456))) is different from false [2022-12-14 03:16:15,259 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:16:15,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-12-14 03:16:15,267 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:16:15,267 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 619 treesize of output 597 [2022-12-14 03:16:15,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 582 treesize of output 518 [2022-12-14 03:16:15,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 518 treesize of output 486 [2022-12-14 03:16:15,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 486 treesize of output 470 [2022-12-14 03:16:15,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:16:15,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188672558] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:16:15,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [40506316] [2022-12-14 03:16:15,484 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 03:16:15,484 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:16:15,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-12-14 03:16:15,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736777165] [2022-12-14 03:16:15,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:16:15,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 03:16:15,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:16:15,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 03:16:15,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=356, Unknown=10, NotChecked=38, Total=462 [2022-12-14 03:16:15,485 INFO L87 Difference]: Start difference. First operand 4194 states and 18475 transitions. Second operand has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:16:16,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:16:16,396 INFO L93 Difference]: Finished difference Result 6821 states and 29671 transitions. [2022-12-14 03:16:16,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 03:16:16,396 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 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 03:16:16,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:16:16,414 INFO L225 Difference]: With dead ends: 6821 [2022-12-14 03:16:16,414 INFO L226 Difference]: Without dead ends: 6821 [2022-12-14 03:16:16,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=154, Invalid=710, Unknown=10, NotChecked=56, Total=930 [2022-12-14 03:16:16,415 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 560 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 03:16:16,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 0 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 739 Invalid, 0 Unknown, 105 Unchecked, 0.5s Time] [2022-12-14 03:16:16,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6821 states. [2022-12-14 03:16:16,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6821 to 4609. [2022-12-14 03:16:16,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4609 states, 4529 states have (on average 4.560609406049901) internal successors, (20655), 4608 states have internal predecessors, (20655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:16:16,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4609 states to 4609 states and 20655 transitions. [2022-12-14 03:16:16,506 INFO L78 Accepts]: Start accepts. Automaton has 4609 states and 20655 transitions. Word has length 10 [2022-12-14 03:16:16,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:16:16,506 INFO L495 AbstractCegarLoop]: Abstraction has 4609 states and 20655 transitions. [2022-12-14 03:16:16,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:16:16,507 INFO L276 IsEmpty]: Start isEmpty. Operand 4609 states and 20655 transitions. [2022-12-14 03:16:16,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 03:16:16,507 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:16:16,507 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:16:16,512 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-14 03:16:16,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-14 03:16:16,708 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:16:16,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:16:16,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1745007628, now seen corresponding path program 1 times [2022-12-14 03:16:16,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:16:16,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088274930] [2022-12-14 03:16:16,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:16:16,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:16:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:16:17,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:16:17,006 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:16:17,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088274930] [2022-12-14 03:16:17,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088274930] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:16:17,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047486877] [2022-12-14 03:16:17,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:16:17,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:16:17,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:16:17,007 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:16:17,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-14 03:16:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:16:17,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-14 03:16:17,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:16:17,213 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 03:16:17,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:16:17,244 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 03:16:17,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:16:17,273 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 03:16:17,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:16:17,301 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 03:16:17,319 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-12-14 03:16:17,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 22 treesize of output 10 [2022-12-14 03:16:17,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:16:17,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:16:17,395 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1275 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1275) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1276) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 4294967296)) is different from false [2022-12-14 03:16:17,446 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:16:17,447 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 03:16:17,453 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:16:17,454 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 553 treesize of output 531 [2022-12-14 03:16:17,461 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 259 treesize of output 243 [2022-12-14 03:16:17,467 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 502 treesize of output 470 [2022-12-14 03:16:17,472 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 470 treesize of output 406 [2022-12-14 03:16:17,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:16:17,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047486877] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:16:17,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [604348213] [2022-12-14 03:16:17,898 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 03:16:17,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:16:17,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2022-12-14 03:16:17,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175787722] [2022-12-14 03:16:17,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:16:17,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 03:16:17,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:16:17,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 03:16:17,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=384, Unknown=14, NotChecked=40, Total=506 [2022-12-14 03:16:17,900 INFO L87 Difference]: Start difference. First operand 4609 states and 20655 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 03:16:18,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:16:18,704 INFO L93 Difference]: Finished difference Result 8274 states and 35514 transitions. [2022-12-14 03:16:18,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 03:16:18,705 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 03:16:18,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:16:18,727 INFO L225 Difference]: With dead ends: 8274 [2022-12-14 03:16:18,727 INFO L226 Difference]: Without dead ends: 8270 [2022-12-14 03:16:18,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=717, Unknown=14, NotChecked=56, Total=930 [2022-12-14 03:16:18,728 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 572 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 03:16:18,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 0 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 493 Invalid, 0 Unknown, 87 Unchecked, 0.4s Time] [2022-12-14 03:16:18,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8270 states. [2022-12-14 03:16:18,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8270 to 4176. [2022-12-14 03:16:18,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4176 states, 4096 states have (on average 4.4921875) internal successors, (18400), 4175 states have internal predecessors, (18400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:16:18,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4176 states to 4176 states and 18400 transitions. [2022-12-14 03:16:18,824 INFO L78 Accepts]: Start accepts. Automaton has 4176 states and 18400 transitions. Word has length 10 [2022-12-14 03:16:18,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:16:18,824 INFO L495 AbstractCegarLoop]: Abstraction has 4176 states and 18400 transitions. [2022-12-14 03:16:18,824 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 03:16:18,824 INFO L276 IsEmpty]: Start isEmpty. Operand 4176 states and 18400 transitions. [2022-12-14 03:16:18,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 03:16:18,824 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:16:18,825 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:16:18,830 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-14 03:16:19,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-14 03:16:19,026 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:16:19,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:16:19,027 INFO L85 PathProgramCache]: Analyzing trace with hash -525968574, now seen corresponding path program 1 times [2022-12-14 03:16:19,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:16:19,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620526069] [2022-12-14 03:16:19,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:16:19,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:16:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:16:19,124 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 03:16:19,124 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:16:19,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620526069] [2022-12-14 03:16:19,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620526069] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:16:19,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922828249] [2022-12-14 03:16:19,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:16:19,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:16:19,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:16:19,125 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:16:19,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-14 03:16:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:16:19,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 03:16:19,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:16:19,305 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 03:16:19,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:16:19,330 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 03:16:19,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922828249] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:16:19,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [603712457] [2022-12-14 03:16:19,331 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 03:16:19,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:16:19,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-14 03:16:19,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676855067] [2022-12-14 03:16:19,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:16:19,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 03:16:19,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:16:19,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 03:16:19,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-14 03:16:19,332 INFO L87 Difference]: Start difference. First operand 4176 states and 18400 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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 03:16:19,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:16:19,460 INFO L93 Difference]: Finished difference Result 4248 states and 18552 transitions. [2022-12-14 03:16:19,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 03:16:19,460 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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 10 [2022-12-14 03:16:19,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:16:19,471 INFO L225 Difference]: With dead ends: 4248 [2022-12-14 03:16:19,471 INFO L226 Difference]: Without dead ends: 4175 [2022-12-14 03:16:19,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-12-14 03:16:19,471 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:16:19,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 0 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 03:16:19,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4175 states. [2022-12-14 03:16:19,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4175 to 4175. [2022-12-14 03:16:19,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4175 states, 4095 states have (on average 4.492796092796093) internal successors, (18398), 4174 states have internal predecessors, (18398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:16:19,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4175 states to 4175 states and 18398 transitions. [2022-12-14 03:16:19,539 INFO L78 Accepts]: Start accepts. Automaton has 4175 states and 18398 transitions. Word has length 10 [2022-12-14 03:16:19,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:16:19,539 INFO L495 AbstractCegarLoop]: Abstraction has 4175 states and 18398 transitions. [2022-12-14 03:16:19,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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 03:16:19,539 INFO L276 IsEmpty]: Start isEmpty. Operand 4175 states and 18398 transitions. [2022-12-14 03:16:19,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 03:16:19,539 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:16:19,539 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:16:19,544 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-14 03:16:19,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:16:19,740 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:16:19,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:16:19,741 INFO L85 PathProgramCache]: Analyzing trace with hash 531493822, now seen corresponding path program 1 times [2022-12-14 03:16:19,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:16:19,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117511786] [2022-12-14 03:16:19,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:16:19,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:16:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:16:20,018 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 03:16:20,018 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:16:20,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117511786] [2022-12-14 03:16:20,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117511786] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:16:20,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280781652] [2022-12-14 03:16:20,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:16:20,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:16:20,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:16:20,020 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:16:20,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-14 03:16:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:16:20,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-14 03:16:20,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:16:20,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 03:16:20,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:16:20,295 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 03:16:20,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:16:20,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 18 treesize of output 20 [2022-12-14 03:16:20,358 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 21 treesize of output 9 [2022-12-14 03:16:20,359 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 03:16:20,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:16:20,406 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1396 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1396) c_~x~0.base) (+ 8 c_~x~0.offset (* c_~i1~0 4)))))) is different from false [2022-12-14 03:16:20,454 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:16:20,454 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 03:16:20,460 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:16:20,460 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 03:16:20,464 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 118 [2022-12-14 03:16:20,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 63 treesize of output 55 [2022-12-14 03:16:20,544 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 03:16:20,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280781652] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:16:20,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1264972008] [2022-12-14 03:16:20,545 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 03:16:20,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:16:20,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-12-14 03:16:20,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781793166] [2022-12-14 03:16:20,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:16:20,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 03:16:20,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:16:20,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 03:16:20,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=485, Unknown=7, NotChecked=44, Total=600 [2022-12-14 03:16:20,546 INFO L87 Difference]: Start difference. First operand 4175 states and 18398 transitions. Second operand has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:16:21,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:16:21,349 INFO L93 Difference]: Finished difference Result 7024 states and 29901 transitions. [2022-12-14 03:16:21,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 03:16:21,349 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 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 03:16:21,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:16:21,368 INFO L225 Difference]: With dead ends: 7024 [2022-12-14 03:16:21,368 INFO L226 Difference]: Without dead ends: 7024 [2022-12-14 03:16:21,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=1086, Unknown=7, NotChecked=68, Total=1332 [2022-12-14 03:16:21,368 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 334 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 03:16:21,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 0 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 985 Invalid, 0 Unknown, 142 Unchecked, 0.4s Time] [2022-12-14 03:16:21,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7024 states. [2022-12-14 03:16:21,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7024 to 4555. [2022-12-14 03:16:21,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4555 states, 4475 states have (on average 4.5635754189944135) internal successors, (20422), 4554 states have internal predecessors, (20422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:16:21,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4555 states to 4555 states and 20422 transitions. [2022-12-14 03:16:21,461 INFO L78 Accepts]: Start accepts. Automaton has 4555 states and 20422 transitions. Word has length 11 [2022-12-14 03:16:21,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:16:21,461 INFO L495 AbstractCegarLoop]: Abstraction has 4555 states and 20422 transitions. [2022-12-14 03:16:21,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:16:21,461 INFO L276 IsEmpty]: Start isEmpty. Operand 4555 states and 20422 transitions. [2022-12-14 03:16:21,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 03:16:21,462 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:16:21,462 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:16:21,466 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-14 03:16:21,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:16:21,663 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:16:21,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:16:21,664 INFO L85 PathProgramCache]: Analyzing trace with hash 531493823, now seen corresponding path program 2 times [2022-12-14 03:16:21,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:16:21,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624271043] [2022-12-14 03:16:21,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:16:21,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:16:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:16:21,999 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 03:16:21,999 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:16:21,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624271043] [2022-12-14 03:16:21,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624271043] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:16:21,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379679378] [2022-12-14 03:16:21,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 03:16:22,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:16:22,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:16:22,000 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:16:22,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-14 03:16:22,190 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 03:16:22,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 03:16:22,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-14 03:16:22,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:16:22,253 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 03:16:22,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:16:22,296 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 03:16:22,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:16:22,336 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 03:16:22,411 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-14 03:16:22,411 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 23 treesize of output 10 [2022-12-14 03:16:22,430 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 03:16:22,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:16:22,616 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:16:22,616 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 03:16:22,623 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:16:22,623 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 83 treesize of output 80 [2022-12-14 03:16:22,626 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 63 treesize of output 49 [2022-12-14 03:16:22,632 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 27 treesize of output 20 [2022-12-14 03:16:22,801 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 03:16:22,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379679378] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:16:22,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [716637896] [2022-12-14 03:16:22,801 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 03:16:22,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:16:22,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-14 03:16:22,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805098924] [2022-12-14 03:16:22,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:16:22,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 03:16:22,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:16:22,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 03:16:22,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=547, Unknown=1, NotChecked=0, Total=650 [2022-12-14 03:16:22,802 INFO L87 Difference]: Start difference. First operand 4555 states and 20422 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 03:16:26,117 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 03:16:28,744 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 03:16:30,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:16:30,643 INFO L93 Difference]: Finished difference Result 19339 states and 83725 transitions. [2022-12-14 03:16:30,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-12-14 03:16:30,643 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 03:16:30,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:16:30,712 INFO L225 Difference]: With dead ends: 19339 [2022-12-14 03:16:30,712 INFO L226 Difference]: Without dead ends: 19339 [2022-12-14 03:16:30,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1301 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=932, Invalid=4177, Unknown=3, NotChecked=0, Total=5112 [2022-12-14 03:16:30,714 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1202 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1446 mSolverCounterSat, 115 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1202 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1446 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-12-14 03:16:30,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1202 Valid, 0 Invalid, 1568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1446 Invalid, 7 Unknown, 0 Unchecked, 5.5s Time] [2022-12-14 03:16:30,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19339 states. [2022-12-14 03:16:30,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19339 to 7896. [2022-12-14 03:16:30,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7896 states, 7816 states have (on average 4.897134083930399) internal successors, (38276), 7895 states have internal predecessors, (38276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:16:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7896 states to 7896 states and 38276 transitions. [2022-12-14 03:16:30,961 INFO L78 Accepts]: Start accepts. Automaton has 7896 states and 38276 transitions. Word has length 11 [2022-12-14 03:16:30,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:16:30,962 INFO L495 AbstractCegarLoop]: Abstraction has 7896 states and 38276 transitions. [2022-12-14 03:16:30,962 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 03:16:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 7896 states and 38276 transitions. [2022-12-14 03:16:30,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 03:16:30,962 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:16:30,962 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:16:30,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-14 03:16:31,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:16:31,164 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:16:31,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:16:31,165 INFO L85 PathProgramCache]: Analyzing trace with hash 531451059, now seen corresponding path program 1 times [2022-12-14 03:16:31,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:16:31,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853490417] [2022-12-14 03:16:31,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:16:31,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:16:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:16:31,470 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 03:16:31,470 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:16:31,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853490417] [2022-12-14 03:16:31,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853490417] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:16:31,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186379608] [2022-12-14 03:16:31,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:16:31,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:16:31,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:16:31,471 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:16:31,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-14 03:16:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:16:31,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-14 03:16:31,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:16:31,663 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 03:16:31,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:16:31,698 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 03:16:31,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:16:31,726 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 03:16:31,765 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 21 treesize of output 9 [2022-12-14 03:16:31,767 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 03:16:31,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:16:31,898 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:16:31,898 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 03:16:31,906 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:16:31,906 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 03:16:31,909 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 54 [2022-12-14 03:16:31,913 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 03:16:32,025 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 03:16:32,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186379608] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:16:32,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [557682508] [2022-12-14 03:16:32,026 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 03:16:32,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:16:32,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-12-14 03:16:32,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811922996] [2022-12-14 03:16:32,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:16:32,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 03:16:32,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:16:32,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 03:16:32,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=522, Unknown=11, NotChecked=0, Total=600 [2022-12-14 03:16:32,027 INFO L87 Difference]: Start difference. First operand 7896 states and 38276 transitions. Second operand has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:16:33,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:16:33,489 INFO L93 Difference]: Finished difference Result 12156 states and 57924 transitions. [2022-12-14 03:16:33,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 03:16:33,490 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 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 03:16:33,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:16:33,532 INFO L225 Difference]: With dead ends: 12156 [2022-12-14 03:16:33,533 INFO L226 Difference]: Without dead ends: 12156 [2022-12-14 03:16:33,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=259, Invalid=1535, Unknown=12, NotChecked=0, Total=1806 [2022-12-14 03:16:33,533 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 473 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1522 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 03:16:33,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 0 Invalid, 1565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1522 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 03:16:33,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12156 states. [2022-12-14 03:16:33,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12156 to 8399. [2022-12-14 03:16:33,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8399 states, 8319 states have (on average 4.988940978482991) internal successors, (41503), 8398 states have internal predecessors, (41503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:16:33,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8399 states to 8399 states and 41503 transitions. [2022-12-14 03:16:33,740 INFO L78 Accepts]: Start accepts. Automaton has 8399 states and 41503 transitions. Word has length 11 [2022-12-14 03:16:33,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:16:33,740 INFO L495 AbstractCegarLoop]: Abstraction has 8399 states and 41503 transitions. [2022-12-14 03:16:33,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:16:33,741 INFO L276 IsEmpty]: Start isEmpty. Operand 8399 states and 41503 transitions. [2022-12-14 03:16:33,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 03:16:33,741 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:16:33,741 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:16:33,746 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-14 03:16:33,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-12-14 03:16:33,942 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:16:33,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:16:33,943 INFO L85 PathProgramCache]: Analyzing trace with hash 531451060, now seen corresponding path program 1 times [2022-12-14 03:16:33,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:16:33,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932590516] [2022-12-14 03:16:33,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:16:33,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:16:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:16:34,227 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 03:16:34,227 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:16:34,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932590516] [2022-12-14 03:16:34,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932590516] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:16:34,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782366563] [2022-12-14 03:16:34,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:16:34,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:16:34,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:16:34,228 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:16:34,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-14 03:16:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:16:34,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-14 03:16:34,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:16:34,411 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 03:16:34,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:16:34,443 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 03:16:34,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:16:34,483 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 03:16:34,530 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-12-14 03:16:34,531 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 22 treesize of output 10 [2022-12-14 03:16:34,550 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 03:16:34,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:16:34,733 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:16:34,734 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 03:16:34,741 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:16:34,741 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 03:16:34,747 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 03:16:34,751 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 03:16:34,878 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 03:16:34,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782366563] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:16:34,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1506242706] [2022-12-14 03:16:34,879 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 03:16:34,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:16:34,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-14 03:16:34,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561178015] [2022-12-14 03:16:34,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:16:34,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 03:16:34,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:16:34,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 03:16:34,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=569, Unknown=10, NotChecked=0, Total=650 [2022-12-14 03:16:34,880 INFO L87 Difference]: Start difference. First operand 8399 states and 41503 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 03:16:36,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:16:36,048 INFO L93 Difference]: Finished difference Result 12550 states and 58609 transitions. [2022-12-14 03:16:36,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 03:16:36,048 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 03:16:36,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:16:36,091 INFO L225 Difference]: With dead ends: 12550 [2022-12-14 03:16:36,091 INFO L226 Difference]: Without dead ends: 12550 [2022-12-14 03:16:36,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=205, Invalid=1345, Unknown=10, NotChecked=0, Total=1560 [2022-12-14 03:16:36,092 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 655 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 03:16:36,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 0 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 03:16:36,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12550 states. [2022-12-14 03:16:36,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12550 to 7900. [2022-12-14 03:16:36,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7900 states, 7820 states have (on average 4.895780051150895) internal successors, (38285), 7899 states have internal predecessors, (38285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:16:36,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 38285 transitions. [2022-12-14 03:16:36,282 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 38285 transitions. Word has length 11 [2022-12-14 03:16:36,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:16:36,283 INFO L495 AbstractCegarLoop]: Abstraction has 7900 states and 38285 transitions. [2022-12-14 03:16:36,283 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 03:16:36,283 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 38285 transitions. [2022-12-14 03:16:36,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 03:16:36,283 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:16:36,283 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:16:36,288 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-14 03:16:36,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-12-14 03:16:36,485 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:16:36,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:16:36,486 INFO L85 PathProgramCache]: Analyzing trace with hash 531527940, now seen corresponding path program 2 times [2022-12-14 03:16:36,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:16:36,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220035775] [2022-12-14 03:16:36,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:16:36,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:16:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:16:36,810 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 03:16:36,810 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:16:36,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220035775] [2022-12-14 03:16:36,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220035775] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:16:36,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104339404] [2022-12-14 03:16:36,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 03:16:36,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:16:36,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:16:36,811 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:16:36,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-14 03:16:36,983 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 03:16:36,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 03:16:36,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-14 03:16:36,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:16:37,028 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 03:16:37,065 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 03:16:37,065 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 25 treesize of output 30 [2022-12-14 03:16:37,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:16:37,091 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 03:16:37,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:16:37,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 03:16:37,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:16:37,161 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 03:16:37,187 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-12-14 03:16:37,188 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 22 treesize of output 10 [2022-12-14 03:16:37,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 03:16:37,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:16:37,243 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1659 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1659) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 4294967296)) is different from false [2022-12-14 03:16:43,549 INFO L321 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-12-14 03:16:43,550 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 37 treesize of output 52 [2022-12-14 03:16:43,564 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:16:43,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 170 [2022-12-14 03:16:43,570 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 03:16:43,576 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 106 treesize of output 98 [2022-12-14 03:16:43,582 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 46 [2022-12-14 03:16:43,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:16:43,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104339404] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:16:43,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1596932341] [2022-12-14 03:16:43,722 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 03:16:43,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:16:43,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 23 [2022-12-14 03:16:43,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151849338] [2022-12-14 03:16:43,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:16:43,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 03:16:43,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:16:43,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 03:16:43,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=462, Unknown=19, NotChecked=44, Total=600 [2022-12-14 03:16:43,723 INFO L87 Difference]: Start difference. First operand 7900 states and 38285 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 03:16:44,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:16:44,714 INFO L93 Difference]: Finished difference Result 12507 states and 59535 transitions. [2022-12-14 03:16:44,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 03:16:44,714 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 03:16:44,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:16:44,756 INFO L225 Difference]: With dead ends: 12507 [2022-12-14 03:16:44,756 INFO L226 Difference]: Without dead ends: 12507 [2022-12-14 03:16:44,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=198, Invalid=909, Unknown=19, NotChecked=64, Total=1190 [2022-12-14 03:16:44,757 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 671 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 03:16:44,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 0 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 584 Invalid, 0 Unknown, 93 Unchecked, 0.5s Time] [2022-12-14 03:16:44,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12507 states. [2022-12-14 03:16:44,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12507 to 7545. [2022-12-14 03:16:44,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7545 states, 7465 states have (on average 4.874748827863362) internal successors, (36390), 7544 states have internal predecessors, (36390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:16:44,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7545 states to 7545 states and 36390 transitions. [2022-12-14 03:16:44,942 INFO L78 Accepts]: Start accepts. Automaton has 7545 states and 36390 transitions. Word has length 11 [2022-12-14 03:16:44,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:16:44,942 INFO L495 AbstractCegarLoop]: Abstraction has 7545 states and 36390 transitions. [2022-12-14 03:16:44,942 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 03:16:44,942 INFO L276 IsEmpty]: Start isEmpty. Operand 7545 states and 36390 transitions. [2022-12-14 03:16:44,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 03:16:44,943 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:16:44,943 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:16:44,948 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-14 03:16:45,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:16:45,144 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:16:45,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:16:45,145 INFO L85 PathProgramCache]: Analyzing trace with hash 471657639, now seen corresponding path program 2 times [2022-12-14 03:16:45,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:16:45,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976454660] [2022-12-14 03:16:45,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:16:45,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:16:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:16:45,404 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 03:16:45,404 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:16:45,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976454660] [2022-12-14 03:16:45,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976454660] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:16:45,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701208431] [2022-12-14 03:16:45,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 03:16:45,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:16:45,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:16:45,405 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:16:45,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-14 03:16:45,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 03:16:45,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 03:16:45,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-14 03:16:45,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:16:45,676 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 03:16:45,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:16:45,735 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 03:16:45,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:16:45,835 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 03:16:45,895 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-14 03:16:45,895 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 25 treesize of output 12 [2022-12-14 03:16:45,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:16:45,898 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:16:46,113 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:16:46,113 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 03:16:46,121 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:16:46,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 90 [2022-12-14 03:16:46,126 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 38 treesize of output 31 [2022-12-14 03:16:46,131 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 64 treesize of output 50 [2022-12-14 03:16:46,427 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 03:16:46,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701208431] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:16:46,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [269938124] [2022-12-14 03:16:46,427 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 03:16:46,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:16:46,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-12-14 03:16:46,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688903176] [2022-12-14 03:16:46,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:16:46,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 03:16:46,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:16:46,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 03:16:46,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=516, Unknown=7, NotChecked=0, Total=600 [2022-12-14 03:16:46,429 INFO L87 Difference]: Start difference. First operand 7545 states and 36390 transitions. Second operand has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:16:51,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:16:51,375 INFO L93 Difference]: Finished difference Result 13563 states and 65134 transitions. [2022-12-14 03:16:51,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-14 03:16:51,376 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 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 03:16:51,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:16:51,427 INFO L225 Difference]: With dead ends: 13563 [2022-12-14 03:16:51,427 INFO L226 Difference]: Without dead ends: 13563 [2022-12-14 03:16:51,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=673, Invalid=3739, Unknown=10, NotChecked=0, Total=4422 [2022-12-14 03:16:51,428 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1010 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1813 mSolverCounterSat, 99 mSolverCounterUnsat, 45 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1813 IncrementalHoareTripleChecker+Invalid, 45 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-12-14 03:16:51,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 0 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1813 Invalid, 45 Unknown, 0 Unchecked, 2.2s Time] [2022-12-14 03:16:51,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13563 states. [2022-12-14 03:16:51,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13563 to 8660. [2022-12-14 03:16:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8660 states, 8580 states have (on average 4.970396270396271) internal successors, (42646), 8659 states have internal predecessors, (42646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:16:51,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8660 states to 8660 states and 42646 transitions. [2022-12-14 03:16:51,645 INFO L78 Accepts]: Start accepts. Automaton has 8660 states and 42646 transitions. Word has length 11 [2022-12-14 03:16:51,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:16:51,646 INFO L495 AbstractCegarLoop]: Abstraction has 8660 states and 42646 transitions. [2022-12-14 03:16:51,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:16:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 8660 states and 42646 transitions. [2022-12-14 03:16:51,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 03:16:51,646 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:16:51,646 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:16:51,652 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-14 03:16:51,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-14 03:16:51,848 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:16:51,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:16:51,849 INFO L85 PathProgramCache]: Analyzing trace with hash 471657640, now seen corresponding path program 2 times [2022-12-14 03:16:51,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:16:51,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989382251] [2022-12-14 03:16:51,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:16:51,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:16:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:16:52,156 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 03:16:52,156 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:16:52,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989382251] [2022-12-14 03:16:52,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989382251] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:16:52,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904523058] [2022-12-14 03:16:52,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 03:16:52,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:16:52,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:16:52,158 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:16:52,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-14 03:16:52,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 03:16:52,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 03:16:52,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-14 03:16:52,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:16:52,437 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 03:16:52,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:16:52,495 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 03:16:52,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:16:52,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 03:16:52,659 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-14 03:16:52,659 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 23 treesize of output 10 [2022-12-14 03:16:52,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:16:52,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:16:52,862 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:16:52,862 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 03:16:52,870 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:16:52,870 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 165 treesize of output 153 [2022-12-14 03:16:52,875 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 122 [2022-12-14 03:16:52,879 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 94 [2022-12-14 03:16:53,094 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 03:16:53,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904523058] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:16:53,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [261158999] [2022-12-14 03:16:53,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 03:16:53,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:16:53,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-14 03:16:53,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704053627] [2022-12-14 03:16:53,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:16:53,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 03:16:53,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:16:53,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 03:16:53,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=565, Unknown=3, NotChecked=0, Total=650 [2022-12-14 03:16:53,096 INFO L87 Difference]: Start difference. First operand 8660 states and 42646 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 03:16:58,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:16:58,558 INFO L93 Difference]: Finished difference Result 16113 states and 75590 transitions. [2022-12-14 03:16:58,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-12-14 03:16:58,559 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 03:16:58,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:16:58,619 INFO L225 Difference]: With dead ends: 16113 [2022-12-14 03:16:58,619 INFO L226 Difference]: Without dead ends: 16113 [2022-12-14 03:16:58,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1793 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=978, Invalid=5647, Unknown=17, NotChecked=0, Total=6642 [2022-12-14 03:16:58,621 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1366 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 128 mSolverCounterUnsat, 38 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1366 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 38 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-12-14 03:16:58,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1366 Valid, 0 Invalid, 1842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1676 Invalid, 38 Unknown, 0 Unchecked, 1.9s Time] [2022-12-14 03:16:58,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16113 states. [2022-12-14 03:16:58,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16113 to 8995. [2022-12-14 03:16:58,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8995 states, 8915 states have (on average 4.957599551318004) internal successors, (44197), 8994 states have internal predecessors, (44197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:16:58,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8995 states to 8995 states and 44197 transitions. [2022-12-14 03:16:58,864 INFO L78 Accepts]: Start accepts. Automaton has 8995 states and 44197 transitions. Word has length 11 [2022-12-14 03:16:58,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:16:58,864 INFO L495 AbstractCegarLoop]: Abstraction has 8995 states and 44197 transitions. [2022-12-14 03:16:58,864 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 03:16:58,864 INFO L276 IsEmpty]: Start isEmpty. Operand 8995 states and 44197 transitions. [2022-12-14 03:16:58,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 03:16:58,865 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:16:58,865 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 03:16:58,870 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-14 03:16:59,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-14 03:16:59,066 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:16:59,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:16:59,067 INFO L85 PathProgramCache]: Analyzing trace with hash 471601419, now seen corresponding path program 1 times [2022-12-14 03:16:59,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:16:59,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53880434] [2022-12-14 03:16:59,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:16:59,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:16:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:16:59,329 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:16:59,329 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:16:59,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53880434] [2022-12-14 03:16:59,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53880434] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:16:59,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686474249] [2022-12-14 03:16:59,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:16:59,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:16:59,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:16:59,331 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:16:59,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-14 03:16:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:16:59,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-14 03:16:59,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:16:59,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 03:16:59,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:16:59,587 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 03:16:59,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:16:59,638 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 03:16:59,661 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 21 treesize of output 9 [2022-12-14 03:16:59,663 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:16:59,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:16:59,813 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:16:59,813 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 03:16:59,819 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:16:59,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 81 treesize of output 77 [2022-12-14 03:16:59,822 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 54 [2022-12-14 03:16:59,826 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 03:16:59,911 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:16:59,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686474249] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:16:59,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1411173136] [2022-12-14 03:16:59,912 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 03:16:59,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:16:59,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-12-14 03:16:59,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980724246] [2022-12-14 03:16:59,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:16:59,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 03:16:59,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:16:59,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 03:16:59,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=523, Unknown=10, NotChecked=0, Total=600 [2022-12-14 03:16:59,914 INFO L87 Difference]: Start difference. First operand 8995 states and 44197 transitions. Second operand has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:17:00,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:17:00,822 INFO L93 Difference]: Finished difference Result 14203 states and 67602 transitions. [2022-12-14 03:17:00,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 03:17:00,822 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 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 03:17:00,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:17:00,874 INFO L225 Difference]: With dead ends: 14203 [2022-12-14 03:17:00,874 INFO L226 Difference]: Without dead ends: 14203 [2022-12-14 03:17:00,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=181, Invalid=1141, Unknown=10, NotChecked=0, Total=1332 [2022-12-14 03:17:00,875 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 491 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 03:17:00,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 0 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 03:17:00,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14203 states. [2022-12-14 03:17:01,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14203 to 9650. [2022-12-14 03:17:01,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9650 states, 9570 states have (on average 4.992685475444096) internal successors, (47780), 9649 states have internal predecessors, (47780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:17:01,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9650 states to 9650 states and 47780 transitions. [2022-12-14 03:17:01,108 INFO L78 Accepts]: Start accepts. Automaton has 9650 states and 47780 transitions. Word has length 11 [2022-12-14 03:17:01,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:17:01,108 INFO L495 AbstractCegarLoop]: Abstraction has 9650 states and 47780 transitions. [2022-12-14 03:17:01,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:17:01,109 INFO L276 IsEmpty]: Start isEmpty. Operand 9650 states and 47780 transitions. [2022-12-14 03:17:01,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 03:17:01,109 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:17:01,109 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 03:17:01,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-14 03:17:01,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:17:01,310 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:17:01,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:17:01,311 INFO L85 PathProgramCache]: Analyzing trace with hash 471601420, now seen corresponding path program 1 times [2022-12-14 03:17:01,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:17:01,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794599550] [2022-12-14 03:17:01,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:17:01,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:17:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:17:01,599 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:17:01,599 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:17:01,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794599550] [2022-12-14 03:17:01,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794599550] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:17:01,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004287607] [2022-12-14 03:17:01,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:17:01,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:17:01,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:17:01,601 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:17:01,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-14 03:17:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:17:01,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-14 03:17:01,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:17:01,855 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 03:17:01,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:17:01,883 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 03:17:01,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:17:01,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 16 treesize of output 18 [2022-12-14 03:17:01,946 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 19 treesize of output 7 [2022-12-14 03:17:01,947 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:17:01,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:17:01,991 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1915 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1915) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 4294967296)) is different from false [2022-12-14 03:17:04,089 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:17:04,089 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 03:17:04,094 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:17:04,094 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 03:17:04,097 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 03:17:04,100 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 03:17:04,174 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:17:04,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004287607] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:17:04,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [967395494] [2022-12-14 03:17:04,175 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 03:17:04,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:17:04,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-12-14 03:17:04,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496953239] [2022-12-14 03:17:04,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:17:04,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 03:17:04,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:17:04,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 03:17:04,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=483, Unknown=9, NotChecked=44, Total=600 [2022-12-14 03:17:04,176 INFO L87 Difference]: Start difference. First operand 9650 states and 47780 transitions. Second operand has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:17:05,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:17:05,121 INFO L93 Difference]: Finished difference Result 13813 states and 64517 transitions. [2022-12-14 03:17:05,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 03:17:05,122 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 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 03:17:05,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:17:05,173 INFO L225 Difference]: With dead ends: 13813 [2022-12-14 03:17:05,173 INFO L226 Difference]: Without dead ends: 13813 [2022-12-14 03:17:05,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=175, Invalid=1080, Unknown=9, NotChecked=68, Total=1332 [2022-12-14 03:17:05,173 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 484 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 03:17:05,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 0 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 850 Invalid, 0 Unknown, 123 Unchecked, 0.5s Time] [2022-12-14 03:17:05,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13813 states. [2022-12-14 03:17:05,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13813 to 8592. [2022-12-14 03:17:05,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8592 states, 8512 states have (on average 4.943491541353383) internal successors, (42079), 8591 states have internal predecessors, (42079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:17:05,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8592 states to 8592 states and 42079 transitions. [2022-12-14 03:17:05,380 INFO L78 Accepts]: Start accepts. Automaton has 8592 states and 42079 transitions. Word has length 11 [2022-12-14 03:17:05,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:17:05,381 INFO L495 AbstractCegarLoop]: Abstraction has 8592 states and 42079 transitions. [2022-12-14 03:17:05,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:17:05,381 INFO L276 IsEmpty]: Start isEmpty. Operand 8592 states and 42079 transitions. [2022-12-14 03:17:05,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 03:17:05,381 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:17:05,381 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:17:05,386 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-12-14 03:17:05,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-14 03:17:05,583 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:17:05,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:17:05,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1739449705, now seen corresponding path program 2 times [2022-12-14 03:17:05,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:17:05,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959489089] [2022-12-14 03:17:05,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:17:05,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:17:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:17:05,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:17:05,815 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:17:05,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959489089] [2022-12-14 03:17:05,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959489089] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:17:05,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326161279] [2022-12-14 03:17:05,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 03:17:05,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:17:05,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:17:05,817 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:17:05,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-14 03:17:05,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 03:17:05,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 03:17:05,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 03:17:05,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:17:06,016 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 03:17:06,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:17:06,052 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 03:17:06,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:17:06,091 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 03:17:06,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:17:06,124 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 03:17:06,154 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 21 treesize of output 9 [2022-12-14 03:17:06,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:17:06,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:17:06,191 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1980 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1980) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i2~0 4))) 9223372039002259456))) is different from false [2022-12-14 03:17:06,288 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:17:06,288 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 03:17:06,296 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:17:06,296 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 03:17:06,307 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 03:17:06,316 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 1014 [2022-12-14 03:17:06,324 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 950 [2022-12-14 03:17:07,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:17:07,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326161279] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:17:07,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1153460179] [2022-12-14 03:17:07,467 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 03:17:07,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:17:07,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-12-14 03:17:07,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278652761] [2022-12-14 03:17:07,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:17:07,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 03:17:07,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:17:07,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 03:17:07,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=354, Unknown=5, NotChecked=38, Total=462 [2022-12-14 03:17:07,468 INFO L87 Difference]: Start difference. First operand 8592 states and 42079 transitions. Second operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:17:08,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:17:08,102 INFO L93 Difference]: Finished difference Result 13829 states and 69765 transitions. [2022-12-14 03:17:08,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 03:17:08,102 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 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 03:17:08,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:17:08,153 INFO L225 Difference]: With dead ends: 13829 [2022-12-14 03:17:08,153 INFO L226 Difference]: Without dead ends: 13829 [2022-12-14 03:17:08,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=583, Unknown=5, NotChecked=50, Total=756 [2022-12-14 03:17:08,154 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 243 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 03:17:08,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 0 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 524 Invalid, 0 Unknown, 99 Unchecked, 0.3s Time] [2022-12-14 03:17:08,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13829 states. [2022-12-14 03:17:08,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13829 to 10403. [2022-12-14 03:17:08,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10403 states, 10323 states have (on average 5.123898091640027) internal successors, (52894), 10402 states have internal predecessors, (52894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:17:08,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10403 states to 10403 states and 52894 transitions. [2022-12-14 03:17:08,396 INFO L78 Accepts]: Start accepts. Automaton has 10403 states and 52894 transitions. Word has length 11 [2022-12-14 03:17:08,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:17:08,396 INFO L495 AbstractCegarLoop]: Abstraction has 10403 states and 52894 transitions. [2022-12-14 03:17:08,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:17:08,397 INFO L276 IsEmpty]: Start isEmpty. Operand 10403 states and 52894 transitions. [2022-12-14 03:17:08,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 03:17:08,397 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:17:08,397 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:17:08,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-12-14 03:17:08,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-14 03:17:08,598 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:17:08,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:17:08,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1739449704, now seen corresponding path program 1 times [2022-12-14 03:17:08,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:17:08,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216600879] [2022-12-14 03:17:08,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:17:08,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:17:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:17:08,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:17:08,837 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:17:08,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216600879] [2022-12-14 03:17:08,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216600879] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:17:08,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182009146] [2022-12-14 03:17:08,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:17:08,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:17:08,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:17:08,838 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:17:08,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-14 03:17:09,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:17:09,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 03:17:09,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:17:09,067 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 03:17:09,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:17:09,095 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 03:17:09,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:17:09,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 16 treesize of output 18 [2022-12-14 03:17:09,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:17:09,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 03:17:09,174 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 19 treesize of output 7 [2022-12-14 03:17:09,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:17:09,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:17:09,236 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2045 (Array Int Int)) (v_ArrVal_2044 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2044) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2045) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i2~0 4))) 4294967296)) is different from false [2022-12-14 03:17:09,246 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2045 (Array Int Int)) (v_ArrVal_2044 (Array Int Int)) (v_ArrVal_2043 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_2043) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_2044) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2045) |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 03:17:09,254 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:17:09,254 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 03:17:09,261 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:17:09,261 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 03:17:09,264 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 03:17:09,268 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 98 [2022-12-14 03:17:09,273 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 46 [2022-12-14 03:17:09,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 03:17:09,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182009146] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:17:09,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [905472639] [2022-12-14 03:17:09,405 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 03:17:09,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:17:09,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2022-12-14 03:17:09,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644449183] [2022-12-14 03:17:09,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:17:09,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 03:17:09,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:17:09,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 03:17:09,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=316, Unknown=6, NotChecked=74, Total=462 [2022-12-14 03:17:09,406 INFO L87 Difference]: Start difference. First operand 10403 states and 52894 transitions. Second operand has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:17:10,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:17:10,059 INFO L93 Difference]: Finished difference Result 13829 states and 68134 transitions. [2022-12-14 03:17:10,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 03:17:10,059 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 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 03:17:10,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:17:10,109 INFO L225 Difference]: With dead ends: 13829 [2022-12-14 03:17:10,109 INFO L226 Difference]: Without dead ends: 13829 [2022-12-14 03:17:10,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=537, Unknown=6, NotChecked=98, Total=756 [2022-12-14 03:17:10,110 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 256 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 03:17:10,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 0 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 497 Invalid, 0 Unknown, 155 Unchecked, 0.3s Time] [2022-12-14 03:17:10,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13829 states. [2022-12-14 03:17:10,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13829 to 10403. [2022-12-14 03:17:10,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10403 states, 10323 states have (on average 4.965901385256224) internal successors, (51263), 10402 states have internal predecessors, (51263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:17:10,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10403 states to 10403 states and 51263 transitions. [2022-12-14 03:17:10,352 INFO L78 Accepts]: Start accepts. Automaton has 10403 states and 51263 transitions. Word has length 11 [2022-12-14 03:17:10,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:17:10,353 INFO L495 AbstractCegarLoop]: Abstraction has 10403 states and 51263 transitions. [2022-12-14 03:17:10,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:17:10,353 INFO L276 IsEmpty]: Start isEmpty. Operand 10403 states and 51263 transitions. [2022-12-14 03:17:10,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 03:17:10,354 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:17:10,354 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:17:10,359 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-12-14 03:17:10,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:17:10,555 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:17:10,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:17:10,556 INFO L85 PathProgramCache]: Analyzing trace with hash -703476761, now seen corresponding path program 1 times [2022-12-14 03:17:10,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:17:10,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692233287] [2022-12-14 03:17:10,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:17:10,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:17:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:17:10,842 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 03:17:10,842 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:17:10,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692233287] [2022-12-14 03:17:10,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692233287] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:17:10,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290648570] [2022-12-14 03:17:10,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:17:10,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:17:10,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:17:10,843 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:17:10,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-14 03:17:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:17:10,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 03:17:10,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:17:11,070 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 03:17:11,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:17:11,110 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 03:17:11,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:17:11,143 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 03:17:11,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:17:11,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 03:17:11,222 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 21 treesize of output 9 [2022-12-14 03:17:11,224 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 03:17:11,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:17:11,458 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:17:11,458 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 03:17:11,465 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:17:11,466 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 157 treesize of output 153 [2022-12-14 03:17:11,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 138 treesize of output 130 [2022-12-14 03:17:11,473 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 130 treesize of output 114 [2022-12-14 03:17:11,478 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 54 [2022-12-14 03:17:11,689 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 03:17:11,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290648570] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:17:11,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [139446406] [2022-12-14 03:17:11,690 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 03:17:11,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:17:11,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-12-14 03:17:11,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815183375] [2022-12-14 03:17:11,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:17:11,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-14 03:17:11,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:17:11,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-14 03:17:11,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=653, Unknown=15, NotChecked=0, Total=756 [2022-12-14 03:17:11,691 INFO L87 Difference]: Start difference. First operand 10403 states and 51263 transitions. Second operand has 28 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:17:18,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:17:18,206 INFO L93 Difference]: Finished difference Result 27141 states and 126076 transitions. [2022-12-14 03:17:18,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-14 03:17:18,207 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 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 03:17:18,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:17:18,316 INFO L225 Difference]: With dead ends: 27141 [2022-12-14 03:17:18,316 INFO L226 Difference]: Without dead ends: 27141 [2022-12-14 03:17:18,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=691, Invalid=4341, Unknown=80, NotChecked=0, Total=5112 [2022-12-14 03:17:18,318 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1368 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2836 mSolverCounterSat, 135 mSolverCounterUnsat, 266 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 2836 IncrementalHoareTripleChecker+Invalid, 266 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-12-14 03:17:18,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 0 Invalid, 3237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 2836 Invalid, 266 Unknown, 0 Unchecked, 3.0s Time] [2022-12-14 03:17:18,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27141 states. [2022-12-14 03:17:18,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27141 to 13584. [2022-12-14 03:17:18,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13584 states, 13504 states have (on average 5.015773104265403) internal successors, (67733), 13583 states have internal predecessors, (67733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:17:18,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13584 states to 13584 states and 67733 transitions. [2022-12-14 03:17:18,739 INFO L78 Accepts]: Start accepts. Automaton has 13584 states and 67733 transitions. Word has length 12 [2022-12-14 03:17:18,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:17:18,739 INFO L495 AbstractCegarLoop]: Abstraction has 13584 states and 67733 transitions. [2022-12-14 03:17:18,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:17:18,740 INFO L276 IsEmpty]: Start isEmpty. Operand 13584 states and 67733 transitions. [2022-12-14 03:17:18,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 03:17:18,740 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:17:18,741 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:17:18,746 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-12-14 03:17:18,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:17:18,942 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:17:18,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:17:18,943 INFO L85 PathProgramCache]: Analyzing trace with hash -703476760, now seen corresponding path program 1 times [2022-12-14 03:17:18,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:17:18,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144708457] [2022-12-14 03:17:18,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:17:18,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:17:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:17:19,352 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 03:17:19,352 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:17:19,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144708457] [2022-12-14 03:17:19,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144708457] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:17:19,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985223342] [2022-12-14 03:17:19,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:17:19,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:17:19,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:17:19,354 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:17:19,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-14 03:17:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:17:19,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-14 03:17:19,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:17:19,617 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 03:17:19,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:17:19,642 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 03:17:19,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:17:19,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 03:17:19,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:17:19,729 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 03:17:19,755 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-12-14 03:17:19,755 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 22 treesize of output 10 [2022-12-14 03:17:19,769 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 03:17:19,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:17:19,805 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2183 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2183) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 4294967296)) is different from false [2022-12-14 03:17:19,809 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2183 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2183) c_~x~0.base) (+ 8 c_~x~0.offset (* c_~i1~0 4))) 4294967296)) is different from false [2022-12-14 03:17:24,020 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:17:24,020 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 03:17:24,027 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:17:24,027 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 1105 treesize of output 1059 [2022-12-14 03:17:24,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1046 treesize of output 1014 [2022-12-14 03:17:24,042 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 886 [2022-12-14 03:17:24,049 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 03:17:24,943 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 03:17:24,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985223342] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:17:24,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1007756953] [2022-12-14 03:17:24,943 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 03:17:24,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:17:24,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-12-14 03:17:24,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780374829] [2022-12-14 03:17:24,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:17:24,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-14 03:17:24,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:17:24,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-14 03:17:24,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=621, Unknown=12, NotChecked=102, Total=812 [2022-12-14 03:17:24,944 INFO L87 Difference]: Start difference. First operand 13584 states and 67733 transitions. Second operand has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 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 03:17:28,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:17:28,825 INFO L93 Difference]: Finished difference Result 35337 states and 162337 transitions. [2022-12-14 03:17:28,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-14 03:17:28,826 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 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 03:17:28,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:17:28,973 INFO L225 Difference]: With dead ends: 35337 [2022-12-14 03:17:28,973 INFO L226 Difference]: Without dead ends: 35337 [2022-12-14 03:17:28,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=566, Invalid=3336, Unknown=12, NotChecked=246, Total=4160 [2022-12-14 03:17:28,974 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1546 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2604 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1546 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 2604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 474 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-14 03:17:28,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1546 Valid, 0 Invalid, 3247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 2604 Invalid, 0 Unknown, 474 Unchecked, 1.8s Time] [2022-12-14 03:17:29,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35337 states. [2022-12-14 03:17:29,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35337 to 11883. [2022-12-14 03:17:29,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11883 states, 11803 states have (on average 4.923578751164958) internal successors, (58113), 11882 states have internal predecessors, (58113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:17:29,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11883 states to 11883 states and 58113 transitions. [2022-12-14 03:17:29,436 INFO L78 Accepts]: Start accepts. Automaton has 11883 states and 58113 transitions. Word has length 12 [2022-12-14 03:17:29,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:17:29,436 INFO L495 AbstractCegarLoop]: Abstraction has 11883 states and 58113 transitions. [2022-12-14 03:17:29,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 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 03:17:29,436 INFO L276 IsEmpty]: Start isEmpty. Operand 11883 states and 58113 transitions. [2022-12-14 03:17:29,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 03:17:29,437 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:17:29,437 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:17:29,442 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-12-14 03:17:29,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:17:29,638 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:17:29,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:17:29,639 INFO L85 PathProgramCache]: Analyzing trace with hash -704845704, now seen corresponding path program 1 times [2022-12-14 03:17:29,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:17:29,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003655135] [2022-12-14 03:17:29,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:17:29,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:17:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:17:29,949 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 03:17:29,950 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:17:29,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003655135] [2022-12-14 03:17:29,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003655135] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:17:29,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005109014] [2022-12-14 03:17:29,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:17:29,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:17:29,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:17:29,951 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:17:29,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-12-14 03:17:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:17:30,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-14 03:17:30,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:17:30,180 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 03:17:30,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:17:30,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 03:17:30,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:17:30,247 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 03:17:30,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:17:30,298 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 03:17:30,321 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 21 treesize of output 9 [2022-12-14 03:17:30,323 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 03:17:30,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:17:30,361 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2252 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2252) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 9223372039002259456))) is different from false [2022-12-14 03:17:32,512 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:17:32,512 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 03:17:32,521 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:17:32,521 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 03:17:32,528 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 1174 treesize of output 1110 [2022-12-14 03:17:32,536 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 1110 treesize of output 1078 [2022-12-14 03:17:32,545 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 03:17:33,765 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 03:17:33,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005109014] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:17:33,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [869014297] [2022-12-14 03:17:33,765 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 03:17:33,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:17:33,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-12-14 03:17:33,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869116407] [2022-12-14 03:17:33,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:17:33,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-14 03:17:33,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:17:33,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-14 03:17:33,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=614, Unknown=15, NotChecked=50, Total=756 [2022-12-14 03:17:33,767 INFO L87 Difference]: Start difference. First operand 11883 states and 58113 transitions. Second operand has 28 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:17:34,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:17:34,959 INFO L93 Difference]: Finished difference Result 18338 states and 88338 transitions. [2022-12-14 03:17:34,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 03:17:34,960 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 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 03:17:34,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:17:35,028 INFO L225 Difference]: With dead ends: 18338 [2022-12-14 03:17:35,028 INFO L226 Difference]: Without dead ends: 18338 [2022-12-14 03:17:35,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=191, Invalid=1278, Unknown=17, NotChecked=74, Total=1560 [2022-12-14 03:17:35,029 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 481 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 03:17:35,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 0 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1088 Invalid, 0 Unknown, 152 Unchecked, 0.6s Time] [2022-12-14 03:17:35,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18338 states. [2022-12-14 03:17:35,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18338 to 11970. [2022-12-14 03:17:35,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11970 states, 11890 states have (on average 4.915643397813288) internal successors, (58447), 11969 states have internal predecessors, (58447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:17:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11970 states to 11970 states and 58447 transitions. [2022-12-14 03:17:35,329 INFO L78 Accepts]: Start accepts. Automaton has 11970 states and 58447 transitions. Word has length 12 [2022-12-14 03:17:35,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:17:35,329 INFO L495 AbstractCegarLoop]: Abstraction has 11970 states and 58447 transitions. [2022-12-14 03:17:35,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:17:35,330 INFO L276 IsEmpty]: Start isEmpty. Operand 11970 states and 58447 transitions. [2022-12-14 03:17:35,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 03:17:35,330 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:17:35,331 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:17:35,335 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-12-14 03:17:35,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-12-14 03:17:35,532 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:17:35,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:17:35,533 INFO L85 PathProgramCache]: Analyzing trace with hash -704845703, now seen corresponding path program 1 times [2022-12-14 03:17:35,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:17:35,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321529059] [2022-12-14 03:17:35,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:17:35,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:17:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:17:35,862 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 03:17:35,862 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:17:35,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321529059] [2022-12-14 03:17:35,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321529059] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:17:35,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625994737] [2022-12-14 03:17:35,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:17:35,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:17:35,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:17:35,863 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:17:35,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-12-14 03:17:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:17:36,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-14 03:17:36,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:17:36,138 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 03:17:36,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:17:36,185 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 03:17:36,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:17:36,227 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 03:17:36,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:17:36,295 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 03:17:36,328 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-12-14 03:17:36,328 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 22 treesize of output 10 [2022-12-14 03:17:36,347 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 03:17:36,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:17:36,623 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:17:36,624 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 03:17:36,633 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:17:36,633 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 03:17:36,639 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 03:17:36,643 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 222 treesize of output 206 [2022-12-14 03:17:36,648 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 206 treesize of output 198 [2022-12-14 03:17:36,882 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 03:17:36,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625994737] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:17:36,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1817635745] [2022-12-14 03:17:36,882 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 03:17:36,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:17:36,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-12-14 03:17:36,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956782020] [2022-12-14 03:17:36,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:17:36,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-14 03:17:36,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:17:36,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-14 03:17:36,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=705, Unknown=15, NotChecked=0, Total=812 [2022-12-14 03:17:36,884 INFO L87 Difference]: Start difference. First operand 11970 states and 58447 transitions. Second operand has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 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 03:17:44,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:17:44,979 INFO L93 Difference]: Finished difference Result 27578 states and 128004 transitions. [2022-12-14 03:17:44,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-12-14 03:17:44,979 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 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 03:17:44,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:17:45,091 INFO L225 Difference]: With dead ends: 27578 [2022-12-14 03:17:45,091 INFO L226 Difference]: Without dead ends: 27578 [2022-12-14 03:17:45,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1756 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=935, Invalid=6086, Unknown=119, NotChecked=0, Total=7140 [2022-12-14 03:17:45,092 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1644 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3310 mSolverCounterSat, 136 mSolverCounterUnsat, 231 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1644 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 3310 IncrementalHoareTripleChecker+Invalid, 231 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-12-14 03:17:45,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1644 Valid, 0 Invalid, 3677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 3310 Invalid, 231 Unknown, 0 Unchecked, 3.1s Time] [2022-12-14 03:17:45,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27578 states. [2022-12-14 03:17:45,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27578 to 14324. [2022-12-14 03:17:45,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14324 states, 14244 states have (on average 4.971426565571469) internal successors, (70813), 14323 states have internal predecessors, (70813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:17:45,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14324 states to 14324 states and 70813 transitions. [2022-12-14 03:17:45,522 INFO L78 Accepts]: Start accepts. Automaton has 14324 states and 70813 transitions. Word has length 12 [2022-12-14 03:17:45,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:17:45,522 INFO L495 AbstractCegarLoop]: Abstraction has 14324 states and 70813 transitions. [2022-12-14 03:17:45,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 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 03:17:45,522 INFO L276 IsEmpty]: Start isEmpty. Operand 14324 states and 70813 transitions. [2022-12-14 03:17:45,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 03:17:45,523 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:17:45,523 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:17:45,529 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-12-14 03:17:45,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-12-14 03:17:45,724 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:17:45,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:17:45,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1736525572, now seen corresponding path program 2 times [2022-12-14 03:17:45,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:17:45,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843940210] [2022-12-14 03:17:45,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:17:45,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:17:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:17:46,119 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 03:17:46,119 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:17:46,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843940210] [2022-12-14 03:17:46,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843940210] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:17:46,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345389439] [2022-12-14 03:17:46,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 03:17:46,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:17:46,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:17:46,120 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:17:46,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-12-14 03:17:46,420 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 03:17:46,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 03:17:46,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-14 03:17:46,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:17:46,526 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 03:17:46,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:17:46,579 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 03:17:46,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:17:46,663 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 03:17:46,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:17:46,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-14 03:17:46,740 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-14 03:17:46,740 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 25 treesize of output 12 [2022-12-14 03:17:46,742 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 03:17:46,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:17:46,976 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:17:46,976 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 35 treesize of output 36 [2022-12-14 03:17:46,985 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:17:46,985 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 359 treesize of output 347 [2022-12-14 03:17:46,989 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 328 treesize of output 300 [2022-12-14 03:17:46,997 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 156 treesize of output 142 [2022-12-14 03:17:47,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 286 treesize of output 230 [2022-12-14 03:17:47,401 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 03:17:47,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345389439] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:17:47,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1284390143] [2022-12-14 03:17:47,401 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 03:17:47,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:17:47,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-12-14 03:17:47,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808963216] [2022-12-14 03:17:47,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:17:47,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-14 03:17:47,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:17:47,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-14 03:17:47,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=641, Unknown=8, NotChecked=0, Total=756 [2022-12-14 03:17:47,403 INFO L87 Difference]: Start difference. First operand 14324 states and 70813 transitions. Second operand has 28 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:17:59,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:17:59,006 INFO L93 Difference]: Finished difference Result 41077 states and 189626 transitions. [2022-12-14 03:17:59,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-12-14 03:17:59,006 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 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 03:17:59,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:17:59,186 INFO L225 Difference]: With dead ends: 41077 [2022-12-14 03:17:59,186 INFO L226 Difference]: Without dead ends: 41077 [2022-12-14 03:17:59,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2930 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1360, Invalid=8153, Unknown=189, NotChecked=0, Total=9702 [2022-12-14 03:17:59,188 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1775 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3057 mSolverCounterSat, 194 mSolverCounterUnsat, 432 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1775 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 3057 IncrementalHoareTripleChecker+Invalid, 432 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-12-14 03:17:59,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1775 Valid, 0 Invalid, 3683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 3057 Invalid, 432 Unknown, 0 Unchecked, 5.5s Time] [2022-12-14 03:17:59,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41077 states. [2022-12-14 03:17:59,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41077 to 16839. [2022-12-14 03:17:59,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16839 states, 16759 states have (on average 5.041947610239275) internal successors, (84498), 16838 states have internal predecessors, (84498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:17:59,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16839 states to 16839 states and 84498 transitions. [2022-12-14 03:17:59,827 INFO L78 Accepts]: Start accepts. Automaton has 16839 states and 84498 transitions. Word has length 12 [2022-12-14 03:17:59,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:17:59,827 INFO L495 AbstractCegarLoop]: Abstraction has 16839 states and 84498 transitions. [2022-12-14 03:17:59,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:17:59,827 INFO L276 IsEmpty]: Start isEmpty. Operand 16839 states and 84498 transitions. [2022-12-14 03:17:59,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 03:17:59,828 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:17:59,828 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:17:59,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-12-14 03:18:00,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:18:00,030 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:18:00,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:18:00,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1736525573, now seen corresponding path program 2 times [2022-12-14 03:18:00,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:18:00,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097450477] [2022-12-14 03:18:00,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:18:00,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:18:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:18:00,348 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 03:18:00,348 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:18:00,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097450477] [2022-12-14 03:18:00,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097450477] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:18:00,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806276694] [2022-12-14 03:18:00,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 03:18:00,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:18:00,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:18:00,349 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:18:00,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-12-14 03:18:00,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 03:18:00,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 03:18:00,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-14 03:18:00,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:18:00,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 15 treesize of output 11 [2022-12-14 03:18:00,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:18:00,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 03:18:00,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:18:00,901 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 03:18:00,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:18:00,957 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 03:18:01,002 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-14 03:18:01,002 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 23 treesize of output 10 [2022-12-14 03:18:01,025 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 03:18:01,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:18:01,310 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:18:01,310 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 33 treesize of output 34 [2022-12-14 03:18:01,320 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:18:01,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 649 treesize of output 619 [2022-12-14 03:18:01,332 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 301 treesize of output 273 [2022-12-14 03:18:01,339 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 574 treesize of output 518 [2022-12-14 03:18:01,347 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 406 [2022-12-14 03:18:01,688 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 03:18:01,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806276694] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:18:01,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1319459828] [2022-12-14 03:18:01,688 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 03:18:01,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:18:01,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-12-14 03:18:01,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017898721] [2022-12-14 03:18:01,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:18:01,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-14 03:18:01,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:18:01,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-14 03:18:01,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=707, Unknown=7, NotChecked=0, Total=812 [2022-12-14 03:18:01,690 INFO L87 Difference]: Start difference. First operand 16839 states and 84498 transitions. Second operand has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 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 03:18:19,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:18:19,130 INFO L93 Difference]: Finished difference Result 45902 states and 215929 transitions. [2022-12-14 03:18:19,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-12-14 03:18:19,131 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 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 03:18:19,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:18:19,341 INFO L225 Difference]: With dead ends: 45902 [2022-12-14 03:18:19,341 INFO L226 Difference]: Without dead ends: 45902 [2022-12-14 03:18:19,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 4 SyntacticMatches, 6 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4539 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=1854, Invalid=11303, Unknown=415, NotChecked=0, Total=13572 [2022-12-14 03:18:19,343 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 2658 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3392 mSolverCounterSat, 217 mSolverCounterUnsat, 495 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2658 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 3392 IncrementalHoareTripleChecker+Invalid, 495 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-12-14 03:18:19,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2658 Valid, 0 Invalid, 4104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 3392 Invalid, 495 Unknown, 0 Unchecked, 6.0s Time] [2022-12-14 03:18:19,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45902 states. [2022-12-14 03:18:19,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45902 to 19510. [2022-12-14 03:18:20,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19510 states, 19430 states have (on average 5.094956253216675) internal successors, (98995), 19509 states have internal predecessors, (98995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:18:20,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19510 states to 19510 states and 98995 transitions. [2022-12-14 03:18:20,083 INFO L78 Accepts]: Start accepts. Automaton has 19510 states and 98995 transitions. Word has length 12 [2022-12-14 03:18:20,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:18:20,083 INFO L495 AbstractCegarLoop]: Abstraction has 19510 states and 98995 transitions. [2022-12-14 03:18:20,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 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 03:18:20,083 INFO L276 IsEmpty]: Start isEmpty. Operand 19510 states and 98995 transitions. [2022-12-14 03:18:20,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 03:18:20,084 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:18:20,085 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:18:20,090 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-12-14 03:18:20,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-12-14 03:18:20,286 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:18:20,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:18:20,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1911663873, now seen corresponding path program 1 times [2022-12-14 03:18:20,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:18:20,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938746060] [2022-12-14 03:18:20,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:18:20,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:18:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:18:20,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:18:20,539 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:18:20,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938746060] [2022-12-14 03:18:20,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938746060] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:18:20,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388458595] [2022-12-14 03:18:20,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:18:20,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:18:20,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:18:20,540 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:18:20,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-12-14 03:18:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:18:20,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-14 03:18:20,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:18:20,768 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 03:18:20,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:18:20,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 03:18:20,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:18:20,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-14 03:18:20,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:18:20,862 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 03:18:20,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:18:20,888 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 03:18:20,904 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 21 treesize of output 9 [2022-12-14 03:18:20,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:18:20,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:18:20,968 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2528 (Array Int Int)) (v_ArrVal_2529 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2528) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2529) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i2~0 4))) 9223372039002259456))) is different from false [2022-12-14 03:18:25,161 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:18:25,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-12-14 03:18:25,170 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:18:25,170 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 615 treesize of output 605 [2022-12-14 03:18:25,182 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 295 treesize of output 263 [2022-12-14 03:18:25,188 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 558 treesize of output 494 [2022-12-14 03:18:25,194 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 494 treesize of output 478 [2022-12-14 03:18:25,199 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 478 treesize of output 470 [2022-12-14 03:18:26,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:18:26,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388458595] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 03:18:26,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [84870346] [2022-12-14 03:18:26,292 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 03:18:26,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 03:18:26,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-12-14 03:18:26,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965971814] [2022-12-14 03:18:26,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 03:18:26,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 03:18:26,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 03:18:26,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 03:18:26,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=451, Unknown=23, NotChecked=44, Total=600 [2022-12-14 03:18:26,294 INFO L87 Difference]: Start difference. First operand 19510 states and 98995 transitions. Second operand has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:18:27,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 03:18:27,254 INFO L93 Difference]: Finished difference Result 31015 states and 160277 transitions. [2022-12-14 03:18:27,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 03:18:27,255 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 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 03:18:27,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 03:18:27,392 INFO L225 Difference]: With dead ends: 31015 [2022-12-14 03:18:27,392 INFO L226 Difference]: Without dead ends: 31015 [2022-12-14 03:18:27,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=138, Invalid=712, Unknown=24, NotChecked=56, Total=930 [2022-12-14 03:18:27,393 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 506 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 03:18:27,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 0 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 375 Invalid, 0 Unknown, 42 Unchecked, 0.4s Time] [2022-12-14 03:18:27,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31015 states. [2022-12-14 03:18:27,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31015 to 23535. [2022-12-14 03:18:27,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23535 states, 23455 states have (on average 5.2581112769132385) internal successors, (123329), 23534 states have internal predecessors, (123329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:18:28,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23535 states to 23535 states and 123329 transitions. [2022-12-14 03:18:28,018 INFO L78 Accepts]: Start accepts. Automaton has 23535 states and 123329 transitions. Word has length 12 [2022-12-14 03:18:28,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 03:18:28,018 INFO L495 AbstractCegarLoop]: Abstraction has 23535 states and 123329 transitions. [2022-12-14 03:18:28,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 03:18:28,018 INFO L276 IsEmpty]: Start isEmpty. Operand 23535 states and 123329 transitions. [2022-12-14 03:18:28,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 03:18:28,019 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 03:18:28,019 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 03:18:28,025 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-12-14 03:18:28,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-12-14 03:18:28,221 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 69 more)] === [2022-12-14 03:18:28,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 03:18:28,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1911663874, now seen corresponding path program 1 times [2022-12-14 03:18:28,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 03:18:28,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995673978] [2022-12-14 03:18:28,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:18:28,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 03:18:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:18:28,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:18:28,543 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 03:18:28,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995673978] [2022-12-14 03:18:28,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995673978] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 03:18:28,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966861211] [2022-12-14 03:18:28,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 03:18:28,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 03:18:28,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 03:18:28,544 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 03:18:28,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_709b3deb-030e-42a6-a50c-8dd4a95d8ec2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-12-14 03:18:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 03:18:28,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-14 03:18:28,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 03:18:28,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 03:18:28,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:18:28,824 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 03:18:28,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:18:28,873 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 03:18:28,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:18:28,919 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 03:18:28,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 03:18:28,960 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 03:18:28,990 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 19 treesize of output 7 [2022-12-14 03:18:28,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 03:18:28,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 03:18:29,090 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2599 (Array Int Int)) (v_ArrVal_2598 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2598) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_2599) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i2~0 4))) 4294967296)) is different from false [2022-12-14 03:18:29,435 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:18:29,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 33 treesize of output 34 [2022-12-14 03:18:29,453 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 03:18:29,453 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 8769 treesize of output 8579 [2022-12-14 03:18:29,495 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 8566 treesize of output 7542 [2022-12-14 03:18:29,535 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 7542 treesize of output 7286 [2022-12-14 03:18:29,585 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 3643 treesize of output 3515 [2022-12-14 03:18:29,626 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 7158 treesize of output 6646